/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:18:35,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:18:35,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:18:35,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:18:35,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:18:35,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:18:35,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:18:35,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:18:35,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:18:35,941 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:18:35,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:18:35,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:18:35,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:18:35,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:18:35,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:18:35,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:18:35,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:18:35,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:18:35,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:18:35,948 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:18:35,949 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:18:35,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:18:35,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:18:35,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:18:35,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:18:35,957 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:18:35,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:18:35,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:18:35,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:18:35,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:18:35,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:18:35,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:18:35,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:18:35,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:18:35,961 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:18:35,962 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:18:35,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:18:35,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:18:35,963 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:18:35,963 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:18:35,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:18:35,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:18:35,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:18:35,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:18:35,979 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:18:35,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:18:35,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:18:35,981 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:18:35,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:18:35,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:18:35,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:18:35,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:18:35,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:18:35,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:18:35,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:18:35,982 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:18:35,983 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:18:36,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:18:36,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:18:36,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:18:36,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:18:36,191 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:18:36,192 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-08 04:18:36,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a26b5b2b/3c8e1113d1044c2a8a9af78168dd33d3/FLAGa1f208f63 [2022-04-08 04:18:36,598 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:18:36,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c [2022-04-08 04:18:36,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a26b5b2b/3c8e1113d1044c2a8a9af78168dd33d3/FLAGa1f208f63 [2022-04-08 04:18:36,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a26b5b2b/3c8e1113d1044c2a8a9af78168dd33d3 [2022-04-08 04:18:36,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:18:36,623 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:18:36,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:18:36,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:18:36,628 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:18:36,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f0b4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36, skipping insertion in model container [2022-04-08 04:18:36,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:18:36,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:18:36,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c[597,610] [2022-04-08 04:18:36,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:18:36,842 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:18:36,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/bresenham-ll.c[597,610] [2022-04-08 04:18:36,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:18:36,882 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:18:36,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36 WrapperNode [2022-04-08 04:18:36,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:18:36,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:18:36,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:18:36,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:18:36,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,904 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:18:36,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:18:36,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:18:36,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:18:36,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (1/1) ... [2022-04-08 04:18:36,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:18:36,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:36,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:18:36,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:18:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:18:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:18:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:18:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:18:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:18:36,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:18:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:18:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:18:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:18:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:18:36,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:18:36,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:18:37,021 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:18:37,022 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:18:37,187 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:18:37,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:18:37,194 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:18:37,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:18:37 BoogieIcfgContainer [2022-04-08 04:18:37,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:18:37,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:18:37,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:18:37,200 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:18:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:18:36" (1/3) ... [2022-04-08 04:18:37,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdc0cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:18:37, skipping insertion in model container [2022-04-08 04:18:37,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:18:36" (2/3) ... [2022-04-08 04:18:37,201 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bdc0cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:18:37, skipping insertion in model container [2022-04-08 04:18:37,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:18:37" (3/3) ... [2022-04-08 04:18:37,202 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll.c [2022-04-08 04:18:37,205 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:18:37,205 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:18:37,232 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:18:37,236 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:18:37,237 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:18:37,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:37,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:18:37,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:37,252 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:37,253 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:37,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:37,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 1 times [2022-04-08 04:18:37,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:37,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719143511] [2022-04-08 04:18:37,269 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:18:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash 2052809213, now seen corresponding path program 2 times [2022-04-08 04:18:37,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:37,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386788605] [2022-04-08 04:18:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:37,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:37,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:37,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2031431887] [2022-04-08 04:18:37,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:37,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:37,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:37,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:18:37,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:18:37,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 04:18:37,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:37,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 04:18:37,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:37,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:37,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2022-04-08 04:18:37,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 04:18:37,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:18:37,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #61#return; {27#true} is VALID [2022-04-08 04:18:37,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-08 04:18:37,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:37,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {51#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} is VALID [2022-04-08 04:18:37,568 INFO L272 TraceCheckUtils]: 7: Hoare triple {51#(and (= main_~xy~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~yx~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {55#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:37,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {55#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {59#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:37,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {59#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {28#false} is VALID [2022-04-08 04:18:37,569 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 04:18:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:37,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:18:37,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:37,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386788605] [2022-04-08 04:18:37,571 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:37,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031431887] [2022-04-08 04:18:37,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031431887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:37,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:37,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:18:37,574 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:37,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719143511] [2022-04-08 04:18:37,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719143511] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:37,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:37,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:18:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289688581] [2022-04-08 04:18:37,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:37,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:18:37,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:37,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:37,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:37,600 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:18:37,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:37,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:18:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:18:37,615 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:37,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:37,886 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2022-04-08 04:18:37,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:18:37,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:18:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:37,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 04:18:37,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-08 04:18:37,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-08 04:18:37,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:37,982 INFO L225 Difference]: With dead ends: 55 [2022-04-08 04:18:37,982 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:18:37,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 04:18:37,989 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:37,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:18:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:18:38,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 04:18:38,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:38,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:38,022 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:38,023 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:38,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:38,026 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 04:18:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:18:38,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:38,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:38,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:18:38,029 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:18:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:38,032 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-08 04:18:38,032 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-08 04:18:38,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:38,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:38,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:38,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:38,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-08 04:18:38,040 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 11 [2022-04-08 04:18:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:38,041 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-08 04:18:38,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:18:38,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-08 04:18:38,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-08 04:18:38,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 04:18:38,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:38,066 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:38,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:18:38,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-08 04:18:38,284 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 1 times [2022-04-08 04:18:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:38,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137913064] [2022-04-08 04:18:38,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:18:38,385 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:18:38,385 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:18:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 327600201, now seen corresponding path program 2 times [2022-04-08 04:18:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:38,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72297068] [2022-04-08 04:18:38,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:38,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:38,399 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:38,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348161594] [2022-04-08 04:18:38,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:38,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:38,401 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:18:38,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:18:38,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:18:38,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:38,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 04:18:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:38,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:38,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-08 04:18:38,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {285#true} is VALID [2022-04-08 04:18:38,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-08 04:18:38,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #61#return; {285#true} is VALID [2022-04-08 04:18:38,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret8 := main(); {285#true} is VALID [2022-04-08 04:18:38,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:38,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:38,677 INFO L272 TraceCheckUtils]: 7: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {285#true} is VALID [2022-04-08 04:18:38,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} ~cond := #in~cond; {285#true} is VALID [2022-04-08 04:18:38,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume !(0 == ~cond); {285#true} is VALID [2022-04-08 04:18:38,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-08 04:18:38,678 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {285#true} {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} #57#return; {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:38,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:38,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {305#(and (= main_~x~0 0) (= (+ (* (- 1) main_~X~0) (* main_~Y~0 2)) main_~v~0) (= main_~y~0 0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {330#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 04:18:38,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {330#(and (= main_~x~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {334#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} is VALID [2022-04-08 04:18:38,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {334#(and (= (+ (- 1) main_~x~0) 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {338#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-08 04:18:38,683 INFO L272 TraceCheckUtils]: 16: Hoare triple {338#(and (= main_~xy~0 0) (= main_~v~0 (+ (* (- 1) main_~X~0) (* main_~Y~0 4))) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:38,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:38,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-08 04:18:38,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-08 04:18:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:38,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:18:38,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-08 04:18:38,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {286#false} is VALID [2022-04-08 04:18:38,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:38,829 INFO L272 TraceCheckUtils]: 16: Hoare triple {362#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:38,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {362#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 04:18:38,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {370#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:38,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {370#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 04:18:38,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:38,894 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {285#true} {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #57#return; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:38,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-08 04:18:38,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {285#true} assume !(0 == ~cond); {285#true} is VALID [2022-04-08 04:18:38,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#true} ~cond := #in~cond; {285#true} is VALID [2022-04-08 04:18:38,894 INFO L272 TraceCheckUtils]: 7: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {285#true} is VALID [2022-04-08 04:18:38,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:38,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {285#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {366#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:38,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {285#true} call #t~ret8 := main(); {285#true} is VALID [2022-04-08 04:18:38,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {285#true} {285#true} #61#return; {285#true} is VALID [2022-04-08 04:18:38,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {285#true} assume true; {285#true} is VALID [2022-04-08 04:18:38,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {285#true} is VALID [2022-04-08 04:18:38,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-08 04:18:38,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 04:18:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:38,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72297068] [2022-04-08 04:18:38,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:38,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348161594] [2022-04-08 04:18:38,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348161594] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:18:38,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:18:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-08 04:18:38,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:38,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137913064] [2022-04-08 04:18:38,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137913064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:38,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:38,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:18:38,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886744679] [2022-04-08 04:18:38,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:38,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 04:18:38,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:38,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:38,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:38,919 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:18:38,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:38,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:18:38,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 04:18:38,920 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:39,206 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-04-08 04:18:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:18:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 04:18:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 04:18:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 04:18:39,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 04:18:39,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:39,280 INFO L225 Difference]: With dead ends: 40 [2022-04-08 04:18:39,280 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 04:18:39,281 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:18:39,281 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:39,282 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 87 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:18:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 04:18:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-08 04:18:39,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:39,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:39,297 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:39,297 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:39,299 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-08 04:18:39,299 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-08 04:18:39,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:39,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:39,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-08 04:18:39,300 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-08 04:18:39,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:39,301 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-08 04:18:39,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-08 04:18:39,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:39,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:39,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:39,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:39,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-08 04:18:39,304 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 20 [2022-04-08 04:18:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:39,304 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-08 04:18:39,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:39,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-08 04:18:39,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:39,338 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-08 04:18:39,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 04:18:39,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:39,338 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:39,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:18:39,552 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 04:18:39,553 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607563, now seen corresponding path program 1 times [2022-04-08 04:18:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:39,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022811263] [2022-04-08 04:18:39,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:18:39,612 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:18:39,612 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:18:39,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2102607563, now seen corresponding path program 2 times [2022-04-08 04:18:39,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:39,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073853558] [2022-04-08 04:18:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:39,622 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:39,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808042952] [2022-04-08 04:18:39,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:39,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:39,624 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:18:39,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 04:18:39,655 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:18:39,655 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:39,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 04:18:39,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:39,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:39,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2022-04-08 04:18:39,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-04-08 04:18:39,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-08 04:18:39,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #61#return; {641#true} is VALID [2022-04-08 04:18:39,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2022-04-08 04:18:39,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 04:18:39,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 04:18:39,817 INFO L272 TraceCheckUtils]: 7: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {641#true} is VALID [2022-04-08 04:18:39,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} ~cond := #in~cond; {641#true} is VALID [2022-04-08 04:18:39,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(0 == ~cond); {641#true} is VALID [2022-04-08 04:18:39,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-08 04:18:39,818 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {641#true} {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} #57#return; {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 04:18:39,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} is VALID [2022-04-08 04:18:39,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {661#(and (= main_~x~0 0) (= (+ main_~X~0 main_~v~0) (* main_~Y~0 2)) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {686#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 04:18:39,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {686#(and (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {690#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} is VALID [2022-04-08 04:18:39,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {690#(and (= (+ (- 1) main_~y~0) 0) (= main_~x~0 1) (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {694#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-08 04:18:39,821 INFO L272 TraceCheckUtils]: 16: Hoare triple {694#(and (= main_~v~0 (+ (* main_~X~0 (- 3)) (* main_~Y~0 4))) (= main_~X~0 main_~xy~0) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:39,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:39,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {642#false} is VALID [2022-04-08 04:18:39,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-04-08 04:18:39,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:18:39,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:18:39,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-04-08 04:18:39,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {642#false} is VALID [2022-04-08 04:18:39,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {698#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {702#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:39,953 INFO L272 TraceCheckUtils]: 16: Hoare triple {718#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {698#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:39,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {718#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 04:18:39,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {726#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:39,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {726#(= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))} is VALID [2022-04-08 04:18:39,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:39,958 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {641#true} {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} #57#return; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:39,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-08 04:18:39,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume !(0 == ~cond); {641#true} is VALID [2022-04-08 04:18:39,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} ~cond := #in~cond; {641#true} is VALID [2022-04-08 04:18:39,958 INFO L272 TraceCheckUtils]: 7: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {641#true} is VALID [2022-04-08 04:18:39,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:39,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {722#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:39,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {641#true} call #t~ret8 := main(); {641#true} is VALID [2022-04-08 04:18:39,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {641#true} {641#true} #61#return; {641#true} is VALID [2022-04-08 04:18:39,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume true; {641#true} is VALID [2022-04-08 04:18:39,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-04-08 04:18:39,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {641#true} call ULTIMATE.init(); {641#true} is VALID [2022-04-08 04:18:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 04:18:39,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:39,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073853558] [2022-04-08 04:18:39,960 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:39,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808042952] [2022-04-08 04:18:39,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808042952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:18:39,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:18:39,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-04-08 04:18:39,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:39,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022811263] [2022-04-08 04:18:39,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022811263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:39,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:39,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 04:18:39,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734490052] [2022-04-08 04:18:39,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 04:18:39,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:39,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:39,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:39,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 04:18:39,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:39,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 04:18:39,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-08 04:18:39,978 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:40,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:40,266 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-04-08 04:18:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 04:18:40,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-08 04:18:40,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 04:18:40,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2022-04-08 04:18:40,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2022-04-08 04:18:40,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:40,314 INFO L225 Difference]: With dead ends: 48 [2022-04-08 04:18:40,314 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 04:18:40,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-08 04:18:40,322 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:40,323 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:18:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 04:18:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-04-08 04:18:40,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:40,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:18:40,344 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:18:40,344 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:18:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:40,346 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 04:18:40,346 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 04:18:40,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:40,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:40,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-08 04:18:40,347 INFO L87 Difference]: Start difference. First operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-08 04:18:40,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:40,349 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 04:18:40,349 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 04:18:40,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:40,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:40,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:40,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 31 states have internal predecessors, (33), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 04:18:40,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-08 04:18:40,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 20 [2022-04-08 04:18:40,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:40,351 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-08 04:18:40,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:18:40,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-08 04:18:40,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-08 04:18:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 04:18:40,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:40,384 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:40,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 04:18:40,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:40,602 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:40,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:40,602 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 1 times [2022-04-08 04:18:40,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:40,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875702573] [2022-04-08 04:18:40,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:18:40,642 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:18:40,642 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:18:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 890152080, now seen corresponding path program 2 times [2022-04-08 04:18:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:40,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921953675] [2022-04-08 04:18:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:40,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:40,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132080071] [2022-04-08 04:18:40,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:18:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:40,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:18:40,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 04:18:40,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:18:40,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:40,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 04:18:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:40,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:41,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2022-04-08 04:18:41,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1047#true} is VALID [2022-04-08 04:18:41,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-08 04:18:41,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2022-04-08 04:18:41,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret8 := main(); {1047#true} is VALID [2022-04-08 04:18:41,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {1047#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:41,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:41,084 INFO L272 TraceCheckUtils]: 7: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-08 04:18:41,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#true} ~cond := #in~cond; {1047#true} is VALID [2022-04-08 04:18:41,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !(0 == ~cond); {1047#true} is VALID [2022-04-08 04:18:41,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-08 04:18:41,085 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1047#true} {1067#(and (= main_~x~0 0) (= main_~y~0 0))} #57#return; {1067#(and (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:41,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1067#(and (= main_~x~0 0) (= main_~y~0 0))} assume !!(~x~0 <= ~X~0); {1089#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} is VALID [2022-04-08 04:18:41,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {1089#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= main_~y~0 0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1093#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-08 04:18:41,089 INFO L290 TraceCheckUtils]: 14: Hoare triple {1093#(and (<= main_~x~0 main_~X~0) (= main_~x~0 0) (= (+ (- 1) main_~y~0) 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1097#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 04:18:41,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {1097#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (<= main_~x~0 (+ main_~X~0 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 04:18:41,089 INFO L272 TraceCheckUtils]: 16: Hoare triple {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-08 04:18:41,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {1047#true} ~cond := #in~cond; {1108#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:41,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {1108#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:18:41,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:18:41,091 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} {1101#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)) (<= main_~x~0 (+ main_~X~0 1)))} #57#return; {1119#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 04:18:41,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {1119#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (<= main_~x~0 (+ main_~X~0 1)))} assume !(~x~0 <= ~X~0); {1123#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} is VALID [2022-04-08 04:18:41,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {1123#(and (= (+ (- 1) main_~x~0) 0) (= (+ (- 1) main_~y~0) 0) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (<= main_~x~0 main_~X~0)) (<= main_~x~0 (+ main_~X~0 1)))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1127#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} is VALID [2022-04-08 04:18:41,094 INFO L272 TraceCheckUtils]: 23: Hoare triple {1127#(and (not (<= 1 main_~X~0)) (= (+ (- 1) main_~y~0) 0) (= main_~y~0 main_~xy~0) (<= 0 main_~X~0) (= (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0) (* main_~Y~0 4)) (= main_~Y~0 main_~yx~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:41,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:41,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1048#false} is VALID [2022-04-08 04:18:41,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2022-04-08 04:18:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 04:18:41,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:18:41,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {1048#false} assume !false; {1048#false} is VALID [2022-04-08 04:18:41,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {1135#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1048#false} is VALID [2022-04-08 04:18:41,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1135#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:18:41,716 INFO L272 TraceCheckUtils]: 23: Hoare triple {1151#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {1131#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:18:41,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {1155#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {1151#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:18:41,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {1159#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} assume !(~x~0 <= ~X~0); {1155#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 04:18:41,719 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} {1163#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} #57#return; {1159#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 04:18:41,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:18:41,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {1173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1112#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:18:41,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {1047#true} ~cond := #in~cond; {1173#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:18:41,721 INFO L272 TraceCheckUtils]: 16: Hoare triple {1163#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-08 04:18:41,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {1180#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1163#(or (<= main_~x~0 main_~X~0) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0)))))} is VALID [2022-04-08 04:18:41,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {1184#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1180#(or (<= main_~x~0 main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* 2 (* main_~y~0 main_~x~0)) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* main_~Y~0 main_~x~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))))} is VALID [2022-04-08 04:18:41,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1188#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1184#(or (<= (+ main_~x~0 1) main_~X~0) (forall ((main_~Y~0 Int)) (= (+ (* (* (+ main_~x~0 1) main_~y~0) 2) (* main_~Y~0 2) (* (* main_~X~0 main_~y~0) (- 2)) (* 2 (* (+ main_~x~0 1) main_~Y~0))) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))))} is VALID [2022-04-08 04:18:41,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {1047#true} assume !!(~x~0 <= ~X~0); {1188#(or (forall ((main_~Y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0)) (* 2 (* (+ main_~x~0 1) (+ main_~y~0 1))) (* (* main_~X~0 (+ main_~y~0 1)) (- 2))) (+ 2 (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* (+ main_~x~0 1) main_~Y~0))))) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 04:18:41,728 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1047#true} {1047#true} #57#return; {1047#true} is VALID [2022-04-08 04:18:41,728 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-08 04:18:41,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#true} assume !(0 == ~cond); {1047#true} is VALID [2022-04-08 04:18:41,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#true} ~cond := #in~cond; {1047#true} is VALID [2022-04-08 04:18:41,728 INFO L272 TraceCheckUtils]: 7: Hoare triple {1047#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1047#true} is VALID [2022-04-08 04:18:41,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {1047#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1047#true} is VALID [2022-04-08 04:18:41,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {1047#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1047#true} is VALID [2022-04-08 04:18:41,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {1047#true} call #t~ret8 := main(); {1047#true} is VALID [2022-04-08 04:18:41,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1047#true} {1047#true} #61#return; {1047#true} is VALID [2022-04-08 04:18:41,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {1047#true} assume true; {1047#true} is VALID [2022-04-08 04:18:41,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {1047#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1047#true} is VALID [2022-04-08 04:18:41,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {1047#true} call ULTIMATE.init(); {1047#true} is VALID [2022-04-08 04:18:41,730 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 04:18:41,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:18:41,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921953675] [2022-04-08 04:18:41,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:18:41,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132080071] [2022-04-08 04:18:41,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132080071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:18:41,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:18:41,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-04-08 04:18:41,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:18:41,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875702573] [2022-04-08 04:18:41,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875702573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:18:41,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:18:41,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 04:18:41,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954451097] [2022-04-08 04:18:41,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:18:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-08 04:18:41,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:18:41,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:41,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:41,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 04:18:41,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:41,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 04:18:41,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-08 04:18:41,759 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:42,325 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-04-08 04:18:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 04:18:42,326 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-08 04:18:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:18:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-08 04:18:42,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:42,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 44 transitions. [2022-04-08 04:18:42,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 44 transitions. [2022-04-08 04:18:42,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:42,366 INFO L225 Difference]: With dead ends: 53 [2022-04-08 04:18:42,366 INFO L226 Difference]: Without dead ends: 45 [2022-04-08 04:18:42,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2022-04-08 04:18:42,367 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:18:42,368 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 99 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 04:18:42,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-08 04:18:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-04-08 04:18:42,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:18:42,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:42,380 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:42,380 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:42,382 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-08 04:18:42,382 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-08 04:18:42,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:42,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:42,383 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-08 04:18:42,384 INFO L87 Difference]: Start difference. First operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-04-08 04:18:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:18:42,385 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-08 04:18:42,385 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-08 04:18:42,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:18:42,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:18:42,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:18:42,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:18:42,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:18:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-08 04:18:42,386 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 27 [2022-04-08 04:18:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:18:42,387 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-08 04:18:42,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:18:42,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-08 04:18:42,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:18:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-08 04:18:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 04:18:42,421 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:18:42,421 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:18:42,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 04:18:42,627 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:42,627 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:18:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:18:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1671149437, now seen corresponding path program 3 times [2022-04-08 04:18:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:18:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478314818] [2022-04-08 04:18:42,672 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:18:42,672 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:18:42,672 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:18:42,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1671149437, now seen corresponding path program 4 times [2022-04-08 04:18:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:18:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977393257] [2022-04-08 04:18:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:18:42,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:18:42,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:18:42,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1977240559] [2022-04-08 04:18:42,681 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:18:42,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:18:42,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:18:42,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:18:42,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 04:18:42,718 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:18:42,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:18:42,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 04:18:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:18:42,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:18:56,639 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:18:59,204 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:19:09,205 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:19:50,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2022-04-08 04:19:50,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1506#true} is VALID [2022-04-08 04:19:50,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-08 04:19:50,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #61#return; {1506#true} is VALID [2022-04-08 04:19:50,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret8 := main(); {1506#true} is VALID [2022-04-08 04:19:50,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1506#true} is VALID [2022-04-08 04:19:50,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 04:19:50,775 INFO L272 TraceCheckUtils]: 7: Hoare triple {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-08 04:19:50,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} ~cond := #in~cond; {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:19:50,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:19:50,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:19:50,777 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1529#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:50,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:50,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-08 04:19:50,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:50,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1561#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 04:19:50,780 INFO L272 TraceCheckUtils]: 16: Hoare triple {1561#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-08 04:19:50,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} ~cond := #in~cond; {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:19:50,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {1536#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:19:50,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:19:50,781 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1561#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:50,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:50,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-08 04:19:50,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:52,786 WARN L290 TraceCheckUtils]: 24: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1589#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0)))) (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod main_~yx~0 main_~Y~0) 0) (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) (+ (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 2))) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} is UNKNOWN [2022-04-08 04:19:52,793 INFO L272 TraceCheckUtils]: 25: Hoare triple {1589#(or (and (= main_~xy~0 0) (= main_~X~0 0) (or (and (= (+ (* (div main_~yx~0 main_~Y~0) main_~Y~0) (div (+ main_~X~0 main_~v~0) (- 2)) main_~Y~0) 0) (= (mod main_~yx~0 main_~Y~0) 0) (= (mod (+ (* (div main_~yx~0 main_~Y~0) (- 2) main_~Y~0) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0))) (and (exists ((main_~x~0 Int) (main_~y~0 Int)) (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))) (= main_~yx~0 0) (= main_~Y~0 0)))) (and (or (and (= main_~Y~0 (+ (* (div main_~xy~0 main_~X~0) main_~X~0) (div (+ (* (- 1) main_~X~0) (* (- 1) main_~v~0)) (- 2)))) (= main_~yx~0 0) (= (mod (+ main_~X~0 main_~v~0 (* (- 2) (div main_~xy~0 main_~X~0) main_~X~0)) 2) 0)) (and (= (mod main_~yx~0 main_~Y~0) 0) (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) (+ (* (* (div main_~yx~0 main_~Y~0) main_~Y~0) 2) (* main_~Y~0 2))) (not (= main_~Y~0 0)))) (not (= main_~X~0 0)) (= (mod main_~xy~0 main_~X~0) 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:19:52,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:19:52,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {1597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1507#false} is VALID [2022-04-08 04:19:52,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-04-08 04:19:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-08 04:19:52,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:19:55,585 INFO L290 TraceCheckUtils]: 28: Hoare triple {1507#false} assume !false; {1507#false} is VALID [2022-04-08 04:19:55,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {1597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1507#false} is VALID [2022-04-08 04:19:55,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:19:55,586 INFO L272 TraceCheckUtils]: 25: Hoare triple {1613#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:19:55,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1613#(= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))} is VALID [2022-04-08 04:19:55,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:55,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1554#(= main_~v~0 (+ (* main_~Y~0 main_~x~0 2) (* (- 1) main_~X~0) (* (- 2) main_~X~0 main_~y~0) (* main_~Y~0 4)))} is VALID [2022-04-08 04:19:55,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} assume !!(~x~0 <= ~X~0); {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:55,607 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} {1629#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} #57#return; {1547#(= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:19:55,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:19:55,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {1639#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1540#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:19:55,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {1506#true} ~cond := #in~cond; {1639#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:19:55,609 INFO L272 TraceCheckUtils]: 16: Hoare triple {1629#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1629#(or (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (not (= (+ (* 2 main_~xy~0) main_~X~0 main_~v~0) (+ (* main_~Y~0 2) (* 2 main_~yx~0)))))} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {1506#true} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {1506#true} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1506#true} assume !!(~x~0 <= ~X~0); {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1506#true} {1506#true} #57#return; {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {1506#true} assume !(0 == ~cond); {1506#true} is VALID [2022-04-08 04:19:55,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {1506#true} ~cond := #in~cond; {1506#true} is VALID [2022-04-08 04:19:55,611 INFO L272 TraceCheckUtils]: 7: Hoare triple {1506#true} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1506#true} is VALID [2022-04-08 04:19:55,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {1506#true} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1506#true} is VALID [2022-04-08 04:19:55,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {1506#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1506#true} is VALID [2022-04-08 04:19:55,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {1506#true} call #t~ret8 := main(); {1506#true} is VALID [2022-04-08 04:19:55,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1506#true} {1506#true} #61#return; {1506#true} is VALID [2022-04-08 04:19:55,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1506#true} assume true; {1506#true} is VALID [2022-04-08 04:19:55,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1506#true} is VALID [2022-04-08 04:19:55,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {1506#true} call ULTIMATE.init(); {1506#true} is VALID [2022-04-08 04:19:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-08 04:19:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:19:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977393257] [2022-04-08 04:19:55,616 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:19:55,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977240559] [2022-04-08 04:19:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977240559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:19:55,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:19:55,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2022-04-08 04:19:55,616 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:19:55,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478314818] [2022-04-08 04:19:55,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478314818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:19:55,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:19:55,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 04:19:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948925341] [2022-04-08 04:19:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:19:55,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-08 04:19:55,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:19:55,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:19:57,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:19:57,646 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 04:19:57,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:19:57,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 04:19:57,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=144, Unknown=2, NotChecked=0, Total=182 [2022-04-08 04:19:57,647 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:20:32,980 WARN L232 SmtUtils]: Spent 35.10s on a formula simplification. DAG size of input: 69 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 04:20:33,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:20:33,260 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-08 04:20:33,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 04:20:33,260 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 29 [2022-04-08 04:20:33,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:20:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:20:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-08 04:20:33,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:20:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-08 04:20:33,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-08 04:20:35,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:20:35,343 INFO L225 Difference]: With dead ends: 41 [2022-04-08 04:20:35,343 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 04:20:35,343 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 39.9s TimeCoverageRelationStatistics Valid=57, Invalid=213, Unknown=2, NotChecked=0, Total=272 [2022-04-08 04:20:35,344 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 04:20:35,344 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 19 Unchecked, 0.2s Time] [2022-04-08 04:20:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 04:20:35,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 04:20:35,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:20:35,368 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:20:35,368 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:20:35,368 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:20:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:20:35,369 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 04:20:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 04:20:35,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:20:35,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:20:35,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 04:20:35,369 INFO L87 Difference]: Start difference. First operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 37 states. [2022-04-08 04:20:35,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:20:35,370 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-08 04:20:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 04:20:35,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:20:35,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:20:35,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:20:35,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:20:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:20:35,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-08 04:20:35,371 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 29 [2022-04-08 04:20:35,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:20:35,372 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-08 04:20:35,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.875) internal successors, (15), 10 states have internal predecessors, (15), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:20:35,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-08 04:20:37,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:20:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-08 04:20:37,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 04:20:37,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:20:37,439 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:20:37,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 04:20:37,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:20:37,640 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:20:37,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:20:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 1 times [2022-04-08 04:20:37,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:20:37,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1767018670] [2022-04-08 04:20:37,683 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:20:37,683 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:20:37,683 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:20:37,683 INFO L85 PathProgramCache]: Analyzing trace with hash -178233442, now seen corresponding path program 2 times [2022-04-08 04:20:37,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:20:37,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441108720] [2022-04-08 04:20:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:20:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:20:37,699 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:20:37,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [107230987] [2022-04-08 04:20:37,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:20:37,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:20:37,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:20:37,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:20:37,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 04:20:37,745 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:20:37,745 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:20:37,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 04:20:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:20:37,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:20:50,402 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:20:58,994 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:21:18,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-08 04:21:18,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-08 04:21:18,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-08 04:21:18,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #61#return; {1929#true} is VALID [2022-04-08 04:21:18,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret8 := main(); {1929#true} is VALID [2022-04-08 04:21:18,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,603 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-08 04:21:18,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-08 04:21:18,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-08 04:21:18,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-08 04:21:18,611 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,612 INFO L272 TraceCheckUtils]: 16: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-08 04:21:18,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-08 04:21:18,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-08 04:21:18,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-08 04:21:18,613 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,614 INFO L290 TraceCheckUtils]: 23: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:18,614 INFO L290 TraceCheckUtils]: 24: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} is VALID [2022-04-08 04:21:18,614 INFO L272 TraceCheckUtils]: 25: Hoare triple {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-08 04:21:18,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {1929#true} ~cond := #in~cond; {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:21:18,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {2014#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:21:18,615 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:21:18,616 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2007#(and (= (* main_~X~0 main_~y~0) main_~xy~0) (= main_~y~0 0) (= main_~yx~0 (* main_~Y~0 main_~x~0)))} #57#return; {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-08 04:21:18,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} assume !(~x~0 <= ~X~0); {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} is VALID [2022-04-08 04:21:20,619 WARN L290 TraceCheckUtils]: 31: Hoare triple {2025#(and (= (+ (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= main_~y~0 0))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2032#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} is UNKNOWN [2022-04-08 04:21:20,621 INFO L272 TraceCheckUtils]: 32: Hoare triple {2032#(and (= main_~y~0 0) (or (and (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (= main_~xy~0 0) (= main_~yx~0 0) (= 0 (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)))) (and (= (* main_~y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0)) main_~xy~0) (= (mod (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0) 0) (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0) (not (= main_~Y~0 0)) (= main_~yx~0 (* main_~Y~0 (div (+ (* main_~X~0 main_~y~0) (div (+ main_~X~0 main_~v~0) 2) (* (- 1) main_~Y~0)) main_~Y~0))))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:21:20,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:21:20,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1930#false} is VALID [2022-04-08 04:21:20,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-08 04:21:20,622 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 04:21:20,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:21:24,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {1930#false} assume !false; {1930#false} is VALID [2022-04-08 04:21:24,808 INFO L290 TraceCheckUtils]: 34: Hoare triple {2040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1930#false} is VALID [2022-04-08 04:21:24,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:21:24,809 INFO L272 TraceCheckUtils]: 32: Hoare triple {2056#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:21:24,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2056#(= (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* 2 main_~xy~0) main_~X~0 main_~v~0))} is VALID [2022-04-08 04:21:24,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} assume !(~x~0 <= ~X~0); {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 04:21:24,816 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} {2067#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} #57#return; {2060#(= (+ (* 2 (* main_~y~0 main_~x~0)) main_~X~0 main_~v~0) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 04:21:24,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:21:24,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {2077#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2018#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:21:24,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {1929#true} ~cond := #in~cond; {2077#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:21:24,817 INFO L272 TraceCheckUtils]: 25: Hoare triple {2067#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-08 04:21:24,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2067#(= (+ (* 2 (* main_~y~0 main_~x~0)) (* (- 2) main_~xy~0) (* main_~Y~0 2) (* 2 main_~yx~0)) (+ (* main_~y~0 2) (* main_~Y~0 2) (* 2 (* main_~Y~0 main_~x~0))))} is VALID [2022-04-08 04:21:24,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,834 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-08 04:21:24,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-08 04:21:24,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-08 04:21:24,834 INFO L272 TraceCheckUtils]: 16: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-08 04:21:24,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {1949#(= main_~y~0 0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1949#(= main_~y~0 0)} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1949#(= main_~y~0 0)} assume !!(~x~0 <= ~X~0); {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,836 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1929#true} {1949#(= main_~y~0 0)} #57#return; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-08 04:21:24,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1929#true} assume !(0 == ~cond); {1929#true} is VALID [2022-04-08 04:21:24,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {1929#true} ~cond := #in~cond; {1929#true} is VALID [2022-04-08 04:21:24,836 INFO L272 TraceCheckUtils]: 7: Hoare triple {1949#(= main_~y~0 0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {1929#true} is VALID [2022-04-08 04:21:24,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {1949#(= main_~y~0 0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {1949#(= main_~y~0 0)} is VALID [2022-04-08 04:21:24,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#true} call #t~ret8 := main(); {1929#true} is VALID [2022-04-08 04:21:24,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1929#true} {1929#true} #61#return; {1929#true} is VALID [2022-04-08 04:21:24,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {1929#true} assume true; {1929#true} is VALID [2022-04-08 04:21:24,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {1929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1929#true} is VALID [2022-04-08 04:21:24,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {1929#true} call ULTIMATE.init(); {1929#true} is VALID [2022-04-08 04:21:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 04:21:24,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:21:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441108720] [2022-04-08 04:21:24,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:21:24,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107230987] [2022-04-08 04:21:24,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107230987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:21:24,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:21:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2022-04-08 04:21:24,838 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:21:24,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1767018670] [2022-04-08 04:21:24,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1767018670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:24,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:24,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 04:21:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807610101] [2022-04-08 04:21:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:21:24,838 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-08 04:21:24,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:21:24,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:21:26,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:26,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 04:21:26,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:26,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 04:21:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-08 04:21:26,860 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:21:28,896 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:21:32,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:21:34,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:21:37,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:21:39,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:21:41,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 04:21:43,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:43,478 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2022-04-08 04:21:43,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 04:21:43,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2022-04-08 04:21:43,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:21:43,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:21:43,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-08 04:21:43,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:21:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-08 04:21:43,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-08 04:21:45,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:45,518 INFO L225 Difference]: With dead ends: 52 [2022-04-08 04:21:45,518 INFO L226 Difference]: Without dead ends: 46 [2022-04-08 04:21:45,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2022-04-08 04:21:45,519 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 7 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:21:45,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 76 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 12.1s Time] [2022-04-08 04:21:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-08 04:21:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-04-08 04:21:45,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:21:45,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:21:45,536 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:21:45,536 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:21:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:45,537 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 04:21:45,537 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 04:21:45,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:45,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:45,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-08 04:21:45,538 INFO L87 Difference]: Start difference. First operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 46 states. [2022-04-08 04:21:45,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:45,539 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-04-08 04:21:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-08 04:21:45,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:45,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:45,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:21:45,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:21:45,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:21:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-04-08 04:21:45,541 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2022-04-08 04:21:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:21:45,541 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-04-08 04:21:45,541 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:21:45,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 50 transitions. [2022-04-08 04:21:49,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 48 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-04-08 04:21:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 04:21:49,638 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:21:49,638 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:21:49,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 04:21:49,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:21:49,839 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:21:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:21:49,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1189350692, now seen corresponding path program 1 times [2022-04-08 04:21:49,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:49,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340480239] [2022-04-08 04:21:49,910 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:21:49,910 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:21:49,910 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:21:49,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1189350692, now seen corresponding path program 2 times [2022-04-08 04:21:49,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:21:49,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344097052] [2022-04-08 04:21:49,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:21:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:21:49,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:21:49,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [533088904] [2022-04-08 04:21:49,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:21:49,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:21:49,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:21:49,920 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:21:49,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 04:21:49,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:21:49,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:21:49,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 04:21:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:49,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:21:50,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2022-04-08 04:21:50,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2452#true} is VALID [2022-04-08 04:21:50,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #61#return; {2452#true} is VALID [2022-04-08 04:21:50,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret8 := main(); {2452#true} is VALID [2022-04-08 04:21:50,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {2452#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 04:21:50,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 04:21:50,633 INFO L272 TraceCheckUtils]: 7: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-08 04:21:50,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-08 04:21:50,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-08 04:21:50,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,633 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} #57#return; {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 04:21:50,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume !!(~x~0 <= ~X~0); {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} is VALID [2022-04-08 04:21:50,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#(and (<= main_~x~0 0) (<= (* main_~Y~0 2) (+ main_~X~0 main_~v~0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2497#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 04:21:50,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {2497#(and (<= main_~x~0 0) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 04:21:50,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 04:21:50,636 INFO L272 TraceCheckUtils]: 16: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-08 04:21:50,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-08 04:21:50,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-08 04:21:50,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,637 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2452#true} {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} #57#return; {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 04:21:50,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !!(~x~0 <= ~X~0); {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} is VALID [2022-04-08 04:21:50,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {2501#(and (<= main_~x~0 1) (< (div (+ (- 1) (* (- 1) main_~v~0)) (- 2)) (+ (div (+ (- 1) main_~X~0) 2) 1)))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2526#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 04:21:50,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#(and (<= main_~x~0 1) (< 0 (div (+ (- 1) main_~X~0) 2)))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 04:21:50,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 04:21:50,639 INFO L272 TraceCheckUtils]: 25: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-08 04:21:50,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-08 04:21:50,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-08 04:21:50,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,639 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2452#true} {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} #57#return; {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} is VALID [2022-04-08 04:21:50,640 INFO L290 TraceCheckUtils]: 30: Hoare triple {2530#(and (<= main_~x~0 2) (< 0 (div (+ (- 1) main_~X~0) 2)))} assume !(~x~0 <= ~X~0); {2453#false} is VALID [2022-04-08 04:21:50,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {2453#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2453#false} is VALID [2022-04-08 04:21:50,640 INFO L272 TraceCheckUtils]: 32: Hoare triple {2453#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2453#false} is VALID [2022-04-08 04:21:50,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2022-04-08 04:21:50,640 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2022-04-08 04:21:50,640 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-04-08 04:21:50,641 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 04:21:50,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 04:21:50,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-04-08 04:21:50,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#false} assume 0 == ~cond; {2453#false} is VALID [2022-04-08 04:21:50,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#false} ~cond := #in~cond; {2453#false} is VALID [2022-04-08 04:21:50,858 INFO L272 TraceCheckUtils]: 32: Hoare triple {2453#false} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 + 2 * ~y~0 then 1 else 0)); {2453#false} is VALID [2022-04-08 04:21:50,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {2453#false} ~xy~0 := ~x~0 * ~y~0;~yx~0 := ~Y~0 * ~x~0; {2453#false} is VALID [2022-04-08 04:21:50,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {2582#(<= main_~x~0 main_~X~0)} assume !(~x~0 <= ~X~0); {2453#false} is VALID [2022-04-08 04:21:50,859 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2452#true} {2582#(<= main_~x~0 main_~X~0)} #57#return; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 04:21:50,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-08 04:21:50,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-08 04:21:50,859 INFO L272 TraceCheckUtils]: 25: Hoare triple {2582#(<= main_~x~0 main_~X~0)} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-08 04:21:50,859 INFO L290 TraceCheckUtils]: 24: Hoare triple {2582#(<= main_~x~0 main_~X~0)} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 04:21:50,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {2604#(<= (+ main_~x~0 1) main_~X~0)} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2582#(<= main_~x~0 main_~X~0)} is VALID [2022-04-08 04:21:50,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !(~v~0 < 0);~v~0 := ~v~0 + 2 * (~Y~0 - ~X~0);#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {2604#(<= (+ main_~x~0 1) main_~X~0)} is VALID [2022-04-08 04:21:50,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !!(~x~0 <= ~X~0); {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 04:21:50,870 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2452#true} {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} #57#return; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 04:21:50,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-08 04:21:50,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-08 04:21:50,871 INFO L272 TraceCheckUtils]: 16: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-08 04:21:50,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 04:21:50,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {2633#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} #t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7; {2608#(or (< main_~v~0 0) (<= (+ main_~x~0 1) main_~X~0))} is VALID [2022-04-08 04:21:50,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume ~v~0 < 0;~v~0 := ~v~0 + 2 * ~Y~0; {2633#(or (<= (+ main_~x~0 2) main_~X~0) (< main_~v~0 0))} is VALID [2022-04-08 04:21:50,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !!(~x~0 <= ~X~0); {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-08 04:21:50,873 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2452#true} {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} #57#return; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-08 04:21:50,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#true} assume !(0 == ~cond); {2452#true} is VALID [2022-04-08 04:21:50,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#true} ~cond := #in~cond; {2452#true} is VALID [2022-04-08 04:21:50,873 INFO L272 TraceCheckUtils]: 7: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} call __VERIFIER_assert((if 0 == 2 * ~yx~0 - 2 * ~xy~0 - ~X~0 + 2 * ~Y~0 - ~v~0 then 1 else 0)); {2452#true} is VALID [2022-04-08 04:21:50,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} assume !false;~yx~0 := ~Y~0 * ~x~0;~xy~0 := ~X~0 * ~y~0; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-08 04:21:50,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {2452#true} havoc ~X~0;havoc ~Y~0;havoc ~x~0;havoc ~y~0;havoc ~v~0;havoc ~xy~0;havoc ~yx~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~X~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~Y~0 := #t~nondet5;havoc #t~nondet5;~v~0 := 2 * ~Y~0 - ~X~0;~y~0 := 0;~x~0 := 0; {2637#(or (<= (+ main_~x~0 2) main_~X~0) (< (+ main_~v~0 (* main_~Y~0 2)) 0) (not (< main_~v~0 0)))} is VALID [2022-04-08 04:21:50,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {2452#true} call #t~ret8 := main(); {2452#true} is VALID [2022-04-08 04:21:50,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2452#true} {2452#true} #61#return; {2452#true} is VALID [2022-04-08 04:21:50,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume true; {2452#true} is VALID [2022-04-08 04:21:50,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2452#true} is VALID [2022-04-08 04:21:50,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {2452#true} call ULTIMATE.init(); {2452#true} is VALID [2022-04-08 04:21:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 04:21:50,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:21:50,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344097052] [2022-04-08 04:21:50,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:21:50,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533088904] [2022-04-08 04:21:50,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533088904] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 04:21:50,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 04:21:50,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 04:21:50,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:21:50,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340480239] [2022-04-08 04:21:50,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340480239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:21:50,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:21:50,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 04:21:50,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398153119] [2022-04-08 04:21:50,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:21:50,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 04:21:50,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:21:50,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:21:50,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:50,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 04:21:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:50,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 04:21:50,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:21:50,896 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:21:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:51,136 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-04-08 04:21:51,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:21:51,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 04:21:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:21:51,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:21:51,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-08 04:21:51,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:21:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-08 04:21:51,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-08 04:21:51,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:51,180 INFO L225 Difference]: With dead ends: 59 [2022-04-08 04:21:51,180 INFO L226 Difference]: Without dead ends: 53 [2022-04-08 04:21:51,181 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-04-08 04:21:51,181 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:21:51,181 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:21:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-08 04:21:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-04-08 04:21:51,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:21:51,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:21:51,223 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:21:51,223 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:21:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:51,225 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 04:21:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 04:21:51,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:51,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:51,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-08 04:21:51,225 INFO L87 Difference]: Start difference. First operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 53 states. [2022-04-08 04:21:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:21:51,226 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-04-08 04:21:51,226 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-04-08 04:21:51,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:21:51,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:21:51,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:21:51,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:21:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 04:21:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2022-04-08 04:21:51,228 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 36 [2022-04-08 04:21:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:21:51,228 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2022-04-08 04:21:51,228 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:21:51,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 57 transitions. [2022-04-08 04:21:57,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 54 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 04:21:57,412 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2022-04-08 04:21:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 04:21:57,413 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:21:57,413 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:21:57,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 04:21:57,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:21:57,614 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:21:57,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:21:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 3 times [2022-04-08 04:21:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:21:57,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [386345364] [2022-04-08 04:21:57,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 5 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:21:57,715 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 04:21:57,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 04:21:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1983671776, now seen corresponding path program 4 times [2022-04-08 04:21:57,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:21:57,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930663540] [2022-04-08 04:21:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:21:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:21:57,724 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:21:57,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1846631966] [2022-04-08 04:21:57,724 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 04:21:57,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:21:57,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:21:57,733 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:21:57,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 04:21:58,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 04:21:58,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:21:58,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 04:21:58,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:21:58,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:22:11,210 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:22:18,521 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:22:24,539 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 04:22:30,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~X~0 1)) (.cse2 (+ (* (- 1) c_main_~Y~0) (div (+ c_main_~v~0 c_main_~X~0) 2) (* c_main_~X~0 c_main_~y~0))) (.cse0 (= c_main_~Y~0 0)) (.cse4 (= (mod (+ (* 2 c_main_~X~0 c_main_~y~0) c_main_~v~0 c_main_~X~0) 2) 0))) (or (let ((.cse1 (div .cse2 c_main_~Y~0))) (and (not .cse0) (not (<= .cse1 c_main_~X~0)) (= (mod .cse2 c_main_~Y~0) 0) (= c_main_~xy~0 (* c_main_~y~0 .cse1)) (<= .cse1 .cse3) (= c_main_~yx~0 (* c_main_~Y~0 .cse1)) .cse4)) (and (let ((.cse6 (= c_main_~y~0 0))) (or (let ((.cse5 (div c_main_~xy~0 c_main_~y~0))) (and (<= .cse5 .cse3) (= (mod c_main_~xy~0 c_main_~y~0) 0) (not .cse6) (< c_main_~X~0 .cse5))) (and .cse6 (= c_main_~xy~0 0)))) (= 0 .cse2) .cse0 (= c_main_~yx~0 0) .cse4))) is different from false