/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/prodbin-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:26:05,481 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:26:05,483 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:26:05,518 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:26:05,519 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:26:05,519 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:26:05,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:26:05,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:26:05,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:26:05,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:26:05,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:26:05,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:26:05,530 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:26:05,530 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:26:05,531 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:26:05,532 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:26:05,533 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:26:05,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:26:05,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:26:05,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:26:05,536 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:26:05,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:26:05,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:26:05,548 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:26:05,549 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:26:05,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:26:05,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:26:05,552 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:26:05,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:26:05,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:26:05,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:26:05,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:26:05,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:26:05,554 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:26:05,554 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:26:05,555 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:26:05,555 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:26:05,556 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:26:05,556 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:26:05,556 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:26:05,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:26:05,563 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:26:05,564 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:26:05,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:26:05,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:26:05,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:26:05,572 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:26:05,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:26:05,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:26:05,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:26:05,572 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:26:05,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:26:05,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:26:05,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:26:05,573 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:26:05,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:26:05,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:26:05,574 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:26:05,575 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:26:05,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:26:05,575 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:26:05,575 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-15 07:26:05,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:26:05,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:26:05,750 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:26:05,751 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:26:05,751 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:26:05,752 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/prodbin-ll.c [2022-04-15 07:26:05,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d33d5d6/2bb450eb22834306947a997b8667ba90/FLAGc89d2efe7 [2022-04-15 07:26:06,126 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:26:06,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/prodbin-ll.c [2022-04-15 07:26:06,131 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d33d5d6/2bb450eb22834306947a997b8667ba90/FLAGc89d2efe7 [2022-04-15 07:26:06,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3d33d5d6/2bb450eb22834306947a997b8667ba90 [2022-04-15 07:26:06,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:26:06,141 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:26:06,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:26:06,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:26:06,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:26:06,145 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06, skipping insertion in model container [2022-04-15 07:26:06,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,150 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:26:06,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:26:06,276 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/prodbin-ll.c[537,550] [2022-04-15 07:26:06,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:26:06,298 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:26:06,314 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/prodbin-ll.c[537,550] [2022-04-15 07:26:06,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:26:06,325 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:26:06,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06 WrapperNode [2022-04-15 07:26:06,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:26:06,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:26:06,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:26:06,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:26:06,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,341 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,343 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:26:06,344 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:26:06,344 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:26:06,344 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:26:06,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (1/1) ... [2022-04-15 07:26:06,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:26:06,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:06,370 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-15 07:26:06,386 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-15 07:26:06,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:26:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:26:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:26:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:26:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:26:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:26:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:26:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:26:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:26:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:26:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 07:26:06,411 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:26:06,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:26:06,464 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:26:06,465 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:26:06,568 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:26:06,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:26:06,573 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:26:06,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:26:06 BoogieIcfgContainer [2022-04-15 07:26:06,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:26:06,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:26:06,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:26:06,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:26:06,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:26:06" (1/3) ... [2022-04-15 07:26:06,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0c26ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:26:06, skipping insertion in model container [2022-04-15 07:26:06,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:26:06" (2/3) ... [2022-04-15 07:26:06,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b0c26ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:26:06, skipping insertion in model container [2022-04-15 07:26:06,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:26:06" (3/3) ... [2022-04-15 07:26:06,580 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll.c [2022-04-15 07:26:06,583 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:26:06,584 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:26:06,613 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:26:06,618 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-15 07:26:06,618 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:26:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:26:06,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:26:06,636 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:06,637 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:06,637 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2112761405, now seen corresponding path program 1 times [2022-04-15 07:26:06,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:06,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951325415] [2022-04-15 07:26:06,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:26:06,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2112761405, now seen corresponding path program 2 times [2022-04-15 07:26:06,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:06,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150145896] [2022-04-15 07:26:06,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:06,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:06,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:26:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:06,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 07:26:06,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 07:26:06,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #64#return; {32#true} is VALID [2022-04-15 07:26:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:26:06,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:06,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 07:26:06,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 07:26:06,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 07:26:06,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-15 07:26:06,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:26:06,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-15 07:26:06,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-15 07:26:06,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #64#return; {32#true} is VALID [2022-04-15 07:26:06,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-15 07:26:06,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-15 07:26:06,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {32#true} is VALID [2022-04-15 07:26:06,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-15 07:26:06,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-15 07:26:06,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-15 07:26:06,806 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-15 07:26:06,806 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {33#false} is VALID [2022-04-15 07:26:06,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#false} assume false; {33#false} is VALID [2022-04-15 07:26:06,807 INFO L272 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {33#false} is VALID [2022-04-15 07:26:06,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-15 07:26:06,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-15 07:26:06,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-15 07:26:06,808 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-15 07:26:06,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:06,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150145896] [2022-04-15 07:26:06,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150145896] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:06,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:06,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:26:06,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:06,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951325415] [2022-04-15 07:26:06,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951325415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:26:06,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559033177] [2022-04-15 07:26:06,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:06,819 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:26:06,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:06,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:06,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:06,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:26:06,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:26:06,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:26:06,857 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:06,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:06,963 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2022-04-15 07:26:06,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:26:06,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:26:06,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:26:06,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-15 07:26:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:06,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2022-04-15 07:26:06,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2022-04-15 07:26:07,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:07,053 INFO L225 Difference]: With dead ends: 49 [2022-04-15 07:26:07,053 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 07:26:07,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:26:07,061 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:26:07,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:26:07,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 07:26:07,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 07:26:07,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:26:07,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-15 07:26:07,087 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-15 07:26:07,087 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-15 07:26:07,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:07,090 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 07:26:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 07:26:07,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:07,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:07,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 24 states. [2022-04-15 07:26:07,091 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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 24 states. [2022-04-15 07:26:07,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:07,093 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 07:26:07,093 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 07:26:07,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:07,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:07,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:26:07,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:26:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 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-15 07:26:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 07:26:07,096 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-04-15 07:26:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:26:07,096 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 07:26:07,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:07,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 07:26:07,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 07:26:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:26:07,128 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:07,128 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:07,128 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:26:07,129 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:07,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:07,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1500360061, now seen corresponding path program 1 times [2022-04-15 07:26:07,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:07,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159120236] [2022-04-15 07:26:07,136 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:26:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1500360061, now seen corresponding path program 2 times [2022-04-15 07:26:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337323008] [2022-04-15 07:26:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:07,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:07,161 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:26:07,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020675291] [2022-04-15 07:26:07,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:26:07,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:07,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:07,163 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-15 07:26:07,165 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-15 07:26:07,201 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 07:26:07,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:26:07,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 07:26:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:07,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:07,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {238#true} call ULTIMATE.init(); {238#true} is VALID [2022-04-15 07:26:07,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {238#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(13, 2);call #Ultimate.allocInit(12, 3); {238#true} is VALID [2022-04-15 07:26:07,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 07:26:07,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {238#true} {238#true} #64#return; {238#true} is VALID [2022-04-15 07:26:07,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {238#true} call #t~ret6 := main(); {238#true} is VALID [2022-04-15 07:26:07,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {238#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {238#true} is VALID [2022-04-15 07:26:07,325 INFO L272 TraceCheckUtils]: 6: Hoare triple {238#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {238#true} is VALID [2022-04-15 07:26:07,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#true} ~cond := #in~cond; {238#true} is VALID [2022-04-15 07:26:07,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {238#true} assume !(0 == ~cond); {238#true} is VALID [2022-04-15 07:26:07,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {238#true} assume true; {238#true} is VALID [2022-04-15 07:26:07,326 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {238#true} {238#true} #58#return; {238#true} is VALID [2022-04-15 07:26:07,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {238#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:07,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:07,328 INFO L272 TraceCheckUtils]: 13: Hoare triple {276#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:07,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:07,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {239#false} is VALID [2022-04-15 07:26:07,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-04-15 07:26:07,329 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-15 07:26:07,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:26:07,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:07,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337323008] [2022-04-15 07:26:07,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:26:07,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020675291] [2022-04-15 07:26:07,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020675291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:07,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:07,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:26:07,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:07,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159120236] [2022-04-15 07:26:07,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159120236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:07,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:07,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:26:07,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314738242] [2022-04-15 07:26:07,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:07,332 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:26:07,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:07,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:07,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:07,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:26:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:07,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:26:07,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:26:07,346 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:07,487 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 07:26:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:26:07,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:26:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:26:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:07,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 07:26:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-15 07:26:07,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-15 07:26:07,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:07,519 INFO L225 Difference]: With dead ends: 36 [2022-04-15 07:26:07,519 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 07:26:07,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:26:07,521 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:26:07,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:26:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 07:26:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-15 07:26:07,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:26:07,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:26:07,530 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:26:07,530 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:26:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:07,532 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 07:26:07,532 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 07:26:07,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:07,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:07,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 07:26:07,533 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 07:26:07,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:07,535 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 07:26:07,535 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 07:26:07,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:07,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:07,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:26:07,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:26:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 07:26:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 07:26:07,537 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 17 [2022-04-15 07:26:07,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:26:07,537 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 07:26:07,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:26:07,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 07:26:07,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:07,564 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 07:26:07,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:26:07,565 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:07,565 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:07,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 07:26:07,782 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:07,783 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:07,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:07,783 INFO L85 PathProgramCache]: Analyzing trace with hash 966896435, now seen corresponding path program 1 times [2022-04-15 07:26:07,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:07,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705047825] [2022-04-15 07:26:07,784 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:26:07,784 INFO L85 PathProgramCache]: Analyzing trace with hash 966896435, now seen corresponding path program 2 times [2022-04-15 07:26:07,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:07,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372993941] [2022-04-15 07:26:07,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:07,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:07,795 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:26:07,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [817089092] [2022-04-15 07:26:07,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:26:07,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:07,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:07,802 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-15 07:26:07,803 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-15 07:26:07,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:26:07,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:26:07,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:26:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:07,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:07,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {495#true} call ULTIMATE.init(); {495#true} is VALID [2022-04-15 07:26:07,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#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(13, 2);call #Ultimate.allocInit(12, 3); {495#true} is VALID [2022-04-15 07:26:07,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-15 07:26:07,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {495#true} {495#true} #64#return; {495#true} is VALID [2022-04-15 07:26:07,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {495#true} call #t~ret6 := main(); {495#true} is VALID [2022-04-15 07:26:07,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {495#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {495#true} is VALID [2022-04-15 07:26:07,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {495#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {495#true} is VALID [2022-04-15 07:26:07,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#true} ~cond := #in~cond; {521#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:26:07,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {521#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {525#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:07,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {525#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {525#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:07,950 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {525#(not (= |assume_abort_if_not_#in~cond| 0))} {495#true} #58#return; {532#(<= 1 main_~b~0)} is VALID [2022-04-15 07:26:07,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {536#(<= 1 main_~y~0)} is VALID [2022-04-15 07:26:07,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(<= 1 main_~y~0)} assume !false; {536#(<= 1 main_~y~0)} is VALID [2022-04-15 07:26:07,952 INFO L272 TraceCheckUtils]: 13: Hoare triple {536#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {495#true} is VALID [2022-04-15 07:26:07,952 INFO L290 TraceCheckUtils]: 14: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-04-15 07:26:07,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {495#true} assume !(0 == ~cond); {495#true} is VALID [2022-04-15 07:26:07,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {495#true} assume true; {495#true} is VALID [2022-04-15 07:26:07,953 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {495#true} {536#(<= 1 main_~y~0)} #60#return; {536#(<= 1 main_~y~0)} is VALID [2022-04-15 07:26:07,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {536#(<= 1 main_~y~0)} assume !(0 != ~y~0); {496#false} is VALID [2022-04-15 07:26:07,953 INFO L272 TraceCheckUtils]: 19: Hoare triple {496#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {496#false} is VALID [2022-04-15 07:26:07,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {496#false} ~cond := #in~cond; {496#false} is VALID [2022-04-15 07:26:07,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {496#false} assume 0 == ~cond; {496#false} is VALID [2022-04-15 07:26:07,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {496#false} assume !false; {496#false} is VALID [2022-04-15 07:26:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:26:07,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:26:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:07,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372993941] [2022-04-15 07:26:07,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:26:07,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817089092] [2022-04-15 07:26:07,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817089092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:07,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:07,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:26:07,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:07,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705047825] [2022-04-15 07:26:07,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705047825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:07,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:07,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:26:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602327559] [2022-04-15 07:26:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:07,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:26:07,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:07,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:07,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:07,977 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:26:07,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:07,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:26:07,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:26:07,977 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:08,114 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-04-15 07:26:08,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:26:08,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 07:26:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:26:08,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:08,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 07:26:08,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 07:26:08,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 07:26:08,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:08,145 INFO L225 Difference]: With dead ends: 40 [2022-04-15 07:26:08,145 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 07:26:08,145 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-15 07:26:08,146 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:26:08,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:26:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 07:26:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-15 07:26:08,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:26:08,162 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 07:26:08,163 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 07:26:08,163 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 07:26:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:08,164 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 07:26:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 07:26:08,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:08,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:08,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 33 states. [2022-04-15 07:26:08,165 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 33 states. [2022-04-15 07:26:08,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:08,166 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-15 07:26:08,166 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-15 07:26:08,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:08,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:08,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:26:08,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:26:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 07:26:08,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 07:26:08,168 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-15 07:26:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:26:08,168 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 07:26:08,168 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:08,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 07:26:08,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:08,197 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 07:26:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 07:26:08,197 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:08,197 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:08,213 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-15 07:26:08,413 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,SelfDestructingSolverStorable2 [2022-04-15 07:26:08,413 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:08,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:08,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1614734214, now seen corresponding path program 1 times [2022-04-15 07:26:08,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:08,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227420681] [2022-04-15 07:26:12,513 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:26:12,513 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:26:12,513 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:26:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1614734214, now seen corresponding path program 2 times [2022-04-15 07:26:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:12,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95645847] [2022-04-15 07:26:12,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:12,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:12,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:26:12,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546354895] [2022-04-15 07:26:12,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:26:12,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:12,539 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-15 07:26:12,563 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-15 07:26:12,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:26:12,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:26:12,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 07:26:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:12,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:17,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-15 07:26:17,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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(13, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-15 07:26:17,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-15 07:26:17,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-15 07:26:17,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-15 07:26:17,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-15 07:26:17,363 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {781#true} is VALID [2022-04-15 07:26:17,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:26:17,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {807#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:17,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {811#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:17,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {811#(not (= |assume_abort_if_not_#in~cond| 0))} {781#true} #58#return; {818#(<= 1 main_~b~0)} is VALID [2022-04-15 07:26:17,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {818#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:17,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:17,366 INFO L272 TraceCheckUtils]: 13: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {781#true} is VALID [2022-04-15 07:26:17,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-15 07:26:17,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-15 07:26:17,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-15 07:26:17,367 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {781#true} {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:17,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:17,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {822#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {847#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:17,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {847#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:26:17,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:26:17,371 INFO L272 TraceCheckUtils]: 22: Hoare triple {851#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:17,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:17,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-15 07:26:17,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-15 07:26:17,373 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-15 07:26:17,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:26:40,708 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#false} assume !false; {782#false} is VALID [2022-04-15 07:26:40,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {862#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {782#false} is VALID [2022-04-15 07:26:40,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {858#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {862#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:40,710 INFO L272 TraceCheckUtils]: 22: Hoare triple {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {858#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:40,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:26:40,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {885#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {878#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:26:40,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {885#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:26:40,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:26:40,717 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {781#true} {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #60#return; {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:26:40,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-15 07:26:40,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {781#true} assume !(0 == ~cond); {781#true} is VALID [2022-04-15 07:26:40,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {781#true} ~cond := #in~cond; {781#true} is VALID [2022-04-15 07:26:40,718 INFO L272 TraceCheckUtils]: 13: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {781#true} is VALID [2022-04-15 07:26:40,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:26:40,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {914#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {889#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:26:40,722 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {811#(not (= |assume_abort_if_not_#in~cond| 0))} {781#true} #58#return; {914#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-15 07:26:40,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {811#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:40,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {927#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {811#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:40,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#true} ~cond := #in~cond; {927#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 07:26:40,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {781#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {781#true} is VALID [2022-04-15 07:26:40,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {781#true} is VALID [2022-04-15 07:26:40,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#true} call #t~ret6 := main(); {781#true} is VALID [2022-04-15 07:26:40,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#true} {781#true} #64#return; {781#true} is VALID [2022-04-15 07:26:40,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#true} assume true; {781#true} is VALID [2022-04-15 07:26:40,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {781#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(13, 2);call #Ultimate.allocInit(12, 3); {781#true} is VALID [2022-04-15 07:26:40,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {781#true} call ULTIMATE.init(); {781#true} is VALID [2022-04-15 07:26:40,724 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-15 07:26:40,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:26:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95645847] [2022-04-15 07:26:40,724 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:26:40,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546354895] [2022-04-15 07:26:40,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546354895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:26:40,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:26:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-15 07:26:40,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:26:40,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227420681] [2022-04-15 07:26:40,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227420681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:26:40,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:26:40,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:26:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717272785] [2022-04-15 07:26:40,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:26:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 07:26:40,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:26:40,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:40,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:40,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:26:40,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:40,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:26:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:26:40,747 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:41,156 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2022-04-15 07:26:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:26:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 07:26:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:26:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:41,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-15 07:26:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 51 transitions. [2022-04-15 07:26:41,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 51 transitions. [2022-04-15 07:26:41,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:41,198 INFO L225 Difference]: With dead ends: 49 [2022-04-15 07:26:41,198 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 07:26:41,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:26:41,199 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:26:41,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 111 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:26:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 07:26:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2022-04-15 07:26:41,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:26:41,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:26:41,221 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:26:41,221 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:26:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:41,222 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 07:26:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 07:26:41,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:41,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:41,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 07:26:41,223 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 07:26:41,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:26:41,224 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 07:26:41,225 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 07:26:41,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:26:41,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:26:41,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:26:41,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:26:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:26:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2022-04-15 07:26:41,226 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 26 [2022-04-15 07:26:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:26:41,227 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2022-04-15 07:26:41,227 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:26:41,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 43 transitions. [2022-04-15 07:26:41,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:26:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2022-04-15 07:26:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 07:26:41,269 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:26:41,269 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:26:41,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 07:26:41,477 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:41,478 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:26:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:26:41,478 INFO L85 PathProgramCache]: Analyzing trace with hash -160273148, now seen corresponding path program 1 times [2022-04-15 07:26:41,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:26:41,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [535443148] [2022-04-15 07:26:41,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:26:41,872 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:26:41,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:26:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash -160273148, now seen corresponding path program 2 times [2022-04-15 07:26:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:26:41,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822463924] [2022-04-15 07:26:41,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:26:41,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:26:41,887 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:26:41,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034453088] [2022-04-15 07:26:41,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:26:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:26:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:26:41,899 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-15 07:26:41,903 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-15 07:26:41,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:26:41,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:26:41,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 07:26:41,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:26:41,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:26:43,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {1217#true} call ULTIMATE.init(); {1217#true} is VALID [2022-04-15 07:26:43,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#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(13, 2);call #Ultimate.allocInit(12, 3); {1217#true} is VALID [2022-04-15 07:26:43,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-15 07:26:43,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1217#true} {1217#true} #64#return; {1217#true} is VALID [2022-04-15 07:26:43,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {1217#true} call #t~ret6 := main(); {1217#true} is VALID [2022-04-15 07:26:43,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1217#true} is VALID [2022-04-15 07:26:43,242 INFO L272 TraceCheckUtils]: 6: Hoare triple {1217#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1217#true} is VALID [2022-04-15 07:26:43,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#true} ~cond := #in~cond; {1243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:26:43,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {1243#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1247#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:43,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {1247#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1247#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:26:43,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1247#(not (= |assume_abort_if_not_#in~cond| 0))} {1217#true} #58#return; {1254#(<= 1 main_~b~0)} is VALID [2022-04-15 07:26:43,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {1254#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:43,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:43,244 INFO L272 TraceCheckUtils]: 13: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1217#true} is VALID [2022-04-15 07:26:43,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#true} ~cond := #in~cond; {1217#true} is VALID [2022-04-15 07:26:43,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#true} assume !(0 == ~cond); {1217#true} is VALID [2022-04-15 07:26:43,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-15 07:26:43,245 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1217#true} {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:43,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:43,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {1258#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1283#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:26:43,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {1283#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:26:43,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:26:43,813 INFO L272 TraceCheckUtils]: 22: Hoare triple {1287#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 1 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:26:43,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:26:43,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1218#false} is VALID [2022-04-15 07:26:43,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#false} assume !false; {1218#false} is VALID [2022-04-15 07:26:43,815 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-15 07:26:43,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:27:12,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {1218#false} assume !false; {1218#false} is VALID [2022-04-15 07:27:12,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1218#false} is VALID [2022-04-15 07:27:12,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:12,663 INFO L272 TraceCheckUtils]: 22: Hoare triple {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:12,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:27:12,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {1321#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1314#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:27:12,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1321#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:27:12,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:27:12,672 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1217#true} {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #60#return; {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:27:12,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-15 07:27:12,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {1217#true} assume !(0 == ~cond); {1217#true} is VALID [2022-04-15 07:27:12,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1217#true} ~cond := #in~cond; {1217#true} is VALID [2022-04-15 07:27:12,672 INFO L272 TraceCheckUtils]: 13: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1217#true} is VALID [2022-04-15 07:27:12,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:27:13,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {1217#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1325#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:27:13,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1217#true} {1217#true} #58#return; {1217#true} is VALID [2022-04-15 07:27:13,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-15 07:27:13,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {1217#true} assume !(0 == ~cond); {1217#true} is VALID [2022-04-15 07:27:13,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1217#true} ~cond := #in~cond; {1217#true} is VALID [2022-04-15 07:27:13,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {1217#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1217#true} is VALID [2022-04-15 07:27:13,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1217#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1217#true} is VALID [2022-04-15 07:27:13,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {1217#true} call #t~ret6 := main(); {1217#true} is VALID [2022-04-15 07:27:13,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1217#true} {1217#true} #64#return; {1217#true} is VALID [2022-04-15 07:27:13,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {1217#true} assume true; {1217#true} is VALID [2022-04-15 07:27:13,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1217#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(13, 2);call #Ultimate.allocInit(12, 3); {1217#true} is VALID [2022-04-15 07:27:13,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {1217#true} call ULTIMATE.init(); {1217#true} is VALID [2022-04-15 07:27:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:27:13,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:27:13,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822463924] [2022-04-15 07:27:13,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:27:13,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034453088] [2022-04-15 07:27:13,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034453088] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:27:13,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:27:13,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 13 [2022-04-15 07:27:13,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:27:13,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [535443148] [2022-04-15 07:27:13,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [535443148] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:27:13,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:27:13,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:27:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541633748] [2022-04-15 07:27:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:27:13,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 07:27:13,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:27:13,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:27:13,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:13,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:27:13,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:13,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:27:13,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=122, Unknown=1, NotChecked=0, Total=156 [2022-04-15 07:27:13,519 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:27:17,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:27:20,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:27:24,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:27:25,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:27:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:26,651 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-04-15 07:27:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:27:26,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 07:27:26,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:27:26,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:27:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-15 07:27:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:27:26,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2022-04-15 07:27:26,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2022-04-15 07:27:28,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 47 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:28,693 INFO L225 Difference]: With dead ends: 53 [2022-04-15 07:27:28,693 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:27:28,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=41, Invalid=168, Unknown=1, NotChecked=0, Total=210 [2022-04-15 07:27:28,694 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:27:28,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 117 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-04-15 07:27:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:27:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2022-04-15 07:27:28,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:27:28,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:27:28,745 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:27:28,745 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:27:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:28,747 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 07:27:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 07:27:28,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:28,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:28,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-04-15 07:27:28,748 INFO L87 Difference]: Start difference. First operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 51 states. [2022-04-15 07:27:28,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:28,750 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-04-15 07:27:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-04-15 07:27:28,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:28,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:28,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:27:28,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:27:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.125) internal successors, (36), 34 states have internal predecessors, (36), 8 states have call successors, (8), 7 states have call predecessors, (8), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:27:28,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 07:27:28,753 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 26 [2022-04-15 07:27:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:27:28,753 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 07:27:28,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 8 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 07:27:28,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 07:27:30,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:30,811 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 07:27:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:27:30,811 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:27:30,811 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, 1, 1, 1, 1, 1] [2022-04-15 07:27:30,828 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-15 07:27:31,012 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:27:31,012 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:27:31,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:27:31,013 INFO L85 PathProgramCache]: Analyzing trace with hash 730472692, now seen corresponding path program 1 times [2022-04-15 07:27:31,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:31,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648852733] [2022-04-15 07:27:31,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:27:31,231 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:27:31,231 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:27:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 730472692, now seen corresponding path program 2 times [2022-04-15 07:27:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:27:31,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737151194] [2022-04-15 07:27:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:27:31,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:27:31,246 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:27:31,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255069103] [2022-04-15 07:27:31,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:27:31,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:27:31,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:27:31,251 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-15 07:27:31,252 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-15 07:27:31,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:27:31,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:27:31,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 07:27:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:27:31,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:27:38,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {1691#true} call ULTIMATE.init(); {1691#true} is VALID [2022-04-15 07:27:38,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#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(13, 2);call #Ultimate.allocInit(12, 3); {1691#true} is VALID [2022-04-15 07:27:38,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-04-15 07:27:38,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1691#true} {1691#true} #64#return; {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {1691#true} call #t~ret6 := main(); {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L272 TraceCheckUtils]: 6: Hoare triple {1691#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-04-15 07:27:38,558 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1691#true} {1691#true} #58#return; {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1691#true} assume !false; {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L272 TraceCheckUtils]: 13: Hoare triple {1691#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1691#true} {1691#true} #60#return; {1691#true} is VALID [2022-04-15 07:27:38,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#true} assume !!(0 != ~y~0); {1691#true} is VALID [2022-04-15 07:27:38,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {1691#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1691#true} is VALID [2022-04-15 07:27:38,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {1691#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1691#true} is VALID [2022-04-15 07:27:38,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {1691#true} assume !false; {1691#true} is VALID [2022-04-15 07:27:38,560 INFO L272 TraceCheckUtils]: 22: Hoare triple {1691#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1691#true} is VALID [2022-04-15 07:27:38,565 INFO L290 TraceCheckUtils]: 23: Hoare triple {1691#true} ~cond := #in~cond; {1765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:38,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {1765#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:38,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:40,568 WARN L284 TraceCheckUtils]: 26: Hoare quadruple {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} {1691#true} #60#return; {1776#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-15 07:27:40,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {1776#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {1780#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:27:40,570 INFO L272 TraceCheckUtils]: 28: Hoare triple {1780#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:40,570 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:40,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {1788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1692#false} is VALID [2022-04-15 07:27:40,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2022-04-15 07:27:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 07:27:40,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:27:47,630 INFO L290 TraceCheckUtils]: 31: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2022-04-15 07:27:47,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {1788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1692#false} is VALID [2022-04-15 07:27:47,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {1784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:27:47,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {1780#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {1784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:27:47,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {1807#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {1780#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:27:47,633 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} {1691#true} #60#return; {1807#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:27:47,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:47,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {1820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1769#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:27:47,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {1691#true} ~cond := #in~cond; {1820#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:27:47,634 INFO L272 TraceCheckUtils]: 22: Hoare triple {1691#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1691#true} is VALID [2022-04-15 07:27:47,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {1691#true} assume !false; {1691#true} is VALID [2022-04-15 07:27:47,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {1691#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1691#true} is VALID [2022-04-15 07:27:47,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {1691#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1691#true} is VALID [2022-04-15 07:27:47,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#true} assume !!(0 != ~y~0); {1691#true} is VALID [2022-04-15 07:27:47,634 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1691#true} {1691#true} #60#return; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L272 TraceCheckUtils]: 13: Hoare triple {1691#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {1691#true} assume !false; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1691#true} {1691#true} #58#return; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-04-15 07:27:47,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {1691#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {1691#true} call #t~ret6 := main(); {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1691#true} {1691#true} #64#return; {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#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(13, 2);call #Ultimate.allocInit(12, 3); {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {1691#true} call ULTIMATE.init(); {1691#true} is VALID [2022-04-15 07:27:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 07:27:47,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:27:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737151194] [2022-04-15 07:27:47,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:27:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255069103] [2022-04-15 07:27:47,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255069103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:27:47,637 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:27:47,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 07:27:47,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:27:47,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648852733] [2022-04-15 07:27:47,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648852733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:27:47,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:27:47,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:27:47,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267077242] [2022-04-15 07:27:47,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:27:47,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-15 07:27:47,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:27:47,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:27:49,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:49,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:27:49,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:27:49,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:27:49,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:27:49,679 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:27:51,713 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-15 07:27:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:52,303 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2022-04-15 07:27:52,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:27:52,304 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 32 [2022-04-15 07:27:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:27:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:27:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 07:27:52,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:27:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-15 07:27:52,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-15 07:27:54,340 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:27:54,341 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:27:54,341 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 07:27:54,342 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:27:54,342 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:27:54,343 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 91 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 07:27:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 07:27:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2022-04-15 07:27:54,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:27:54,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:27:54,395 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:27:54,395 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:27:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:54,396 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 07:27:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 07:27:54,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:54,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:54,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-04-15 07:27:54,397 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 47 states. [2022-04-15 07:27:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:27:54,398 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 07:27:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 07:27:54,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:27:54,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:27:54,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:27:54,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:27:54,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 07:27:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 07:27:54,400 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 32 [2022-04-15 07:27:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:27:54,400 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 07:27:54,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-15 07:27:54,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 07:28:00,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 37 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 07:28:00,610 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 07:28:00,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 07:28:00,611 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:28:00,611 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:28:00,627 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-15 07:28:00,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:28:00,811 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:28:00,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:28:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1040303587, now seen corresponding path program 3 times [2022-04-15 07:28:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:28:00,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2056070984] [2022-04-15 07:28:04,875 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:28:04,875 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:28:04,875 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:28:04,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1040303587, now seen corresponding path program 4 times [2022-04-15 07:28:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:28:04,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022038962] [2022-04-15 07:28:04,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:28:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:28:04,889 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:28:04,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368873662] [2022-04-15 07:28:04,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:28:04,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:28:04,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:28:04,891 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-15 07:28:04,898 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-15 07:28:04,933 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:28:04,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:28:04,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 07:28:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:28:04,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:28:12,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {2174#true} call ULTIMATE.init(); {2174#true} is VALID [2022-04-15 07:28:12,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {2174#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(13, 2);call #Ultimate.allocInit(12, 3); {2174#true} is VALID [2022-04-15 07:28:12,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {2174#true} assume true; {2174#true} is VALID [2022-04-15 07:28:12,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2174#true} {2174#true} #64#return; {2174#true} is VALID [2022-04-15 07:28:12,518 INFO L272 TraceCheckUtils]: 4: Hoare triple {2174#true} call #t~ret6 := main(); {2174#true} is VALID [2022-04-15 07:28:12,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {2174#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2174#true} is VALID [2022-04-15 07:28:12,519 INFO L272 TraceCheckUtils]: 6: Hoare triple {2174#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2174#true} is VALID [2022-04-15 07:28:12,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {2174#true} ~cond := #in~cond; {2200#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:28:12,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {2200#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2204#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:28:12,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2204#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:28:12,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2204#(not (= |assume_abort_if_not_#in~cond| 0))} {2174#true} #58#return; {2211#(<= 1 main_~b~0)} is VALID [2022-04-15 07:28:12,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {2211#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:28:12,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:28:12,526 INFO L272 TraceCheckUtils]: 13: Hoare triple {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2174#true} is VALID [2022-04-15 07:28:12,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {2174#true} ~cond := #in~cond; {2225#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:28:12,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {2225#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:28:12,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:28:12,531 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:28:12,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:28:12,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {2215#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2242#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:28:12,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {2242#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,536 INFO L272 TraceCheckUtils]: 22: Hoare triple {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2174#true} is VALID [2022-04-15 07:28:12,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {2174#true} ~cond := #in~cond; {2174#true} is VALID [2022-04-15 07:28:12,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {2174#true} assume !(0 == ~cond); {2174#true} is VALID [2022-04-15 07:28:12,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {2174#true} assume true; {2174#true} is VALID [2022-04-15 07:28:12,539 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2174#true} {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #60#return; {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {2246#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2271#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,541 INFO L290 TraceCheckUtils]: 29: Hoare triple {2271#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2275#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {2275#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {2275#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:28:12,557 INFO L272 TraceCheckUtils]: 31: Hoare triple {2275#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:28:12,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {2282#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2286#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:28:12,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {2286#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2175#false} is VALID [2022-04-15 07:28:12,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {2175#false} assume !false; {2175#false} is VALID [2022-04-15 07:28:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:28:12,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:29:00,789 INFO L290 TraceCheckUtils]: 34: Hoare triple {2175#false} assume !false; {2175#false} is VALID [2022-04-15 07:29:00,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {2286#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2175#false} is VALID [2022-04-15 07:29:00,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {2282#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2286#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:29:00,791 INFO L272 TraceCheckUtils]: 31: Hoare triple {2302#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2282#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:29:00,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {2302#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2302#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:29:00,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {2309#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2302#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:29:00,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2309#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:29:00,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:29:00,798 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2174#true} {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #60#return; {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:29:00,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {2174#true} assume true; {2174#true} is VALID [2022-04-15 07:29:00,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {2174#true} assume !(0 == ~cond); {2174#true} is VALID [2022-04-15 07:29:00,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {2174#true} ~cond := #in~cond; {2174#true} is VALID [2022-04-15 07:29:00,799 INFO L272 TraceCheckUtils]: 22: Hoare triple {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2174#true} is VALID [2022-04-15 07:29:00,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:29:00,810 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2313#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:29:00,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {2342#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2338#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} is VALID [2022-04-15 07:29:00,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {2342#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !!(0 != ~y~0); {2342#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-15 07:29:00,823 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} {2349#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} #60#return; {2342#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-15 07:29:00,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:00,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {2359#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:00,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {2174#true} ~cond := #in~cond; {2359#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:29:00,825 INFO L272 TraceCheckUtils]: 13: Hoare triple {2349#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2174#true} is VALID [2022-04-15 07:29:00,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {2349#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} assume !false; {2349#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} is VALID [2022-04-15 07:29:00,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {2369#(or (forall ((main_~a~0 Int)) (= (* (* main_~a~0 (div (+ (div main_~b~0 2) 1) 2)) 4) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2349#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) main_~z~0)))} is VALID [2022-04-15 07:29:00,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2204#(not (= |assume_abort_if_not_#in~cond| 0))} {2174#true} #58#return; {2369#(or (forall ((main_~a~0 Int)) (= (* (* main_~a~0 (div (+ (div main_~b~0 2) 1) 2)) 4) (* main_~b~0 main_~a~0))) (<= 0 main_~b~0))} is VALID [2022-04-15 07:29:00,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {2204#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2204#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:29:00,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {2382#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2204#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:29:00,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {2174#true} ~cond := #in~cond; {2382#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 07:29:00,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {2174#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2174#true} is VALID [2022-04-15 07:29:00,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {2174#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2174#true} is VALID [2022-04-15 07:29:00,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {2174#true} call #t~ret6 := main(); {2174#true} is VALID [2022-04-15 07:29:00,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2174#true} {2174#true} #64#return; {2174#true} is VALID [2022-04-15 07:29:00,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {2174#true} assume true; {2174#true} is VALID [2022-04-15 07:29:00,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {2174#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(13, 2);call #Ultimate.allocInit(12, 3); {2174#true} is VALID [2022-04-15 07:29:00,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {2174#true} call ULTIMATE.init(); {2174#true} is VALID [2022-04-15 07:29:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:29:00,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:29:00,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022038962] [2022-04-15 07:29:00,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:29:00,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368873662] [2022-04-15 07:29:00,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368873662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:29:00,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:29:00,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 23 [2022-04-15 07:29:00,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:29:00,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2056070984] [2022-04-15 07:29:00,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2056070984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:29:00,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:29:00,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:29:00,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630255237] [2022-04-15 07:29:00,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:29:00,831 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:29:00,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:29:00,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:29:00,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:29:00,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:29:00,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:29:00,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:29:00,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:29:00,860 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:29:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:29:01,827 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-04-15 07:29:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:29:01,828 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:29:01,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:29:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:29:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-15 07:29:01,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:29:01,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 50 transitions. [2022-04-15 07:29:01,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 50 transitions. [2022-04-15 07:29:01,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:29:01,893 INFO L225 Difference]: With dead ends: 59 [2022-04-15 07:29:01,893 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 07:29:01,894 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:29:01,894 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:29:01,894 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 123 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:29:01,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 07:29:01,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2022-04-15 07:29:01,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:29:01,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:29:01,937 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:29:01,938 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:29:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:29:01,939 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 07:29:01,939 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 07:29:01,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:29:01,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:29:01,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 07:29:01,939 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 57 states. [2022-04-15 07:29:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:29:01,940 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-15 07:29:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-15 07:29:01,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:29:01,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:29:01,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:29:01,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:29:01,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:29:01,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 07:29:01,942 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 35 [2022-04-15 07:29:01,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:29:01,942 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 07:29:01,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:29:01,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 07:29:11,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 46 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 07:29:11,093 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 07:29:11,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 07:29:11,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:29:11,093 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:29:11,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 07:29:11,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:29:11,294 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:29:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:29:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash -734703775, now seen corresponding path program 1 times [2022-04-15 07:29:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:29:11,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1727303689] [2022-04-15 07:29:18,652 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:29:18,652 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:29:18,652 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:29:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash -734703775, now seen corresponding path program 2 times [2022-04-15 07:29:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:29:18,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432387578] [2022-04-15 07:29:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:29:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:29:18,672 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:29:18,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [126133426] [2022-04-15 07:29:18,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:29:18,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:29:18,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:29:18,673 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-15 07:29:18,674 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-15 07:29:18,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:29:18,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:29:18,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 07:29:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:29:18,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:29:36,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {2738#true} call ULTIMATE.init(); {2738#true} is VALID [2022-04-15 07:29:36,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {2738#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(13, 2);call #Ultimate.allocInit(12, 3); {2738#true} is VALID [2022-04-15 07:29:36,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-15 07:29:36,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2738#true} {2738#true} #64#return; {2738#true} is VALID [2022-04-15 07:29:36,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {2738#true} call #t~ret6 := main(); {2738#true} is VALID [2022-04-15 07:29:36,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {2738#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2738#true} is VALID [2022-04-15 07:29:36,884 INFO L272 TraceCheckUtils]: 6: Hoare triple {2738#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2738#true} is VALID [2022-04-15 07:29:36,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {2738#true} ~cond := #in~cond; {2764#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:29:36,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {2764#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2768#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:29:36,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2768#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:29:36,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2768#(not (= |assume_abort_if_not_#in~cond| 0))} {2738#true} #58#return; {2775#(<= 1 main_~b~0)} is VALID [2022-04-15 07:29:36,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {2775#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:29:36,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:29:36,886 INFO L272 TraceCheckUtils]: 13: Hoare triple {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2738#true} is VALID [2022-04-15 07:29:36,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {2738#true} ~cond := #in~cond; {2789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:29:36,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {2789#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:36,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:29:36,887 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #60#return; {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:29:36,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:29:36,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {2779#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2806#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:29:36,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {2806#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:29:36,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:29:36,890 INFO L272 TraceCheckUtils]: 22: Hoare triple {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2738#true} is VALID [2022-04-15 07:29:36,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-15 07:29:36,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-15 07:29:36,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-15 07:29:36,890 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2738#true} {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #60#return; {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:29:36,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:29:36,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {2810#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2835#(and (= main_~z~0 main_~x~0) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-15 07:29:36,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {2835#(and (= main_~z~0 main_~x~0) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2839#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-15 07:29:36,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {2839#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} assume !false; {2839#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-15 07:29:37,095 INFO L272 TraceCheckUtils]: 31: Hoare triple {2839#(and (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~a~0 2) main_~z~0) (not (= (mod main_~b~0 2) 1)) (= main_~x~0 (* main_~z~0 2)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:29:37,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {2846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:29:37,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {2850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2739#false} is VALID [2022-04-15 07:29:37,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {2739#false} assume !false; {2739#false} is VALID [2022-04-15 07:29:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:29:37,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:32:14,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {2739#false} assume !false; {2739#false} is VALID [2022-04-15 07:32:14,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {2850#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2739#false} is VALID [2022-04-15 07:32:14,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {2846#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2850#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:14,757 INFO L272 TraceCheckUtils]: 31: Hoare triple {2866#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2846#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:32:14,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {2866#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2866#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:32:14,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {2873#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2866#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:32:14,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2873#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:32:14,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:32:14,766 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2738#true} {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} #60#return; {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:32:14,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-15 07:32:14,766 INFO L290 TraceCheckUtils]: 24: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-15 07:32:14,766 INFO L290 TraceCheckUtils]: 23: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-15 07:32:14,766 INFO L272 TraceCheckUtils]: 22: Hoare triple {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2738#true} is VALID [2022-04-15 07:32:14,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !false; {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:32:14,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {2902#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (< (div main_~y~0 2) 0) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2877#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:32:14,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {2906#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {2902#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (< (div main_~y~0 2) 0) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))} is VALID [2022-04-15 07:32:14,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {2906#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} assume !!(0 != ~y~0); {2906#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} is VALID [2022-04-15 07:32:15,327 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} {2738#true} #60#return; {2906#(or (forall ((aux_div_aux_mod_v_main_~y~0_61_22_75 Int)) (or (< (div main_~y~0 2) (+ 1 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75))) (= (* main_~b~0 main_~a~0) (+ (* main_~x~0 2) (* (* main_~x~0 aux_div_aux_mod_v_main_~y~0_61_22_75) 4) main_~z~0)) (<= (+ 3 (* 2 aux_div_aux_mod_v_main_~y~0_61_22_75)) (div main_~y~0 2)))) (= (mod main_~y~0 2) 1) (<= (div (* (- 1) (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)) (< (div main_~y~0 2) 0))} is VALID [2022-04-15 07:32:15,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:15,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {2922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2793#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {2738#true} ~cond := #in~cond; {2922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:32:15,329 INFO L272 TraceCheckUtils]: 13: Hoare triple {2738#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {2738#true} assume !false; {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {2738#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2738#true} {2738#true} #58#return; {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {2738#true} assume !(0 == ~cond); {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {2738#true} ~cond := #in~cond; {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L272 TraceCheckUtils]: 6: Hoare triple {2738#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2738#true} is VALID [2022-04-15 07:32:15,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {2738#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2738#true} is VALID [2022-04-15 07:32:15,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {2738#true} call #t~ret6 := main(); {2738#true} is VALID [2022-04-15 07:32:15,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2738#true} {2738#true} #64#return; {2738#true} is VALID [2022-04-15 07:32:15,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2738#true} assume true; {2738#true} is VALID [2022-04-15 07:32:15,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {2738#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(13, 2);call #Ultimate.allocInit(12, 3); {2738#true} is VALID [2022-04-15 07:32:15,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {2738#true} call ULTIMATE.init(); {2738#true} is VALID [2022-04-15 07:32:15,330 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 8 proven. 6 refuted. 2 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:32:15,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:32:15,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432387578] [2022-04-15 07:32:15,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:32:15,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126133426] [2022-04-15 07:32:15,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126133426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:32:15,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:32:15,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 20 [2022-04-15 07:32:15,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:32:15,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1727303689] [2022-04-15 07:32:15,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1727303689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:32:15,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:32:15,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:32:15,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708750135] [2022-04-15 07:32:15,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:32:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:32:15,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:32:15,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:32:15,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:32:15,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:32:15,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:32:15,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:32:15,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=309, Unknown=2, NotChecked=0, Total=380 [2022-04-15 07:32:15,519 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:32:18,118 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:32:21,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:32:21,174 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 07:32:21,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:32:21,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:32:21,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:32:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:32:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-15 07:32:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:32:21,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-15 07:32:21,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-15 07:32:21,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:32:21,602 INFO L225 Difference]: With dead ends: 60 [2022-04-15 07:32:21,602 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 07:32:21,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=86, Invalid=418, Unknown=2, NotChecked=0, Total=506 [2022-04-15 07:32:21,603 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:32:21,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 07:32:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 07:32:21,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 47. [2022-04-15 07:32:21,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:32:21,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:32:21,643 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:32:21,645 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:32:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:32:21,646 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 07:32:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 07:32:21,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:32:21,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:32:21,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 58 states. [2022-04-15 07:32:21,653 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 58 states. [2022-04-15 07:32:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:32:21,654 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 07:32:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 07:32:21,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:32:21,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:32:21,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:32:21,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:32:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:32:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 07:32:21,657 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 35 [2022-04-15 07:32:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:32:21,657 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 07:32:21,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:32:21,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 07:32:30,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 46 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 07:32:30,944 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 07:32:30,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 07:32:30,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:32:30,945 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:32:30,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 07:32:31,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:32:31,145 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:32:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:32:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2061371941, now seen corresponding path program 3 times [2022-04-15 07:32:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:32:31,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1264928550] [2022-04-15 07:32:37,104 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:32:37,104 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:32:37,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:32:37,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2061371941, now seen corresponding path program 4 times [2022-04-15 07:32:37,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:32:37,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717705383] [2022-04-15 07:32:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:32:37,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:32:37,112 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:32:37,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451480714] [2022-04-15 07:32:37,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:32:37,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:32:37,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:32:37,132 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-15 07:32:37,132 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-15 07:32:37,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:32:37,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:32:37,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 07:32:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:32:37,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:32:42,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {3303#true} call ULTIMATE.init(); {3303#true} is VALID [2022-04-15 07:32:42,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {3303#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(13, 2);call #Ultimate.allocInit(12, 3); {3303#true} is VALID [2022-04-15 07:32:42,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {3303#true} assume true; {3303#true} is VALID [2022-04-15 07:32:42,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3303#true} {3303#true} #64#return; {3303#true} is VALID [2022-04-15 07:32:42,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {3303#true} call #t~ret6 := main(); {3303#true} is VALID [2022-04-15 07:32:42,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {3303#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3303#true} is VALID [2022-04-15 07:32:42,673 INFO L272 TraceCheckUtils]: 6: Hoare triple {3303#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3303#true} is VALID [2022-04-15 07:32:42,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {3303#true} ~cond := #in~cond; {3303#true} is VALID [2022-04-15 07:32:42,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {3303#true} assume !(0 == ~cond); {3303#true} is VALID [2022-04-15 07:32:42,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {3303#true} assume true; {3303#true} is VALID [2022-04-15 07:32:42,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3303#true} {3303#true} #58#return; {3303#true} is VALID [2022-04-15 07:32:42,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:32:42,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:32:42,678 INFO L272 TraceCheckUtils]: 13: Hoare triple {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3303#true} is VALID [2022-04-15 07:32:42,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {3303#true} ~cond := #in~cond; {3303#true} is VALID [2022-04-15 07:32:42,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {3303#true} assume !(0 == ~cond); {3303#true} is VALID [2022-04-15 07:32:42,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {3303#true} assume true; {3303#true} is VALID [2022-04-15 07:32:42,678 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3303#true} {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #60#return; {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:32:42,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {3341#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3363#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:32:42,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {3363#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3367#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:32:42,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {3367#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:32:42,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:32:42,682 INFO L272 TraceCheckUtils]: 22: Hoare triple {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3303#true} is VALID [2022-04-15 07:32:42,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {3303#true} ~cond := #in~cond; {3381#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:42,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {3381#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:42,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:32:42,683 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #60#return; {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:32:42,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:32:42,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {3371#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3398#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:32:42,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {3398#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3402#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-15 07:32:42,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {3402#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} assume !false; {3402#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} is VALID [2022-04-15 07:32:44,692 WARN L272 TraceCheckUtils]: 31: Hoare triple {3402#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 4) main_~x~0) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3409#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-15 07:32:44,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {3409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:32:44,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {3413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3304#false} is VALID [2022-04-15 07:32:44,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {3304#false} assume !false; {3304#false} is VALID [2022-04-15 07:32:44,694 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:32:44,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:34:59,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {3304#false} assume !false; {3304#false} is VALID [2022-04-15 07:34:59,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {3413#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3304#false} is VALID [2022-04-15 07:34:59,138 INFO L290 TraceCheckUtils]: 32: Hoare triple {3409#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3413#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:34:59,138 INFO L272 TraceCheckUtils]: 31: Hoare triple {3429#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3409#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:34:59,138 INFO L290 TraceCheckUtils]: 30: Hoare triple {3429#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3429#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:34:59,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {3436#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3429#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:34:59,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {3440#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3436#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:34:59,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {3440#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3440#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:34:59,148 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} {3447#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} #60#return; {3440#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:34:59,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:34:59,148 INFO L290 TraceCheckUtils]: 24: Hoare triple {3457#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3385#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:34:59,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {3303#true} ~cond := #in~cond; {3457#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:34:59,149 INFO L272 TraceCheckUtils]: 22: Hoare triple {3447#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3303#true} is VALID [2022-04-15 07:34:59,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {3447#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} assume !false; {3447#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:34:59,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {3467#(forall ((aux_div_v_main_~y~0_79_22 Int)) (or (and (or (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_79_22 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (<= (+ (* aux_div_v_main_~y~0_79_22 2) 1) (div main_~y~0 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))) (or (<= (+ 2 (* aux_div_v_main_~y~0_79_22 2)) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_79_22 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* aux_div_v_main_~y~0_79_22 main_~x~0)) main_~z~0 (* main_~x~0 4)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3447#(or (<= 0 main_~y~0) (not (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:34:59,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {3303#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3467#(forall ((aux_div_v_main_~y~0_79_22 Int)) (or (and (or (< (+ (div main_~y~0 2) 1) (* aux_div_v_main_~y~0_79_22 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (<= 0 (+ (div main_~y~0 2) 1)) (<= (+ (* aux_div_v_main_~y~0_79_22 2) 1) (div main_~y~0 2)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))) (or (<= (+ 2 (* aux_div_v_main_~y~0_79_22 2)) (div main_~y~0 2)) (not (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0))) (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (< (div main_~y~0 2) (* aux_div_v_main_~y~0_79_22 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1)))) (= (* main_~b~0 main_~a~0) (+ (* 4 (* aux_div_v_main_~y~0_79_22 main_~x~0)) main_~z~0 (* main_~x~0 4)))))} is VALID [2022-04-15 07:34:59,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {3303#true} assume !!(0 != ~y~0); {3303#true} is VALID [2022-04-15 07:34:59,299 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3303#true} {3303#true} #60#return; {3303#true} is VALID [2022-04-15 07:34:59,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {3303#true} assume true; {3303#true} is VALID [2022-04-15 07:34:59,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {3303#true} assume !(0 == ~cond); {3303#true} is VALID [2022-04-15 07:34:59,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {3303#true} ~cond := #in~cond; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L272 TraceCheckUtils]: 13: Hoare triple {3303#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#true} assume !false; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3303#true} {3303#true} #58#return; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {3303#true} assume true; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {3303#true} assume !(0 == ~cond); {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 7: Hoare triple {3303#true} ~cond := #in~cond; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L272 TraceCheckUtils]: 6: Hoare triple {3303#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {3303#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L272 TraceCheckUtils]: 4: Hoare triple {3303#true} call #t~ret6 := main(); {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3303#true} {3303#true} #64#return; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {3303#true} assume true; {3303#true} is VALID [2022-04-15 07:34:59,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {3303#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(13, 2);call #Ultimate.allocInit(12, 3); {3303#true} is VALID [2022-04-15 07:34:59,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {3303#true} call ULTIMATE.init(); {3303#true} is VALID [2022-04-15 07:34:59,301 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:34:59,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:34:59,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717705383] [2022-04-15 07:34:59,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:34:59,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451480714] [2022-04-15 07:34:59,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451480714] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:34:59,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:34:59,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-15 07:34:59,302 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:34:59,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1264928550] [2022-04-15 07:34:59,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1264928550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:34:59,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:34:59,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:34:59,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584295298] [2022-04-15 07:34:59,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:34:59,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:34:59,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:34:59,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:34:59,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:34:59,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:34:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:34:59,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:34:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:34:59,598 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:35:04,699 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-15 07:35:06,706 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:35:11,789 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-15 07:35:18,688 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:35:25,345 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-15 07:35:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:25,570 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2022-04-15 07:35:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:35:25,570 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:35:25,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:35:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:35:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 07:35:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:35:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 53 transitions. [2022-04-15 07:35:25,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 53 transitions. [2022-04-15 07:35:26,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:26,653 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:35:26,653 INFO L226 Difference]: Without dead ends: 64 [2022-04-15 07:35:26,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:35:26,654 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:35:26,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 154 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 228 Invalid, 4 Unknown, 0 Unchecked, 14.6s Time] [2022-04-15 07:35:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-15 07:35:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2022-04-15 07:35:26,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:35:26,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:35:26,709 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:35:26,710 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:35:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:26,711 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-15 07:35:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-15 07:35:26,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:35:26,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:35:26,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-15 07:35:26,711 INFO L87 Difference]: Start difference. First operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 64 states. [2022-04-15 07:35:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:35:26,713 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-04-15 07:35:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-04-15 07:35:26,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:35:26,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:35:26,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:35:26,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:35:26,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:35:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-15 07:35:26,714 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 35 [2022-04-15 07:35:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:35:26,714 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-15 07:35:26,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:35:26,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-15 07:35:40,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 58 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 07:35:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 07:35:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 07:35:40,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:35:40,157 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:35:40,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 07:35:40,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 07:35:40,358 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:35:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:35:40,358 INFO L85 PathProgramCache]: Analyzing trace with hash 286364579, now seen corresponding path program 3 times [2022-04-15 07:35:40,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:35:40,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [899667866] [2022-04-15 07:35:43,561 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:35:43,561 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:35:43,561 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:35:43,562 INFO L85 PathProgramCache]: Analyzing trace with hash 286364579, now seen corresponding path program 4 times [2022-04-15 07:35:43,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:35:43,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130944370] [2022-04-15 07:35:43,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:35:43,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:35:43,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:35:43,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374866558] [2022-04-15 07:35:43,570 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 07:35:43,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:35:43,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:35:43,571 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:35:43,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 07:35:43,609 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 07:35:43,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:35:43,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 07:35:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:35:43,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:36:05,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {3912#true} call ULTIMATE.init(); {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {3912#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(13, 2);call #Ultimate.allocInit(12, 3); {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {3912#true} assume true; {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3912#true} {3912#true} #64#return; {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {3912#true} call #t~ret6 := main(); {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {3912#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L272 TraceCheckUtils]: 6: Hoare triple {3912#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {3912#true} ~cond := #in~cond; {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {3912#true} assume !(0 == ~cond); {3912#true} is VALID [2022-04-15 07:36:05,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {3912#true} assume true; {3912#true} is VALID [2022-04-15 07:36:05,098 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3912#true} {3912#true} #58#return; {3912#true} is VALID [2022-04-15 07:36:05,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {3912#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:36:05,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:36:05,105 INFO L272 TraceCheckUtils]: 13: Hoare triple {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3912#true} is VALID [2022-04-15 07:36:05,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {3912#true} ~cond := #in~cond; {3912#true} is VALID [2022-04-15 07:36:05,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {3912#true} assume !(0 == ~cond); {3912#true} is VALID [2022-04-15 07:36:05,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {3912#true} assume true; {3912#true} is VALID [2022-04-15 07:36:05,106 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3912#true} {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #60#return; {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:36:05,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {3950#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3972#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 07:36:05,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {3972#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3976#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 07:36:05,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {3976#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= main_~z~0 main_~x~0) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3980#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:36:05,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {3980#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3980#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:36:05,110 INFO L272 TraceCheckUtils]: 22: Hoare triple {3980#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3912#true} is VALID [2022-04-15 07:36:05,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {3912#true} ~cond := #in~cond; {3990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:05,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {3990#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:05,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:36:05,113 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} {3980#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #60#return; {4001#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:36:05,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {4001#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {4005#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-15 07:36:05,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {4005#(and (not (= main_~y~0 0)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4009#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-15 07:36:05,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {4009#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4013#(and (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (+ (- 1) (div (+ (- 1) main_~b~0) 2)) (* main_~a~0 2))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:36:05,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {4013#(and (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (+ (- 1) (div (+ (- 1) main_~b~0) 2)) (* main_~a~0 2))) (* main_~b~0 main_~a~0)))} assume !false; {4013#(and (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (+ (- 1) (div (+ (- 1) main_~b~0) 2)) (* main_~a~0 2))) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:36:05,436 INFO L272 TraceCheckUtils]: 31: Hoare triple {4013#(and (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)) (= (+ main_~z~0 (* (+ (- 1) (div (+ (- 1) main_~b~0) 2)) (* main_~a~0 2))) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:36:05,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:36:05,437 INFO L290 TraceCheckUtils]: 33: Hoare triple {4024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3913#false} is VALID [2022-04-15 07:36:05,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {3913#false} assume !false; {3913#false} is VALID [2022-04-15 07:36:05,438 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 07:36:05,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:37:20,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {3913#false} assume !false; {3913#false} is VALID [2022-04-15 07:37:20,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {4024#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3913#false} is VALID [2022-04-15 07:37:20,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4024#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:37:20,844 INFO L272 TraceCheckUtils]: 31: Hoare triple {4040#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4020#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:37:20,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {4040#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4040#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:37:20,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {4047#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4040#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:37:20,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {4051#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4047#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:37:20,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {4051#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {4051#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-15 07:37:22,855 WARN L284 TraceCheckUtils]: 26: Hoare quadruple {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} {3912#true} #60#return; {4051#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is UNKNOWN [2022-04-15 07:37:22,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:22,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {4067#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3994#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {3912#true} ~cond := #in~cond; {4067#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:37:22,857 INFO L272 TraceCheckUtils]: 22: Hoare triple {3912#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {3912#true} assume !false; {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {3912#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {3912#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {3912#true} assume !!(0 != ~y~0); {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3912#true} {3912#true} #60#return; {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {3912#true} assume true; {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {3912#true} assume !(0 == ~cond); {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {3912#true} ~cond := #in~cond; {3912#true} is VALID [2022-04-15 07:37:22,857 INFO L272 TraceCheckUtils]: 13: Hoare triple {3912#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {3912#true} assume !false; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {3912#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3912#true} {3912#true} #58#return; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {3912#true} assume true; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {3912#true} assume !(0 == ~cond); {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {3912#true} ~cond := #in~cond; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {3912#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {3912#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {3912#true} call #t~ret6 := main(); {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3912#true} {3912#true} #64#return; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {3912#true} assume true; {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {3912#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(13, 2);call #Ultimate.allocInit(12, 3); {3912#true} is VALID [2022-04-15 07:37:22,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {3912#true} call ULTIMATE.init(); {3912#true} is VALID [2022-04-15 07:37:22,859 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 07:37:22,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:37:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130944370] [2022-04-15 07:37:22,859 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:37:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374866558] [2022-04-15 07:37:22,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374866558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:37:22,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:37:22,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 18 [2022-04-15 07:37:22,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:37:22,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [899667866] [2022-04-15 07:37:22,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [899667866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:37:22,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:37:22,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:37:22,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955400546] [2022-04-15 07:37:22,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:37:22,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:37:22,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:37:22,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:37:23,289 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:23,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:37:23,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:37:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:37:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=245, Unknown=5, NotChecked=0, Total=306 [2022-04-15 07:37:23,290 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:37:40,021 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:37:44,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:37:54,477 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-15 07:37:54,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:54,575 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2022-04-15 07:37:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:37:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2022-04-15 07:37:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:37:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:37:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-15 07:37:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:37:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 52 transitions. [2022-04-15 07:37:54,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 52 transitions. [2022-04-15 07:37:56,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:37:56,640 INFO L225 Difference]: With dead ends: 75 [2022-04-15 07:37:56,640 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 07:37:56,640 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=76, Invalid=337, Unknown=7, NotChecked=0, Total=420 [2022-04-15 07:37:56,641 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:37:56,641 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 194 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 1 Unknown, 0 Unchecked, 10.7s Time] [2022-04-15 07:37:56,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 07:37:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 47. [2022-04-15 07:37:56,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:37:56,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:56,722 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:56,722 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:56,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:56,731 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-15 07:37:56,731 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-15 07:37:56,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:56,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:56,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 73 states. [2022-04-15 07:37:56,731 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 73 states. [2022-04-15 07:37:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:37:56,732 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-15 07:37:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-04-15 07:37:56,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:37:56,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:37:56,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:37:56,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:37:56,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 34 states have internal predecessors, (37), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 07:37:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 07:37:56,733 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 35 [2022-04-15 07:37:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:37:56,734 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 07:37:56,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 12 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 07:37:56,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 07:38:06,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 45 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 07:38:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 07:38:06,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:38:06,950 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:38:06,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 07:38:07,150 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 07:38:07,150 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:38:07,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:38:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1326136358, now seen corresponding path program 5 times [2022-04-15 07:38:07,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:07,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2032785459] [2022-04-15 07:38:10,733 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:38:10,733 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:38:10,733 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:38:10,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1326136358, now seen corresponding path program 6 times [2022-04-15 07:38:10,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:38:10,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586823111] [2022-04-15 07:38:10,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:38:10,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:38:10,741 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:38:10,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348346340] [2022-04-15 07:38:10,742 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:38:10,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:38:10,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:38:10,746 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:38:10,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 07:38:10,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 07:38:10,814 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:38:10,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 07:38:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:38:10,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:38:22,792 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:38:26,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-15 07:38:26,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#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(13, 2);call #Ultimate.allocInit(12, 3); {4535#true} is VALID [2022-04-15 07:38:26,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 07:38:26,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #64#return; {4535#true} is VALID [2022-04-15 07:38:26,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret6 := main(); {4535#true} is VALID [2022-04-15 07:38:26,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4535#true} is VALID [2022-04-15 07:38:26,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {4535#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:26,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {4535#true} ~cond := #in~cond; {4561#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 07:38:26,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {4561#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4565#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:26,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {4565#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4565#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:26,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4565#(not (= |assume_abort_if_not_#in~cond| 0))} {4535#true} #58#return; {4572#(<= 1 main_~b~0)} is VALID [2022-04-15 07:38:26,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {4572#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !false; {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,377 INFO L272 TraceCheckUtils]: 13: Hoare triple {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:26,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-15 07:38:26,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-15 07:38:26,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 07:38:26,377 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4535#true} {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} #60#return; {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {4576#(and (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4601#(and (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {4601#(and (not (= (mod main_~y~0 2) 1)) (<= main_~b~0 main_~y~0) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4605#(and (exists ((aux_div_v_main_~y~0_98_22 Int) (aux_mod_v_main_~y~0_98_22 Int)) (and (< aux_mod_v_main_~y~0_98_22 2) (not (= aux_mod_v_main_~y~0_98_22 1)) (<= main_~b~0 (+ (* aux_div_v_main_~y~0_98_22 2) aux_mod_v_main_~y~0_98_22)) (<= (div (+ (* aux_div_v_main_~y~0_98_22 2) aux_mod_v_main_~y~0_98_22) 2) main_~y~0) (<= 0 aux_mod_v_main_~y~0_98_22))) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {4605#(and (exists ((aux_div_v_main_~y~0_98_22 Int) (aux_mod_v_main_~y~0_98_22 Int)) (and (< aux_mod_v_main_~y~0_98_22 2) (not (= aux_mod_v_main_~y~0_98_22 1)) (<= main_~b~0 (+ (* aux_div_v_main_~y~0_98_22 2) aux_mod_v_main_~y~0_98_22)) (<= (div (+ (* aux_div_v_main_~y~0_98_22 2) aux_mod_v_main_~y~0_98_22) 2) main_~y~0) (<= 0 aux_mod_v_main_~y~0_98_22))) (<= 1 main_~b~0))} assume !false; {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,384 INFO L272 TraceCheckUtils]: 22: Hoare triple {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:26,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-15 07:38:26,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-15 07:38:26,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 07:38:26,384 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4535#true} {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} #60#return; {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {4609#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4631#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~y~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {4631#(and (< (div (* (- 1) main_~b~0) (- 2)) (+ main_~y~0 1)) (not (= (mod main_~y~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4635#(and (exists ((aux_mod_v_main_~y~0_99_22 Int) (aux_div_v_main_~y~0_99_22 Int)) (and (< (div (* (- 1) main_~b~0) (- 2)) (+ (* aux_div_v_main_~y~0_99_22 2) aux_mod_v_main_~y~0_99_22 1)) (not (= aux_mod_v_main_~y~0_99_22 1)) (< aux_mod_v_main_~y~0_99_22 2) (<= (div (+ (* aux_div_v_main_~y~0_99_22 2) aux_mod_v_main_~y~0_99_22) 2) main_~y~0) (<= 0 aux_mod_v_main_~y~0_99_22))) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {4635#(and (exists ((aux_mod_v_main_~y~0_99_22 Int) (aux_div_v_main_~y~0_99_22 Int)) (and (< (div (* (- 1) main_~b~0) (- 2)) (+ (* aux_div_v_main_~y~0_99_22 2) aux_mod_v_main_~y~0_99_22 1)) (not (= aux_mod_v_main_~y~0_99_22 1)) (< aux_mod_v_main_~y~0_99_22 2) (<= (div (+ (* aux_div_v_main_~y~0_99_22 2) aux_mod_v_main_~y~0_99_22) 2) main_~y~0) (<= 0 aux_mod_v_main_~y~0_99_22))) (<= 1 main_~b~0))} assume !false; {4639#(and (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,388 INFO L272 TraceCheckUtils]: 31: Hoare triple {4639#(and (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:26,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {4535#true} ~cond := #in~cond; {4646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:26,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {4646#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:26,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:26,390 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} {4639#(and (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} #60#return; {4657#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,390 INFO L290 TraceCheckUtils]: 36: Hoare triple {4657#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {4657#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:26,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {4657#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4664#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} is VALID [2022-04-15 07:38:28,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {4664#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4668#(and (exists ((aux_mod_v_main_~y~0_100_23 Int) (aux_div_v_main_~y~0_100_23 Int)) (and (< aux_mod_v_main_~y~0_100_23 2) (not (= aux_mod_v_main_~y~0_100_23 1)) (<= 0 aux_mod_v_main_~y~0_100_23) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ aux_mod_v_main_~y~0_100_23 (* 2 aux_div_v_main_~y~0_100_23) 1)) (= (div (+ aux_mod_v_main_~y~0_100_23 (* 2 aux_div_v_main_~y~0_100_23)) 2) main_~y~0) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_100_23 (* 2 aux_div_v_main_~y~0_100_23)))) (* main_~b~0 main_~a~0)))) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 07:38:28,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {4668#(and (exists ((aux_mod_v_main_~y~0_100_23 Int) (aux_div_v_main_~y~0_100_23 Int)) (and (< aux_mod_v_main_~y~0_100_23 2) (not (= aux_mod_v_main_~y~0_100_23 1)) (<= 0 aux_mod_v_main_~y~0_100_23) (< (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2)) (+ aux_mod_v_main_~y~0_100_23 (* 2 aux_div_v_main_~y~0_100_23) 1)) (= (div (+ aux_mod_v_main_~y~0_100_23 (* 2 aux_div_v_main_~y~0_100_23)) 2) main_~y~0) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_100_23 (* 2 aux_div_v_main_~y~0_100_23)))) (* main_~b~0 main_~a~0)))) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {4672#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-15 07:38:29,926 INFO L272 TraceCheckUtils]: 40: Hoare triple {4672#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< (div (* (- 1) (div (* (- 1) (div (* (- 1) main_~b~0) (- 2))) (- 2))) (- 2)) (+ main_~y~0 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:29,927 INFO L290 TraceCheckUtils]: 41: Hoare triple {4676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:29,927 INFO L290 TraceCheckUtils]: 42: Hoare triple {4680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4536#false} is VALID [2022-04-15 07:38:29,927 INFO L290 TraceCheckUtils]: 43: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-15 07:38:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:38:29,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:38:56,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {4536#false} assume !false; {4536#false} is VALID [2022-04-15 07:38:56,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {4680#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4536#false} is VALID [2022-04-15 07:38:56,581 INFO L290 TraceCheckUtils]: 41: Hoare triple {4676#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4680#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:38:56,581 INFO L272 TraceCheckUtils]: 40: Hoare triple {4696#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4676#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:38:56,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {4696#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4696#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:38:56,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {4703#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4696#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-15 07:38:56,587 INFO L290 TraceCheckUtils]: 37: Hoare triple {4707#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4703#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-15 07:38:56,588 INFO L290 TraceCheckUtils]: 36: Hoare triple {4707#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {4707#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:38:56,590 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} {4714#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #60#return; {4707#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-15 07:38:56,591 INFO L290 TraceCheckUtils]: 34: Hoare triple {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:56,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {4724#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4650#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:38:56,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {4535#true} ~cond := #in~cond; {4724#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:38:56,591 INFO L272 TraceCheckUtils]: 31: Hoare triple {4714#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:56,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {4714#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {4714#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-15 07:38:56,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4714#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-15 07:38:56,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-15 07:38:56,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !!(0 != ~y~0); {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-15 07:38:56,595 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {4535#true} {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} #60#return; {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-15 07:38:56,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 07:38:56,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-15 07:38:56,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-15 07:38:56,595 INFO L272 TraceCheckUtils]: 22: Hoare triple {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:56,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} assume !false; {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-15 07:38:56,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4734#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-15 07:38:56,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-15 07:38:56,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !!(0 != ~y~0); {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-15 07:38:56,599 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4535#true} {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} #60#return; {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-15 07:38:56,599 INFO L290 TraceCheckUtils]: 16: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 07:38:56,599 INFO L290 TraceCheckUtils]: 15: Hoare triple {4535#true} assume !(0 == ~cond); {4535#true} is VALID [2022-04-15 07:38:56,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {4535#true} ~cond := #in~cond; {4535#true} is VALID [2022-04-15 07:38:56,599 INFO L272 TraceCheckUtils]: 13: Hoare triple {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:56,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} assume !false; {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-15 07:38:56,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {4790#(<= 0 (+ 3 (div (+ (- 1) (div (+ (div (+ (- 11) main_~b~0) 2) (- 3)) 2)) 2)))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4762#(and (or (<= 0 (+ 2 (div (+ (- 1) (div (+ (div main_~y~0 2) (- 5)) 2)) 2))) (not (= (mod main_~y~0 2) 0))) (<= 0 (+ (div (+ (- 1) (div (+ (div main_~y~0 2) (- 4)) 2)) 2) 2)))} is VALID [2022-04-15 07:38:56,601 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4565#(not (= |assume_abort_if_not_#in~cond| 0))} {4535#true} #58#return; {4790#(<= 0 (+ 3 (div (+ (- 1) (div (+ (div (+ (- 11) main_~b~0) 2) (- 3)) 2)) 2)))} is VALID [2022-04-15 07:38:56,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {4565#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4565#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:56,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {4803#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4565#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 07:38:56,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {4535#true} ~cond := #in~cond; {4803#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 07:38:56,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {4535#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {4535#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {4535#true} call #t~ret6 := main(); {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4535#true} {4535#true} #64#return; {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {4535#true} assume true; {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {4535#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(13, 2);call #Ultimate.allocInit(12, 3); {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {4535#true} call ULTIMATE.init(); {4535#true} is VALID [2022-04-15 07:38:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 07:38:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:38:56,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586823111] [2022-04-15 07:38:56,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:38:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348346340] [2022-04-15 07:38:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348346340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:38:56,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:38:56,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15] total 29 [2022-04-15 07:38:56,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:38:56,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2032785459] [2022-04-15 07:38:56,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2032785459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:38:56,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:38:56,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 07:38:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794360592] [2022-04-15 07:38:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:38:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-04-15 07:38:56,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:38:56,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:38:57,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:38:57,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 07:38:57,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:38:57,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 07:38:57,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=655, Unknown=4, NotChecked=0, Total=812 [2022-04-15 07:38:57,610 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:39:05,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:39:16,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:39:20,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:39:22,840 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:39:27,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:39:37,413 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 07:39:40,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:40,392 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-04-15 07:39:40,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:39:40,393 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-04-15 07:39:40,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:39:40,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:39:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 07:39:40,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:39:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-15 07:39:40,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-15 07:39:46,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 07:39:46,692 INFO L225 Difference]: With dead ends: 77 [2022-04-15 07:39:46,692 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 07:39:46,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=289, Invalid=1188, Unknown=5, NotChecked=0, Total=1482 [2022-04-15 07:39:46,693 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:39:46,693 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 114 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 205 Invalid, 0 Unknown, 44 Unchecked, 16.5s Time] [2022-04-15 07:39:46,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 07:39:46,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2022-04-15 07:39:46,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:39:46,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:39:46,810 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:39:46,810 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:39:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:46,811 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-04-15 07:39:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-04-15 07:39:46,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:46,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:46,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 75 states. [2022-04-15 07:39:46,812 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 75 states. [2022-04-15 07:39:46,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:39:46,815 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-04-15 07:39:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2022-04-15 07:39:46,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:39:46,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:39:46,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:39:46,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:39:46,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 48 states have internal predecessors, (53), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 07:39:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-15 07:39:46,816 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 44 [2022-04-15 07:39:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:39:46,817 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-15 07:39:46,820 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 07:39:46,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-15 07:40:04,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 62 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-15 07:40:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-15 07:40:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 07:40:04,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:40:04,550 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:40:04,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 07:40:04,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 07:40:04,750 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:40:04,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:40:04,751 INFO L85 PathProgramCache]: Analyzing trace with hash -448871004, now seen corresponding path program 5 times [2022-04-15 07:40:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:40:04,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373885909] [2022-04-15 07:40:07,809 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:40:07,810 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 07:40:07,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 07:40:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash -448871004, now seen corresponding path program 6 times [2022-04-15 07:40:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:40:07,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050316113] [2022-04-15 07:40:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:40:07,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:40:07,818 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:40:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170274525] [2022-04-15 07:40:07,818 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 07:40:07,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:40:07,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:40:07,820 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:40:07,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 07:40:07,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 07:40:07,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:40:07,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 07:40:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:40:07,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:40:08,951 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 07:40:31,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {5285#true} call ULTIMATE.init(); {5285#true} is VALID [2022-04-15 07:40:31,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {5285#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(13, 2);call #Ultimate.allocInit(12, 3); {5285#true} is VALID [2022-04-15 07:40:31,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5285#true} {5285#true} #64#return; {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {5285#true} call #t~ret6 := main(); {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {5285#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {5285#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {5285#true} ~cond := #in~cond; {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {5285#true} assume !(0 == ~cond); {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5285#true} {5285#true} #58#return; {5285#true} is VALID [2022-04-15 07:40:31,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {5285#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {5323#(= main_~z~0 0)} assume !false; {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,241 INFO L272 TraceCheckUtils]: 13: Hoare triple {5323#(= main_~z~0 0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5285#true} is VALID [2022-04-15 07:40:31,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {5285#true} ~cond := #in~cond; {5285#true} is VALID [2022-04-15 07:40:31,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {5285#true} assume !(0 == ~cond); {5285#true} is VALID [2022-04-15 07:40:31,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-15 07:40:31,241 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5285#true} {5323#(= main_~z~0 0)} #60#return; {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {5323#(= main_~z~0 0)} assume !!(0 != ~y~0); {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {5323#(= main_~z~0 0)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {5323#(= main_~z~0 0)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {5323#(= main_~z~0 0)} assume !false; {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,243 INFO L272 TraceCheckUtils]: 22: Hoare triple {5323#(= main_~z~0 0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5285#true} is VALID [2022-04-15 07:40:31,243 INFO L290 TraceCheckUtils]: 23: Hoare triple {5285#true} ~cond := #in~cond; {5285#true} is VALID [2022-04-15 07:40:31,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {5285#true} assume !(0 == ~cond); {5285#true} is VALID [2022-04-15 07:40:31,243 INFO L290 TraceCheckUtils]: 25: Hoare triple {5285#true} assume true; {5285#true} is VALID [2022-04-15 07:40:31,243 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {5285#true} {5323#(= main_~z~0 0)} #60#return; {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {5323#(= main_~z~0 0)} assume !!(0 != ~y~0); {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {5323#(= main_~z~0 0)} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,244 INFO L290 TraceCheckUtils]: 29: Hoare triple {5323#(= main_~z~0 0)} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {5323#(= main_~z~0 0)} assume !false; {5323#(= main_~z~0 0)} is VALID [2022-04-15 07:40:31,245 INFO L272 TraceCheckUtils]: 31: Hoare triple {5323#(= main_~z~0 0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5285#true} is VALID [2022-04-15 07:40:31,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {5285#true} ~cond := #in~cond; {5387#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:31,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {5387#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:31,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {5391#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5391#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:40:31,246 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5391#(not (= |__VERIFIER_assert_#in~cond| 0))} {5323#(= main_~z~0 0)} #60#return; {5398#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:40:31,246 INFO L290 TraceCheckUtils]: 36: Hoare triple {5398#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} assume !!(0 != ~y~0); {5402#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:40:31,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {5402#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5406#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~z~0 main_~x~0) (<= 0 (+ main_~y~0 1)) (= (+ main_~x~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-15 07:40:31,257 INFO L290 TraceCheckUtils]: 38: Hoare triple {5406#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~z~0 main_~x~0) (<= 0 (+ main_~y~0 1)) (= (+ main_~x~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5410#(and (= main_~x~0 (* main_~z~0 2)) (exists ((aux_mod_v_main_~y~0_117_29 Int) (aux_div_v_main_~y~0_117_29 Int)) (and (< aux_mod_v_main_~y~0_117_29 2) (<= 1 aux_mod_v_main_~y~0_117_29) (<= 0 (+ (* 2 aux_div_v_main_~y~0_117_29) aux_mod_v_main_~y~0_117_29)) (= (div (+ (- 1) (* 2 aux_div_v_main_~y~0_117_29) aux_mod_v_main_~y~0_117_29) 2) main_~y~0) (= (+ (* (* main_~z~0 aux_div_v_main_~y~0_117_29) 2) (* main_~z~0 aux_mod_v_main_~y~0_117_29)) (* main_~b~0 main_~a~0)))))} is VALID [2022-04-15 07:40:31,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {5410#(and (= main_~x~0 (* main_~z~0 2)) (exists ((aux_mod_v_main_~y~0_117_29 Int) (aux_div_v_main_~y~0_117_29 Int)) (and (< aux_mod_v_main_~y~0_117_29 2) (<= 1 aux_mod_v_main_~y~0_117_29) (<= 0 (+ (* 2 aux_div_v_main_~y~0_117_29) aux_mod_v_main_~y~0_117_29)) (= (div (+ (- 1) (* 2 aux_div_v_main_~y~0_117_29) aux_mod_v_main_~y~0_117_29) 2) main_~y~0) (= (+ (* (* main_~z~0 aux_div_v_main_~y~0_117_29) 2) (* main_~z~0 aux_mod_v_main_~y~0_117_29)) (* main_~b~0 main_~a~0)))))} assume !false; {5414#(and (= (+ main_~z~0 (* 2 (* main_~z~0 main_~y~0))) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-15 07:40:31,504 INFO L272 TraceCheckUtils]: 40: Hoare triple {5414#(and (= (+ main_~z~0 (* 2 (* main_~z~0 main_~y~0))) (* main_~b~0 main_~a~0)) (= main_~x~0 (* main_~z~0 2)) (< 0 (+ main_~y~0 1)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5418#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:40:31,504 INFO L290 TraceCheckUtils]: 41: Hoare triple {5418#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5422#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:40:31,504 INFO L290 TraceCheckUtils]: 42: Hoare triple {5422#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5286#false} is VALID [2022-04-15 07:40:31,504 INFO L290 TraceCheckUtils]: 43: Hoare triple {5286#false} assume !false; {5286#false} is VALID [2022-04-15 07:40:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 07:40:31,505 INFO L328 TraceCheckSpWp]: Computing backward predicates...