/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/loops-crafted-1/in-de32.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:36:45,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:36:45,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:36:45,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:36:45,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:36:45,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:36:45,530 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:36:45,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:36:45,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:36:45,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:36:45,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:36:45,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:36:45,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:36:45,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:36:45,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:36:45,548 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:36:45,548 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:36:45,549 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:36:45,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:36:45,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:36:45,557 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:36:45,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:36:45,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:36:45,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:36:45,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:36:45,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:36:45,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:36:45,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:36:45,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:36:45,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:36:45,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:36:45,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:36:45,570 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:36:45,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:36:45,571 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:36:45,572 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:36:45,572 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:36:45,572 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:36:45,573 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:36:45,573 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:36:45,573 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:36:45,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:36:45,575 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 06:36:45,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:36:45,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:36:45,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:36:45,584 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:36:45,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:36:45,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:36:45,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:36:45,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:36:45,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:36:45,585 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:36:45,585 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:36:45,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:36:45,585 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:36:45,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:36:45,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:36:45,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:36:45,586 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:36:45,587 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:36:45,587 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 06:36:45,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:36:45,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:36:45,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:36:45,801 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:36:45,802 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:36:45,802 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-15 06:36:45,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e3417a3/1d18515e50e14b80a1f1aa081cde5a9c/FLAGf4334b8c8 [2022-04-15 06:36:46,211 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:36:46,212 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c [2022-04-15 06:36:46,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e3417a3/1d18515e50e14b80a1f1aa081cde5a9c/FLAGf4334b8c8 [2022-04-15 06:36:46,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28e3417a3/1d18515e50e14b80a1f1aa081cde5a9c [2022-04-15 06:36:46,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:36:46,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:36:46,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:36:46,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:36:46,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:36:46,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5feacdc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46, skipping insertion in model container [2022-04-15 06:36:46,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:36:46,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:36:46,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-04-15 06:36:46,416 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:36:46,422 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:36:46,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de32.c[368,381] [2022-04-15 06:36:46,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:36:46,446 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:36:46,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46 WrapperNode [2022-04-15 06:36:46,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:36:46,447 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:36:46,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:36:46,448 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:36:46,455 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,461 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:36:46,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:36:46,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:36:46,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:36:46,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (1/1) ... [2022-04-15 06:36:46,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:36:46,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:46,513 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 06:36:46,519 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 06:36:46,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:36:46,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:36:46,550 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:36:46,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:36:46,550 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:36:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:36:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:36:46,550 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:36:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:36:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:36:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:36:46,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:36:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:36:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:36:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:36:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:36:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:36:46,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:36:46,598 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:36:46,599 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:36:46,729 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:36:46,733 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:36:46,734 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 06:36:46,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:36:46 BoogieIcfgContainer [2022-04-15 06:36:46,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:36:46,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:36:46,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:36:46,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:36:46,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:36:46" (1/3) ... [2022-04-15 06:36:46,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c795eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:36:46, skipping insertion in model container [2022-04-15 06:36:46,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:36:46" (2/3) ... [2022-04-15 06:36:46,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c795eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:36:46, skipping insertion in model container [2022-04-15 06:36:46,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:36:46" (3/3) ... [2022-04-15 06:36:46,755 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de32.c [2022-04-15 06:36:46,758 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:36:46,758 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:36:46,816 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:36:46,820 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 06:36:46,820 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:36:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:36:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:36:46,851 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:46,851 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:46,851 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:46,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-15 06:36:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:46,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851440739] [2022-04-15 06:36:46,867 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:36:46,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-15 06:36:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:46,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105382708] [2022-04-15 06:36:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:46,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:47,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:47,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 06:36:47,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:36:47,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 06:36:47,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:47,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-15 06:36:47,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 06:36:47,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-15 06:36:47,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-15 06:36:47,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25#true} is VALID [2022-04-15 06:36:47,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !(~x~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:36:47,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:36:47,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:36:47,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:36:47,146 INFO L272 TraceCheckUtils]: 10: Hoare triple {30#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:47,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:47,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-15 06:36:47,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 06:36:47,147 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 06:36:47,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:47,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105382708] [2022-04-15 06:36:47,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105382708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:47,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:47,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:36:47,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:47,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1851440739] [2022-04-15 06:36:47,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1851440739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:47,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:47,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:36:47,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968598450] [2022-04-15 06:36:47,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:47,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:36:47,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:47,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:47,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:36:47,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:36:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:36:47,190 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:47,449 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-04-15 06:36:47,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:36:47,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 06:36:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 06:36:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 06:36:47,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-15 06:36:47,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:47,530 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:36:47,530 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:36:47,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:36:47,534 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 30 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:47,535 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:36:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:36:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:36:47,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:47,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,554 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,555 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:47,557 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 06:36:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 06:36:47,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:47,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:47,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:36:47,558 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:36:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:47,559 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-15 06:36:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 06:36:47,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:47,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:47,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:47,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-15 06:36:47,562 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 14 [2022-04-15 06:36:47,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:47,562 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-15 06:36:47,563 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-15 06:36:47,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-15 06:36:47,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:36:47,580 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:47,580 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:47,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:36:47,581 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:47,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 1 times [2022-04-15 06:36:47,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:47,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1819432403] [2022-04-15 06:36:47,582 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:36:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash -222896448, now seen corresponding path program 2 times [2022-04-15 06:36:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:47,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302190428] [2022-04-15 06:36:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:47,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:47,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(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(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-15 06:36:47,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-15 06:36:47,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-15 06:36:47,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:47,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(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(10, 2);call #Ultimate.allocInit(12, 3); {206#true} is VALID [2022-04-15 06:36:47,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {206#true} assume true; {206#true} is VALID [2022-04-15 06:36:47,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206#true} {206#true} #61#return; {206#true} is VALID [2022-04-15 06:36:47,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {206#true} call #t~ret11 := main(); {206#true} is VALID [2022-04-15 06:36:47,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {206#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {211#(= main_~y~0 0)} is VALID [2022-04-15 06:36:47,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-15 06:36:47,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(= main_~y~0 0)} ~z~0 := ~y~0; {211#(= main_~y~0 0)} is VALID [2022-04-15 06:36:47,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {211#(= main_~y~0 0)} assume !(~z~0 % 4294967296 > 0); {211#(= main_~y~0 0)} is VALID [2022-04-15 06:36:47,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {207#false} is VALID [2022-04-15 06:36:47,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {207#false} assume !(~y~0 % 4294967296 > 0); {207#false} is VALID [2022-04-15 06:36:47,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {207#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {207#false} is VALID [2022-04-15 06:36:47,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2022-04-15 06:36:47,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2022-04-15 06:36:47,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {207#false} assume !false; {207#false} is VALID [2022-04-15 06:36:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:47,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:47,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302190428] [2022-04-15 06:36:47,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302190428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:47,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:47,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:36:47,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:47,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1819432403] [2022-04-15 06:36:47,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1819432403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:47,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:47,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:36:47,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25141612] [2022-04-15 06:36:47,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:47,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:36:47,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:47,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:47,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:36:47,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:47,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:36:47,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:36:47,642 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:47,692 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 06:36:47,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:36:47,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:36:47,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-15 06:36:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 31 transitions. [2022-04-15 06:36:47,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 31 transitions. [2022-04-15 06:36:47,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:47,721 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:36:47,721 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:36:47,722 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:36:47,723 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:47,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:36:47,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:36:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-15 06:36:47,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:47,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,729 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,729 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:47,730 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 06:36:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 06:36:47,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:47,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:47,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:36:47,731 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:36:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:47,733 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-15 06:36:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 06:36:47,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:47,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:47,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:47,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:47,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 06:36:47,734 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-15 06:36:47,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:47,735 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 06:36:47,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:47,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 06:36:47,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 06:36:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:36:47,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:47,759 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:47,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:36:47,759 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:47,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:47,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1179931951, now seen corresponding path program 1 times [2022-04-15 06:36:47,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:47,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [19525178] [2022-04-15 06:36:48,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:48,067 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash 115301550, now seen corresponding path program 1 times [2022-04-15 06:36:48,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:48,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051625353] [2022-04-15 06:36:48,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:48,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:48,098 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:48,158 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:48,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:48,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:48,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {378#(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(10, 2);call #Ultimate.allocInit(12, 3); {367#true} is VALID [2022-04-15 06:36:48,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-15 06:36:48,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-15 06:36:48,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:48,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {378#(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(10, 2);call #Ultimate.allocInit(12, 3); {367#true} is VALID [2022-04-15 06:36:48,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID [2022-04-15 06:36:48,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #61#return; {367#true} is VALID [2022-04-15 06:36:48,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret11 := main(); {367#true} is VALID [2022-04-15 06:36:48,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {372#(= main_~y~0 0)} is VALID [2022-04-15 06:36:48,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {373#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 06:36:48,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {373#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:36:48,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [65] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse2 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse3 (= v_main_~x~0_12 v_main_~x~0_11)) (.cse4 (mod v_main_~z~0_7 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ (* (- 1) v_main_~z~0_6) v_main_~x~0_12 v_main_~z~0_7) v_main_~x~0_11) (< v_main_~z~0_6 v_main_~z~0_7) (< 0 .cse4) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_6 v_it_1 1) v_main_~z~0_7)) (< 0 (mod (+ v_main_~z~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~x~0=v_main_~x~0_12, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_6, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:36:48,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [64] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_3 4294967296))) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[] {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:48,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:48,275 INFO L272 TraceCheckUtils]: 11: Hoare triple {375#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {376#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:48,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {377#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:48,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {368#false} is VALID [2022-04-15 06:36:48,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#false} assume !false; {368#false} is VALID [2022-04-15 06:36:48,281 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 06:36:48,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:48,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051625353] [2022-04-15 06:36:48,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051625353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:48,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:48,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:36:48,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:48,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [19525178] [2022-04-15 06:36:48,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [19525178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:48,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:48,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:36:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484416908] [2022-04-15 06:36:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:48,316 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:36:48,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:48,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:48,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:36:48,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:48,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:36:48,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:36:48,329 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:48,517 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:36:48,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:36:48,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 06:36:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 06:36:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 06:36:48,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 06:36:48,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:48,544 INFO L225 Difference]: With dead ends: 27 [2022-04-15 06:36:48,544 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:36:48,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:36:48,545 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:48,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 40 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:36:48,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:36:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:36:48,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:48,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,555 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,555 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:48,556 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 06:36:48,556 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 06:36:48,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:48,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:48,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:36:48,557 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:36:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:48,558 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-15 06:36:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 06:36:48,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:48,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:48,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:48,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-15 06:36:48,559 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-15 06:36:48,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:48,559 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-15 06:36:48,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:48,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-15 06:36:48,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:48,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-15 06:36:48,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:36:48,586 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:48,586 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:48,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:36:48,588 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:48,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:48,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-15 06:36:48,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:48,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243182177] [2022-04-15 06:36:48,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:48,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1046489728, now seen corresponding path program 1 times [2022-04-15 06:36:48,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:48,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103068337] [2022-04-15 06:36:48,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:48,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:48,850 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:48,890 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:49,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:49,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:49,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {524#(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(10, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-04-15 06:36:49,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume true; {515#true} is VALID [2022-04-15 06:36:49,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {515#true} {515#true} #61#return; {515#true} is VALID [2022-04-15 06:36:49,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:49,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {524#(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(10, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-04-15 06:36:49,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2022-04-15 06:36:49,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #61#return; {515#true} is VALID [2022-04-15 06:36:49,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret11 := main(); {515#true} is VALID [2022-04-15 06:36:49,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {520#(= main_~y~0 0)} is VALID [2022-04-15 06:36:49,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {520#(= main_~y~0 0)} [67] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_19 4294967296)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse3 (= v_main_~x~0_19 v_main_~x~0_18)) (.cse4 (= |v_main_#t~post5_4| |v_main_#t~post5_3|))) (or (and (< 0 .cse0) (= v_main_~y~0_8 (+ (* (- 1) v_main_~x~0_18) v_main_~x~0_19 v_main_~y~0_9)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_19 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_18 v_it_2 1) v_main_~x~0_19)))) (< v_main_~x~0_18 v_main_~x~0_19)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_19, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_18, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {521#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-15 06:36:49,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {521#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [66] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {522#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:36:49,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {522#(or (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {523#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} is VALID [2022-04-15 06:36:49,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {523#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (not (<= (+ (div main_~y~0 4294967296) 1) 0)) (<= main_~y~0 0)))} assume !(~z~0 % 4294967296 > 0); {520#(= main_~y~0 0)} is VALID [2022-04-15 06:36:49,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(= main_~y~0 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {516#false} is VALID [2022-04-15 06:36:49,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#false} assume !(~y~0 % 4294967296 > 0); {516#false} is VALID [2022-04-15 06:36:49,083 INFO L272 TraceCheckUtils]: 12: Hoare triple {516#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {516#false} is VALID [2022-04-15 06:36:49,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {516#false} ~cond := #in~cond; {516#false} is VALID [2022-04-15 06:36:49,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#false} assume 0 == ~cond; {516#false} is VALID [2022-04-15 06:36:49,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-04-15 06:36:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:49,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:49,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103068337] [2022-04-15 06:36:49,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103068337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:49,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:49,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:36:49,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:49,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243182177] [2022-04-15 06:36:49,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243182177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:49,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:49,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:49,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472164357] [2022-04-15 06:36:49,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:49,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:36:49,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:49,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:49,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:49,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:36:49,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:49,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:36:49,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:36:49,841 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:50,131 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 06:36:50,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:36:50,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:36:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-15 06:36:50,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2022-04-15 06:36:50,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2022-04-15 06:36:50,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:50,249 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:36:50,249 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:36:50,249 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:36:50,250 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:50,250 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 34 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-04-15 06:36:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:36:50,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:36:50,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:50,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,266 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,267 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:50,267 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:36:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:36:50,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:50,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:50,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:36:50,268 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:36:50,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:50,269 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:36:50,269 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:36:50,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:50,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:50,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:50,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:36:50,270 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2022-04-15 06:36:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:50,270 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:36:50,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:50,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:36:52,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:52,319 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:36:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:36:52,320 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:52,320 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:52,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:36:52,320 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:52,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:52,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1578117650, now seen corresponding path program 1 times [2022-04-15 06:36:52,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:52,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619275706] [2022-04-15 06:36:52,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:52,560 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:52,562 INFO L85 PathProgramCache]: Analyzing trace with hash 643370031, now seen corresponding path program 1 times [2022-04-15 06:36:52,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:52,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428057509] [2022-04-15 06:36:52,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:52,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:52,570 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:52,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:52,583 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:52,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {661#(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(10, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-15 06:36:52,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-15 06:36:52,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {651#true} {651#true} #61#return; {651#true} is VALID [2022-04-15 06:36:52,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {651#true} call ULTIMATE.init(); {661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:52,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {661#(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(10, 2);call #Ultimate.allocInit(12, 3); {651#true} is VALID [2022-04-15 06:36:52,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {651#true} assume true; {651#true} is VALID [2022-04-15 06:36:52,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {651#true} {651#true} #61#return; {651#true} is VALID [2022-04-15 06:36:52,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {651#true} call #t~ret11 := main(); {651#true} is VALID [2022-04-15 06:36:52,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {656#(= main_~y~0 0)} is VALID [2022-04-15 06:36:52,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {656#(= main_~y~0 0)} [69] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_27 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~y~0_17 v_main_~y~0_16)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~x~0_27 v_main_~x~0_26))) (or (and (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_27 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_17 v_it_3 1) v_main_~y~0_16)))) (< v_main_~y~0_17 v_main_~y~0_16) (= v_main_~x~0_26 (+ v_main_~x~0_27 v_main_~y~0_17 (* (- 1) v_main_~y~0_16)))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_17, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_27, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {657#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 06:36:52,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} [68] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {658#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:36:52,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {658#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {659#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:36:52,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:36:52,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:36:52,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {652#false} is VALID [2022-04-15 06:36:52,689 INFO L272 TraceCheckUtils]: 12: Hoare triple {652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {652#false} is VALID [2022-04-15 06:36:52,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#false} ~cond := #in~cond; {652#false} is VALID [2022-04-15 06:36:52,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#false} assume 0 == ~cond; {652#false} is VALID [2022-04-15 06:36:52,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {652#false} assume !false; {652#false} is VALID [2022-04-15 06:36:52,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:52,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:52,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428057509] [2022-04-15 06:36:52,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428057509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:52,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:52,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:52,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:52,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619275706] [2022-04-15 06:36:52,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619275706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:52,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:52,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:52,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539038438] [2022-04-15 06:36:52,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:52,938 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:36:52,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:52,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:53,116 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:36:53,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:53,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:36:53,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:36:53,117 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:53,253 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 06:36:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:36:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:36:53,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-15 06:36:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2022-04-15 06:36:53,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2022-04-15 06:36:53,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:53,599 INFO L225 Difference]: With dead ends: 23 [2022-04-15 06:36:53,599 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:36:53,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:36:53,600 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 15 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:53,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 30 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 15 Unchecked, 0.0s Time] [2022-04-15 06:36:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:36:53,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:36:53,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:53,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,620 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,620 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:53,621 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:36:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:36:53,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:53,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:53,621 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:36:53,621 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 06:36:53,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:53,622 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 06:36:53,622 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:36:53,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:53,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:53,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:53,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 06:36:53,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-15 06:36:53,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:53,623 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 06:36:53,623 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:53,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 06:36:55,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:55,727 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 06:36:55,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:36:55,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:55,727 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 06:36:55,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:36:55,728 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:55,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-15 06:36:55,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:55,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1411546349] [2022-04-15 06:36:55,964 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:55,966 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:55,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1187832866, now seen corresponding path program 1 times [2022-04-15 06:36:55,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:55,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119130677] [2022-04-15 06:36:55,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:55,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:55,988 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:36:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:55,998 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:36:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:56,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {799#(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(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-15 06:36:56,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 06:36:56,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-15 06:36:56,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:56,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#(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(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-15 06:36:56,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 06:36:56,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-15 06:36:56,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret11 := main(); {790#true} is VALID [2022-04-15 06:36:56,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {790#true} is VALID [2022-04-15 06:36:56,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse1 (mod v_main_~x~0_34 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_24 v_it_4 1) v_main_~y~0_23)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#true} is VALID [2022-04-15 06:36:56,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [70] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:36:56,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:36:56,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,056 INFO L272 TraceCheckUtils]: 13: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {797#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:36:56,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {798#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:36:56,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {791#false} is VALID [2022-04-15 06:36:56,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-15 06:36:56,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:56,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:56,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119130677] [2022-04-15 06:36:56,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119130677] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:36:56,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076530802] [2022-04-15 06:36:56,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:56,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:36:56,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:56,064 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 06:36:56,071 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 06:36:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:56,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:36:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:56,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:36:56,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-15 06:36:56,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-15 06:36:56,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 06:36:56,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-15 06:36:56,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret11 := main(); {790#true} is VALID [2022-04-15 06:36:56,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {790#true} is VALID [2022-04-15 06:36:56,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse1 (mod v_main_~x~0_34 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_24 v_it_4 1) v_main_~y~0_23)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#true} is VALID [2022-04-15 06:36:56,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [70] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:36:56,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:36:56,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,337 INFO L272 TraceCheckUtils]: 13: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:36:56,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:36:56,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-15 06:36:56,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-15 06:36:56,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:56,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:36:56,560 INFO L290 TraceCheckUtils]: 16: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-15 06:36:56,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-15 06:36:56,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:36:56,562 INFO L272 TraceCheckUtils]: 13: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:36:56,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:36:56,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {796#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:36:56,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} [70] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {795#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:36:56,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {790#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse1 (mod v_main_~x~0_34 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_24 (* (- 1) v_main_~y~0_23))) (< v_main_~y~0_24 v_main_~y~0_23) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_24 v_it_4 1) v_main_~y~0_23)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {790#true} is VALID [2022-04-15 06:36:56,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {790#true} is VALID [2022-04-15 06:36:56,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret11 := main(); {790#true} is VALID [2022-04-15 06:36:56,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-15 06:36:56,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 06:36:56,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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(10, 2);call #Ultimate.allocInit(12, 3); {790#true} is VALID [2022-04-15 06:36:56,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-15 06:36:56,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:36:56,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2076530802] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:36:56,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:36:56,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:36:56,596 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:56,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1411546349] [2022-04-15 06:36:56,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1411546349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:56,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:56,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:56,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843283288] [2022-04-15 06:36:56,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:56,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:36:56,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:56,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,610 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 06:36:56,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:36:56,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:56,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:36:56,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:36:56,611 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:56,802 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 06:36:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:36:56,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:36:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 06:36:56,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 06:36:56,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-15 06:36:56,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:56,831 INFO L225 Difference]: With dead ends: 28 [2022-04-15 06:36:56,831 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:36:56,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:36:56,832 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:56,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 30 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:36:56,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:36:56,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 06:36:56,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:56,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,855 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,855 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:56,856 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 06:36:56,856 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 06:36:56,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:56,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:56,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:36:56,857 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:36:56,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:56,858 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-15 06:36:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-15 06:36:56,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:56,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:56,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:56,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 06:36:56,859 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-15 06:36:56,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:56,859 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 06:36:56,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:56,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 06:36:58,496 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 06:36:58,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:36:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:36:58,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:36:58,497 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:36:58,513 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 06:36:58,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-15 06:36:58,698 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:36:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:36:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-04-15 06:36:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478093094] [2022-04-15 06:36:58,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:36:58,894 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:36:58,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1469355377, now seen corresponding path program 1 times [2022-04-15 06:36:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:36:58,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542118342] [2022-04-15 06:36:58,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:58,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:36:58,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:58,922 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:36:58,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:36:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:58,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {1065#(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(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-15 06:36:58,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-15 06:36:58,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-15 06:36:58,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1065#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:36:58,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {1065#(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(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-15 06:36:58,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-15 06:36:58,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-15 06:36:58,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret11 := main(); {1056#true} is VALID [2022-04-15 06:36:58,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1056#true} is VALID [2022-04-15 06:36:58,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_45 4294967296)) (.cse0 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse1 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse2 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_44 (+ v_main_~x~0_45 v_main_~y~0_32 (* (- 1) v_main_~y~0_31))) (< v_main_~y~0_32 v_main_~y~0_31) (< 0 .cse4) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (< 0 (mod (+ v_main_~x~0_45 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_32 v_it_5 1) v_main_~y~0_31))))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1056#true} is VALID [2022-04-15 06:36:58,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#true} [72] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-15 06:36:58,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#true} ~z~0 := ~y~0; {1061#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:36:58,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:36:58,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:36:58,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:36:58,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1057#false} is VALID [2022-04-15 06:36:58,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#false} assume !(~y~0 % 4294967296 > 0); {1057#false} is VALID [2022-04-15 06:36:58,980 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-15 06:36:58,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-15 06:36:58,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-15 06:36:58,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-15 06:36:58,981 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 06:36:58,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:36:58,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542118342] [2022-04-15 06:36:58,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542118342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:36:58,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407581261] [2022-04-15 06:36:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:36:58,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:36:58,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:36:58,982 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 06:36:59,005 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 06:36:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:59,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:36:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:36:59,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:36:59,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-15 06:36:59,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#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(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-15 06:36:59,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-15 06:36:59,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-15 06:36:59,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret11 := main(); {1056#true} is VALID [2022-04-15 06:36:59,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1056#true} is VALID [2022-04-15 06:36:59,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_45 4294967296)) (.cse0 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse1 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse2 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_44 (+ v_main_~x~0_45 v_main_~y~0_32 (* (- 1) v_main_~y~0_31))) (< v_main_~y~0_32 v_main_~y~0_31) (< 0 .cse4) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (< 0 (mod (+ v_main_~x~0_45 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_32 v_it_5 1) v_main_~y~0_31))))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1056#true} is VALID [2022-04-15 06:36:59,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#true} [72] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-15 06:36:59,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#true} ~z~0 := ~y~0; {1061#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:36:59,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:36:59,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:36:59,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:36:59,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1057#false} is VALID [2022-04-15 06:36:59,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#false} assume !(~y~0 % 4294967296 > 0); {1057#false} is VALID [2022-04-15 06:36:59,250 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-15 06:36:59,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-15 06:36:59,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-15 06:36:59,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-15 06:36:59,251 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 06:36:59,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:36:59,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-15 06:36:59,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-15 06:36:59,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-15 06:36:59,470 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-15 06:36:59,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#false} assume !(~y~0 % 4294967296 > 0); {1057#false} is VALID [2022-04-15 06:36:59,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1057#false} is VALID [2022-04-15 06:36:59,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1064#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:36:59,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {1141#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1063#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:36:59,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1141#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:36:59,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1056#true} ~z~0 := ~y~0; {1145#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:36:59,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1056#true} [72] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-15 06:36:59,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {1056#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_45 4294967296)) (.cse0 (= v_main_~x~0_45 v_main_~x~0_44)) (.cse1 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse2 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (= v_main_~x~0_44 (+ v_main_~x~0_45 v_main_~y~0_32 (* (- 1) v_main_~y~0_31))) (< v_main_~y~0_32 v_main_~y~0_31) (< 0 .cse4) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (< 0 (mod (+ v_main_~x~0_45 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_32 v_it_5 1) v_main_~y~0_31))))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_45, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1056#true} is VALID [2022-04-15 06:36:59,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1056#true} is VALID [2022-04-15 06:36:59,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} call #t~ret11 := main(); {1056#true} is VALID [2022-04-15 06:36:59,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} #61#return; {1056#true} is VALID [2022-04-15 06:36:59,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} assume true; {1056#true} is VALID [2022-04-15 06:36:59,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#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(10, 2);call #Ultimate.allocInit(12, 3); {1056#true} is VALID [2022-04-15 06:36:59,475 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-15 06:36:59,475 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 06:36:59,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407581261] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:36:59,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:36:59,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:36:59,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:36:59,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478093094] [2022-04-15 06:36:59,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478093094] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:36:59,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:36:59,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:36:59,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867603602] [2022-04-15 06:36:59,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:36:59,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:36:59,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:36:59,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:59,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:36:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:36:59,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:36:59,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:36:59,547 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:59,828 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-04-15 06:36:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:36:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:36:59,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:36:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-15 06:36:59,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 37 transitions. [2022-04-15 06:36:59,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 37 transitions. [2022-04-15 06:36:59,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:36:59,861 INFO L225 Difference]: With dead ends: 33 [2022-04-15 06:36:59,861 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:36:59,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:36:59,862 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:36:59,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 38 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:36:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:36:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:36:59,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:36:59,896 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,896 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,896 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:59,897 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:36:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:36:59,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:59,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:59,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:36:59,897 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 06:36:59,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:36:59,898 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-15 06:36:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:36:59,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:36:59,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:36:59,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:36:59,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:36:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 06:36:59,899 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2022-04-15 06:36:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:36:59,899 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 06:36:59,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:36:59,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 06:37:02,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:02,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 06:37:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:37:02,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:02,487 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:02,508 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 06:37:02,688 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,SelfDestructingSolverStorable6 [2022-04-15 06:37:02,688 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1137046944, now seen corresponding path program 3 times [2022-04-15 06:37:02,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:02,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [611534694] [2022-04-15 06:37:02,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:02,935 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash 27882048, now seen corresponding path program 1 times [2022-04-15 06:37:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:02,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847442418] [2022-04-15 06:37:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:02,961 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:02,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:02,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:03,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:03,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:03,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {1350#(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(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-15 06:37:03,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-15 06:37:03,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-15 06:37:03,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:03,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {1350#(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(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-15 06:37:03,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-15 06:37:03,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-15 06:37:03,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret11 := main(); {1341#true} is VALID [2022-04-15 06:37:03,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1341#true} is VALID [2022-04-15 06:37:03,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_56 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse3 (= v_main_~x~0_56 v_main_~x~0_55)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (= v_main_~x~0_55 (+ v_main_~x~0_56 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_43 v_it_6 1) v_main_~y~0_42)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_56 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_56, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_55, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1341#true} is VALID [2022-04-15 06:37:03,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} [74] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1341#true} is VALID [2022-04-15 06:37:03,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} ~z~0 := ~y~0; {1346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:37:03,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:37:03,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:03,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:03,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:03,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1342#false} is VALID [2022-04-15 06:37:03,057 INFO L272 TraceCheckUtils]: 14: Hoare triple {1342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1342#false} is VALID [2022-04-15 06:37:03,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {1342#false} ~cond := #in~cond; {1342#false} is VALID [2022-04-15 06:37:03,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {1342#false} assume 0 == ~cond; {1342#false} is VALID [2022-04-15 06:37:03,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-15 06:37:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847442418] [2022-04-15 06:37:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847442418] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434956625] [2022-04-15 06:37:03,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:03,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:03,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:03,059 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 06:37:03,060 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 06:37:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:03,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:37:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:03,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:03,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1341#true} is VALID [2022-04-15 06:37:03,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#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(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-15 06:37:03,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-15 06:37:03,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-15 06:37:03,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret11 := main(); {1341#true} is VALID [2022-04-15 06:37:03,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1341#true} is VALID [2022-04-15 06:37:03,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_56 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse3 (= v_main_~x~0_56 v_main_~x~0_55)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (= v_main_~x~0_55 (+ v_main_~x~0_56 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_43 v_it_6 1) v_main_~y~0_42)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_56 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_56, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_55, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1341#true} is VALID [2022-04-15 06:37:03,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} [74] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1341#true} is VALID [2022-04-15 06:37:03,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} ~z~0 := ~y~0; {1346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:37:03,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {1346#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:37:03,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {1347#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:03,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:03,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:03,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1342#false} is VALID [2022-04-15 06:37:03,446 INFO L272 TraceCheckUtils]: 14: Hoare triple {1342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1342#false} is VALID [2022-04-15 06:37:03,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {1342#false} ~cond := #in~cond; {1342#false} is VALID [2022-04-15 06:37:03,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1342#false} assume 0 == ~cond; {1342#false} is VALID [2022-04-15 06:37:03,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-15 06:37:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:03,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:03,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#false} assume !false; {1342#false} is VALID [2022-04-15 06:37:03,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {1342#false} assume 0 == ~cond; {1342#false} is VALID [2022-04-15 06:37:03,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {1342#false} ~cond := #in~cond; {1342#false} is VALID [2022-04-15 06:37:03,658 INFO L272 TraceCheckUtils]: 14: Hoare triple {1342#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1342#false} is VALID [2022-04-15 06:37:03,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1342#false} is VALID [2022-04-15 06:37:03,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1349#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:03,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:03,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {1426#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1348#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:03,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1426#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:37:03,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {1341#true} ~z~0 := ~y~0; {1430#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:03,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {1341#true} [74] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {1341#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_56 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42)) (.cse2 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse3 (= v_main_~x~0_56 v_main_~x~0_55)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (= v_main_~x~0_55 (+ v_main_~x~0_56 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_43 v_it_6 1) v_main_~y~0_42)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_56 (* v_it_6 4294967295)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_56, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_55, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {1341#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {1341#true} call #t~ret11 := main(); {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1341#true} {1341#true} #61#return; {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1341#true} assume true; {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1341#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(10, 2);call #Ultimate.allocInit(12, 3); {1341#true} is VALID [2022-04-15 06:37:03,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1341#true} call ULTIMATE.init(); {1341#true} is VALID [2022-04-15 06:37:03,672 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 06:37:03,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434956625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:03,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:03,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:37:03,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:03,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [611534694] [2022-04-15 06:37:03,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [611534694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:03,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:03,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:37:03,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912286267] [2022-04-15 06:37:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:03,750 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:37:03,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:03,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:03,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:03,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:37:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:37:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:37:03,765 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:04,089 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:37:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:37:04,090 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:37:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:04,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-15 06:37:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 28 transitions. [2022-04-15 06:37:04,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 28 transitions. [2022-04-15 06:37:04,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:04,127 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:37:04,127 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 06:37:04,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:37:04,128 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 15 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:04,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 46 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:37:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 06:37:04,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 06:37:04,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:04,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,158 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,159 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:04,159 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:37:04,159 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:37:04,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:04,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:04,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:37:04,160 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 06:37:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:04,160 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 06:37:04,160 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:37:04,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:04,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:04,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:04,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 06:37:04,161 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-04-15 06:37:04,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:04,162 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 06:37:04,162 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:04,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 06:37:06,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 06:37:06,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:37:06,257 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:06,257 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:06,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 06:37:06,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:06,458 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 4 times [2022-04-15 06:37:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:06,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [696022146] [2022-04-15 06:37:06,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:06,652 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 570197997, now seen corresponding path program 1 times [2022-04-15 06:37:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:06,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710132034] [2022-04-15 06:37:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:06,663 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:06,680 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:06,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:06,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1624#(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(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-15 06:37:06,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-15 06:37:06,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-15 06:37:06,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:06,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1624#(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(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-15 06:37:06,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-15 06:37:06,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-15 06:37:06,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {1614#true} call #t~ret11 := main(); {1614#true} is VALID [2022-04-15 06:37:06,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1614#true} is VALID [2022-04-15 06:37:06,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#true} [77] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_67 4294967296)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse2 (= v_main_~x~0_67 v_main_~x~0_66)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse1 0) .cse2 .cse3) (and (< 0 .cse1) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_67 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_7 1) v_main_~x~0_67)) (not (<= 1 v_it_7)))) (< v_main_~x~0_66 v_main_~x~0_67) (= (+ v_main_~x~0_67 v_main_~y~0_53 (* (- 1) v_main_~x~0_66)) v_main_~y~0_52)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1614#true} is VALID [2022-04-15 06:37:06,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#true} [76] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:06,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:06,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:06,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:06,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:06,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:06,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:06,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:06,744 INFO L272 TraceCheckUtils]: 15: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1622#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:37:06,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {1622#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1623#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:37:06,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {1623#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1615#false} is VALID [2022-04-15 06:37:06,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2022-04-15 06:37:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710132034] [2022-04-15 06:37:06,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710132034] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:06,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665777544] [2022-04-15 06:37:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:06,746 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 06:37:06,747 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 06:37:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:06,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:37:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:06,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:06,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1614#true} is VALID [2022-04-15 06:37:06,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#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(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-15 06:37:06,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-15 06:37:06,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-15 06:37:06,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {1614#true} call #t~ret11 := main(); {1614#true} is VALID [2022-04-15 06:37:06,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1614#true} is VALID [2022-04-15 06:37:06,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#true} [77] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_67 4294967296)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse2 (= v_main_~x~0_67 v_main_~x~0_66)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse1 0) .cse2 .cse3) (and (< 0 .cse1) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_67 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_7 1) v_main_~x~0_67)) (not (<= 1 v_it_7)))) (< v_main_~x~0_66 v_main_~x~0_67) (= (+ v_main_~x~0_67 v_main_~y~0_53 (* (- 1) v_main_~x~0_66)) v_main_~y~0_52)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1614#true} is VALID [2022-04-15 06:37:06,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#true} [76] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:06,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:06,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:07,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:07,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:07,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:07,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:07,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:07,005 INFO L272 TraceCheckUtils]: 15: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:07,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:07,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1615#false} is VALID [2022-04-15 06:37:07,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2022-04-15 06:37:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:07,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:07,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {1615#false} assume !false; {1615#false} is VALID [2022-04-15 06:37:07,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1615#false} is VALID [2022-04-15 06:37:07,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1677#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:07,230 INFO L272 TraceCheckUtils]: 15: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1673#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:07,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:07,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:07,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:07,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:07,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1621#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:07,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1620#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:07,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:07,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {1614#true} [76] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1619#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:07,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {1614#true} [77] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_67 4294967296)) (.cse0 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse2 (= v_main_~x~0_67 v_main_~x~0_66)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse1 0) .cse2 .cse3) (and (< 0 .cse1) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_67 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_66 v_it_7 1) v_main_~x~0_67)) (not (<= 1 v_it_7)))) (< v_main_~x~0_66 v_main_~x~0_67) (= (+ v_main_~x~0_67 v_main_~y~0_53 (* (- 1) v_main_~x~0_66)) v_main_~y~0_52)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_67, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1614#true} is VALID [2022-04-15 06:37:07,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {1614#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1614#true} is VALID [2022-04-15 06:37:07,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {1614#true} call #t~ret11 := main(); {1614#true} is VALID [2022-04-15 06:37:07,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1614#true} {1614#true} #61#return; {1614#true} is VALID [2022-04-15 06:37:07,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {1614#true} assume true; {1614#true} is VALID [2022-04-15 06:37:07,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#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(10, 2);call #Ultimate.allocInit(12, 3); {1614#true} is VALID [2022-04-15 06:37:07,236 INFO L272 TraceCheckUtils]: 0: Hoare triple {1614#true} call ULTIMATE.init(); {1614#true} is VALID [2022-04-15 06:37:07,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:07,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665777544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:07,236 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:07,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 06:37:07,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:07,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [696022146] [2022-04-15 06:37:07,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [696022146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:07,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:07,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:37:07,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102324064] [2022-04-15 06:37:07,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:07,314 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:37:07,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:07,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:07,330 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:37:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:37:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:37:07,330 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:07,683 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 06:37:07,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:37:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:37:07,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 06:37:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 06:37:07,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 06:37:07,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:07,725 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:37:07,725 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:37:07,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:37:07,727 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:07,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 30 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:37:07,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:37:07,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2022-04-15 06:37:07,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:07,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,765 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,765 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:07,766 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 06:37:07,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 06:37:07,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:07,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:07,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:37:07,766 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:37:07,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:07,767 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 06:37:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 06:37:07,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:07,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:07,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:07,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-15 06:37:07,768 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-15 06:37:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:07,768 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-15 06:37:07,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 8 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:07,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-15 06:37:10,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-15 06:37:10,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:37:10,125 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:10,125 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:10,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 06:37:10,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:10,326 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:10,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -676577280, now seen corresponding path program 5 times [2022-04-15 06:37:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:10,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413917520] [2022-04-15 06:37:10,639 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:10,641 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1067159456, now seen corresponding path program 1 times [2022-04-15 06:37:10,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:10,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210657271] [2022-04-15 06:37:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:10,659 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:37:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:10,670 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:37:10,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:10,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {1939#(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(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-15 06:37:10,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-15 06:37:10,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-15 06:37:10,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {1928#true} call ULTIMATE.init(); {1939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:10,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#(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(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-15 06:37:10,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-15 06:37:10,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-15 06:37:10,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {1928#true} call #t~ret11 := main(); {1928#true} is VALID [2022-04-15 06:37:10,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1928#true} is VALID [2022-04-15 06:37:10,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {1928#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_83 4294967296)) (.cse1 (= v_main_~y~0_63 v_main_~y~0_62)) (.cse2 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse3 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse4 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_82 v_it_8 1) v_main_~x~0_83)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_83) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_82 v_main_~x~0_83) (= v_main_~y~0_62 (+ (* (- 1) v_main_~x~0_82) v_main_~x~0_83 v_main_~y~0_63)) (< 0 .cse0)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1928#true} is VALID [2022-04-15 06:37:10,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {1928#true} [78] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1928#true} is VALID [2022-04-15 06:37:10,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {1928#true} ~z~0 := ~y~0; {1933#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:37:10,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:37:10,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {1934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:10,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:10,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:10,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:10,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1929#false} is VALID [2022-04-15 06:37:10,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1929#false} assume !(~y~0 % 4294967296 > 0); {1929#false} is VALID [2022-04-15 06:37:10,767 INFO L272 TraceCheckUtils]: 16: Hoare triple {1929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1929#false} is VALID [2022-04-15 06:37:10,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#false} ~cond := #in~cond; {1929#false} is VALID [2022-04-15 06:37:10,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#false} assume 0 == ~cond; {1929#false} is VALID [2022-04-15 06:37:10,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#false} assume !false; {1929#false} is VALID [2022-04-15 06:37:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:10,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:10,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210657271] [2022-04-15 06:37:10,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210657271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:10,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740939593] [2022-04-15 06:37:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:10,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:10,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:10,768 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 06:37:10,769 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 06:37:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:10,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:37:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:10,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:11,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {1928#true} call ULTIMATE.init(); {1928#true} is VALID [2022-04-15 06:37:11,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1928#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(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-15 06:37:11,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-15 06:37:11,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-15 06:37:11,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {1928#true} call #t~ret11 := main(); {1928#true} is VALID [2022-04-15 06:37:11,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1928#true} is VALID [2022-04-15 06:37:11,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {1928#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_83 4294967296)) (.cse1 (= v_main_~y~0_63 v_main_~y~0_62)) (.cse2 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse3 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse4 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_82 v_it_8 1) v_main_~x~0_83)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_83) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_82 v_main_~x~0_83) (= v_main_~y~0_62 (+ (* (- 1) v_main_~x~0_82) v_main_~x~0_83 v_main_~y~0_63)) (< 0 .cse0)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1928#true} is VALID [2022-04-15 06:37:11,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1928#true} [78] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1928#true} is VALID [2022-04-15 06:37:11,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {1928#true} ~z~0 := ~y~0; {1933#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:37:11,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:37:11,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {1934#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:11,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {1935#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:11,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:11,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:11,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1929#false} is VALID [2022-04-15 06:37:11,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {1929#false} assume !(~y~0 % 4294967296 > 0); {1929#false} is VALID [2022-04-15 06:37:11,126 INFO L272 TraceCheckUtils]: 16: Hoare triple {1929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1929#false} is VALID [2022-04-15 06:37:11,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#false} ~cond := #in~cond; {1929#false} is VALID [2022-04-15 06:37:11,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#false} assume 0 == ~cond; {1929#false} is VALID [2022-04-15 06:37:11,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#false} assume !false; {1929#false} is VALID [2022-04-15 06:37:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:11,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:11,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {1929#false} assume !false; {1929#false} is VALID [2022-04-15 06:37:11,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {1929#false} assume 0 == ~cond; {1929#false} is VALID [2022-04-15 06:37:11,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {1929#false} ~cond := #in~cond; {1929#false} is VALID [2022-04-15 06:37:11,381 INFO L272 TraceCheckUtils]: 16: Hoare triple {1929#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1929#false} is VALID [2022-04-15 06:37:11,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {1929#false} assume !(~y~0 % 4294967296 > 0); {1929#false} is VALID [2022-04-15 06:37:11,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1929#false} is VALID [2022-04-15 06:37:11,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1938#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:11,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {1937#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:11,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {2024#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1936#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:11,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {2028#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2024#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:37:11,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {2032#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2028#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:37:11,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {1928#true} ~z~0 := ~y~0; {2032#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:37:11,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {1928#true} [78] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {1928#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_83 4294967296)) (.cse1 (= v_main_~y~0_63 v_main_~y~0_62)) (.cse2 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse3 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse4 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_82 v_it_8 1) v_main_~x~0_83)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_83) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_82 v_main_~x~0_83) (= v_main_~y~0_62 (+ (* (- 1) v_main_~x~0_82) v_main_~x~0_83 v_main_~y~0_63)) (< 0 .cse0)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {1928#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {1928#true} call #t~ret11 := main(); {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1928#true} {1928#true} #61#return; {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {1928#true} assume true; {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {1928#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(10, 2);call #Ultimate.allocInit(12, 3); {1928#true} is VALID [2022-04-15 06:37:11,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {1928#true} call ULTIMATE.init(); {1928#true} is VALID [2022-04-15 06:37:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:11,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740939593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:11,389 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:11,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 06:37:11,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:11,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413917520] [2022-04-15 06:37:11,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413917520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:11,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:11,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:37:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558656414] [2022-04-15 06:37:11,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:11,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:37:11,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:11,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:11,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:11,463 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:37:11,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:11,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:37:11,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:37:11,464 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:12,024 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-15 06:37:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:37:12,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 06:37:12,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-15 06:37:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-15 06:37:12,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 41 transitions. [2022-04-15 06:37:12,064 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 06:37:12,065 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:37:12,065 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:37:12,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:37:12,066 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:12,066 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 53 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:37:12,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:37:12,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:37:12,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:12,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,109 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,110 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:12,110 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 06:37:12,111 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 06:37:12,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:12,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:12,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:37:12,114 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:37:12,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:12,115 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 06:37:12,115 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 06:37:12,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:12,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:12,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:12,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 06:37:12,116 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-04-15 06:37:12,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:12,116 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 06:37:12,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:12,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 06:37:15,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:15,420 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 06:37:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:37:15,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:15,420 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:15,436 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 06:37:15,620 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 06:37:15,621 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:15,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:15,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1250397230, now seen corresponding path program 6 times [2022-04-15 06:37:15,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:15,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1945326077] [2022-04-15 06:37:15,881 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:15,882 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1128245071, now seen corresponding path program 1 times [2022-04-15 06:37:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:15,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024740511] [2022-04-15 06:37:15,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:15,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:15,892 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:15,903 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:15,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {2272#(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(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-15 06:37:15,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-15 06:37:15,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-15 06:37:15,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:15,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {2272#(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(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-15 06:37:15,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-15 06:37:15,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-15 06:37:15,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret11 := main(); {2261#true} is VALID [2022-04-15 06:37:15,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2261#true} is VALID [2022-04-15 06:37:15,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_97 v_main_~x~0_96)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_77 v_main_~y~0_76)) (.cse3 (mod v_main_~x~0_97 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|)) (and (< 0 .cse3) (< v_main_~y~0_77 v_main_~y~0_76) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_97 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_77 v_it_9 1) v_main_~y~0_76)))) (= v_main_~x~0_96 (+ v_main_~x~0_97 v_main_~y~0_77 (* (- 1) v_main_~y~0_76)))))) InVars {main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_97, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_96, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2261#true} is VALID [2022-04-15 06:37:15,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} [80] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2261#true} is VALID [2022-04-15 06:37:15,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} ~z~0 := ~y~0; {2266#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:37:15,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {2266#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2267#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:37:15,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {2267#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2268#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:15,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {2268#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:15,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:15,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:15,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:15,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2262#false} is VALID [2022-04-15 06:37:15,977 INFO L272 TraceCheckUtils]: 16: Hoare triple {2262#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2262#false} is VALID [2022-04-15 06:37:15,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {2262#false} ~cond := #in~cond; {2262#false} is VALID [2022-04-15 06:37:15,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {2262#false} assume 0 == ~cond; {2262#false} is VALID [2022-04-15 06:37:15,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-15 06:37:15,977 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:15,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024740511] [2022-04-15 06:37:15,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024740511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:15,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184770526] [2022-04-15 06:37:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:15,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:15,992 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 06:37:15,993 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 06:37:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:16,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:37:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:16,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:16,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2261#true} is VALID [2022-04-15 06:37:16,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#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(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-15 06:37:16,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-15 06:37:16,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-15 06:37:16,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret11 := main(); {2261#true} is VALID [2022-04-15 06:37:16,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2261#true} is VALID [2022-04-15 06:37:16,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_97 v_main_~x~0_96)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_77 v_main_~y~0_76)) (.cse3 (mod v_main_~x~0_97 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|)) (and (< 0 .cse3) (< v_main_~y~0_77 v_main_~y~0_76) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_97 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_77 v_it_9 1) v_main_~y~0_76)))) (= v_main_~x~0_96 (+ v_main_~x~0_97 v_main_~y~0_77 (* (- 1) v_main_~y~0_76)))))) InVars {main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_97, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_96, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2261#true} is VALID [2022-04-15 06:37:16,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} [80] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2261#true} is VALID [2022-04-15 06:37:16,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} ~z~0 := ~y~0; {2266#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:37:16,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {2266#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2267#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:37:16,355 INFO L290 TraceCheckUtils]: 10: Hoare triple {2267#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2268#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:16,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {2268#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:16,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:16,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:16,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:16,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2262#false} is VALID [2022-04-15 06:37:16,358 INFO L272 TraceCheckUtils]: 16: Hoare triple {2262#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2262#false} is VALID [2022-04-15 06:37:16,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {2262#false} ~cond := #in~cond; {2262#false} is VALID [2022-04-15 06:37:16,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {2262#false} assume 0 == ~cond; {2262#false} is VALID [2022-04-15 06:37:16,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-15 06:37:16,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:16,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:16,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {2262#false} assume !false; {2262#false} is VALID [2022-04-15 06:37:16,612 INFO L290 TraceCheckUtils]: 18: Hoare triple {2262#false} assume 0 == ~cond; {2262#false} is VALID [2022-04-15 06:37:16,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {2262#false} ~cond := #in~cond; {2262#false} is VALID [2022-04-15 06:37:16,612 INFO L272 TraceCheckUtils]: 16: Hoare triple {2262#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2262#false} is VALID [2022-04-15 06:37:16,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2262#false} is VALID [2022-04-15 06:37:16,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2271#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:16,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2270#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:16,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:16,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {2357#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2269#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:16,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {2361#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2357#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:37:16,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {2365#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2361#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-15 06:37:16,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {2261#true} ~z~0 := ~y~0; {2365#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:37:16,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {2261#true} [80] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {2261#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_97 v_main_~x~0_96)) (.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_77 v_main_~y~0_76)) (.cse3 (mod v_main_~x~0_97 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|)) (and (< 0 .cse3) (< v_main_~y~0_77 v_main_~y~0_76) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_97 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_77 v_it_9 1) v_main_~y~0_76)))) (= v_main_~x~0_96 (+ v_main_~x~0_97 v_main_~y~0_77 (* (- 1) v_main_~y~0_76)))))) InVars {main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_97, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_96, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {2261#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {2261#true} call #t~ret11 := main(); {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2261#true} {2261#true} #61#return; {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {2261#true} assume true; {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {2261#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(10, 2);call #Ultimate.allocInit(12, 3); {2261#true} is VALID [2022-04-15 06:37:16,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {2261#true} call ULTIMATE.init(); {2261#true} is VALID [2022-04-15 06:37:16,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:16,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184770526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:16,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:16,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 06:37:16,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:16,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1945326077] [2022-04-15 06:37:16,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1945326077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:16,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:16,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:37:16,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125170906] [2022-04-15 06:37:16,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:16,693 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:37:16,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:16,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:16,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:16,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:37:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:37:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:37:16,712 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:17,256 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 06:37:17,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:37:17,256 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 06:37:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-15 06:37:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-15 06:37:17,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 31 transitions. [2022-04-15 06:37:17,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:17,310 INFO L225 Difference]: With dead ends: 29 [2022-04-15 06:37:17,310 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 06:37:17,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=484, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:37:17,311 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:17,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 51 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:37:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 06:37:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 06:37:17,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:17,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,364 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,365 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:17,365 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:37:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:37:17,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:17,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:17,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 06:37:17,366 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 06:37:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:17,366 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 06:37:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:37:17,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:17,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:17,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:17,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 06:37:17,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2022-04-15 06:37:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:17,367 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 06:37:17,367 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:17,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 06:37:20,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:20,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 06:37:20,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:37:20,891 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:20,891 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:20,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 06:37:21,091 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:21,092 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:21,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:21,092 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 7 times [2022-04-15 06:37:21,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:21,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1766643665] [2022-04-15 06:37:25,313 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:37:25,396 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:25,397 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:25,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1640627010, now seen corresponding path program 1 times [2022-04-15 06:37:25,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:25,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361003515] [2022-04-15 06:37:25,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:25,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:25,406 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:25,416 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:25,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:25,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {2585#(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(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-15 06:37:25,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-15 06:37:25,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-15 06:37:25,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:25,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2585#(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(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-15 06:37:25,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-15 06:37:25,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-15 06:37:25,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret11 := main(); {2574#true} is VALID [2022-04-15 06:37:25,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2574#true} is VALID [2022-04-15 06:37:25,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} [83] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse0 (mod v_main_~x~0_111 4294967296)) (.cse2 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse3 (= v_main_~x~0_111 v_main_~x~0_110)) (.cse4 (= v_main_~y~0_90 v_main_~y~0_89))) (or (and (= v_main_~y~0_89 (+ v_main_~x~0_111 v_main_~y~0_90 (* v_main_~x~0_110 (- 1)))) (< 0 .cse0) (< v_main_~x~0_110 v_main_~x~0_111) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_110 v_it_10 1) v_main_~x~0_111)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_111 (* 4294967295 v_it_10)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_111, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2574#true} is VALID [2022-04-15 06:37:25,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} [82] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:25,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:25,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,504 INFO L272 TraceCheckUtils]: 17: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2583#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:37:25,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2584#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:37:25,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {2584#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2575#false} is VALID [2022-04-15 06:37:25,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-15 06:37:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:25,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:25,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361003515] [2022-04-15 06:37:25,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361003515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:25,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447361560] [2022-04-15 06:37:25,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:25,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:25,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:25,506 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 06:37:25,507 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 06:37:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:25,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:37:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:25,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:25,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2574#true} is VALID [2022-04-15 06:37:25,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#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(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-15 06:37:25,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-15 06:37:25,756 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-15 06:37:25,756 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret11 := main(); {2574#true} is VALID [2022-04-15 06:37:25,756 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2574#true} is VALID [2022-04-15 06:37:25,756 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} [83] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse0 (mod v_main_~x~0_111 4294967296)) (.cse2 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse3 (= v_main_~x~0_111 v_main_~x~0_110)) (.cse4 (= v_main_~y~0_90 v_main_~y~0_89))) (or (and (= v_main_~y~0_89 (+ v_main_~x~0_111 v_main_~y~0_90 (* v_main_~x~0_110 (- 1)))) (< 0 .cse0) (< v_main_~x~0_110 v_main_~x~0_111) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_110 v_it_10 1) v_main_~x~0_111)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_111 (* 4294967295 v_it_10)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_111, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2574#true} is VALID [2022-04-15 06:37:25,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} [82] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:25,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:25,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:25,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:25,763 INFO L272 TraceCheckUtils]: 17: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:25,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:25,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2575#false} is VALID [2022-04-15 06:37:25,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-15 06:37:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:25,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:26,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#false} assume !false; {2575#false} is VALID [2022-04-15 06:37:26,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {2644#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2575#false} is VALID [2022-04-15 06:37:26,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2644#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:26,016 INFO L272 TraceCheckUtils]: 17: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2640#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:26,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:26,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:26,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:26,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:26,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:26,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2582#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:26,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2581#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:26,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2580#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:26,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:26,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {2574#true} [82] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2579#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:26,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {2574#true} [83] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse0 (mod v_main_~x~0_111 4294967296)) (.cse2 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse3 (= v_main_~x~0_111 v_main_~x~0_110)) (.cse4 (= v_main_~y~0_90 v_main_~y~0_89))) (or (and (= v_main_~y~0_89 (+ v_main_~x~0_111 v_main_~y~0_90 (* v_main_~x~0_110 (- 1)))) (< 0 .cse0) (< v_main_~x~0_110 v_main_~x~0_111) (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_110 v_it_10 1) v_main_~x~0_111)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_111 (* 4294967295 v_it_10)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_111, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_110, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {2574#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {2574#true} call #t~ret11 := main(); {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2574#true} {2574#true} #61#return; {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {2574#true} assume true; {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {2574#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(10, 2);call #Ultimate.allocInit(12, 3); {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {2574#true} call ULTIMATE.init(); {2574#true} is VALID [2022-04-15 06:37:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:26,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447361560] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:26,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:26,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-15 06:37:26,142 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:26,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1766643665] [2022-04-15 06:37:26,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1766643665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:26,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:26,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:37:26,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609717853] [2022-04-15 06:37:26,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:37:26,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:26,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,167 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 06:37:26,167 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:37:26,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:37:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:37:26,168 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:26,737 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-04-15 06:37:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:37:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 06:37:26,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 06:37:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-15 06:37:26,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-15 06:37:26,795 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 06:37:26,796 INFO L225 Difference]: With dead ends: 40 [2022-04-15 06:37:26,796 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:37:26,796 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:37:26,797 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:26,797 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 40 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:37:26,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:37:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-15 06:37:26,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:26,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,851 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,851 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:26,851 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 06:37:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 06:37:26,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:26,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:26,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:37:26,852 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:37:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:26,853 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 06:37:26,853 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 06:37:26,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:26,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:26,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:26,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:26,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-04-15 06:37:26,854 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 23 [2022-04-15 06:37:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:26,854 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-04-15 06:37:26,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:26,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 29 transitions. [2022-04-15 06:37:30,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 28 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 06:37:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:37:30,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:30,568 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:30,587 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 06:37:30,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:30,790 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:30,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash 144737870, now seen corresponding path program 8 times [2022-04-15 06:37:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:30,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [75166108] [2022-04-15 06:37:30,952 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:30,953 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:30,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1586266705, now seen corresponding path program 1 times [2022-04-15 06:37:30,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:30,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138946280] [2022-04-15 06:37:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:30,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:30,962 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:30,984 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:31,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:31,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {2949#(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(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-15 06:37:31,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-15 06:37:31,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-15 06:37:31,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:31,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {2949#(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(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-15 06:37:31,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-15 06:37:31,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-15 06:37:31,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret11 := main(); {2936#true} is VALID [2022-04-15 06:37:31,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#true} is VALID [2022-04-15 06:37:31,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_132 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_132 (* 4294967295 v_it_11)) 4294967296)) (not (<= (+ v_main_~y~0_102 v_it_11 1) v_main_~y~0_101)))) (< v_main_~y~0_102 v_main_~y~0_101) (= v_main_~x~0_131 (+ v_main_~x~0_132 (* (- 1) v_main_~y~0_101) v_main_~y~0_102))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2936#true} is VALID [2022-04-15 06:37:31,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#true} [84] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2936#true} is VALID [2022-04-15 06:37:31,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#true} ~z~0 := ~y~0; {2941#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:37:31,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {2941#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2942#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:37:31,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {2942#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2943#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:31,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {2943#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:37:31,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:31,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:31,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:31,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:31,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2937#false} is VALID [2022-04-15 06:37:31,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#false} assume !(~y~0 % 4294967296 > 0); {2937#false} is VALID [2022-04-15 06:37:31,139 INFO L272 TraceCheckUtils]: 18: Hoare triple {2937#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2937#false} is VALID [2022-04-15 06:37:31,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2022-04-15 06:37:31,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2022-04-15 06:37:31,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2022-04-15 06:37:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:31,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:31,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138946280] [2022-04-15 06:37:31,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138946280] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:31,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042482342] [2022-04-15 06:37:31,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:31,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:31,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:31,144 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 06:37:31,145 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 06:37:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:31,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:37:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:31,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:31,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2022-04-15 06:37:31,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#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(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-15 06:37:31,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-15 06:37:31,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-15 06:37:31,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret11 := main(); {2936#true} is VALID [2022-04-15 06:37:31,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#true} is VALID [2022-04-15 06:37:31,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_132 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_132 (* 4294967295 v_it_11)) 4294967296)) (not (<= (+ v_main_~y~0_102 v_it_11 1) v_main_~y~0_101)))) (< v_main_~y~0_102 v_main_~y~0_101) (= v_main_~x~0_131 (+ v_main_~x~0_132 (* (- 1) v_main_~y~0_101) v_main_~y~0_102))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2936#true} is VALID [2022-04-15 06:37:31,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#true} [84] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2936#true} is VALID [2022-04-15 06:37:31,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#true} ~z~0 := ~y~0; {2941#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:37:31,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {2941#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2942#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:37:31,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {2942#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2943#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:31,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {2943#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:37:31,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {2944#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:31,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:31,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:31,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:31,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2937#false} is VALID [2022-04-15 06:37:31,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#false} assume !(~y~0 % 4294967296 > 0); {2937#false} is VALID [2022-04-15 06:37:31,477 INFO L272 TraceCheckUtils]: 18: Hoare triple {2937#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2937#false} is VALID [2022-04-15 06:37:31,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2022-04-15 06:37:31,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2022-04-15 06:37:31,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2022-04-15 06:37:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:31,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:31,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {2937#false} assume !false; {2937#false} is VALID [2022-04-15 06:37:31,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {2937#false} assume 0 == ~cond; {2937#false} is VALID [2022-04-15 06:37:31,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {2937#false} ~cond := #in~cond; {2937#false} is VALID [2022-04-15 06:37:31,870 INFO L272 TraceCheckUtils]: 18: Hoare triple {2937#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2937#false} is VALID [2022-04-15 06:37:31,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {2937#false} assume !(~y~0 % 4294967296 > 0); {2937#false} is VALID [2022-04-15 06:37:31,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2937#false} is VALID [2022-04-15 06:37:31,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2948#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:31,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2947#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:31,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {2946#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:31,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {3043#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2945#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:31,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {3047#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3043#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:31,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {3051#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3047#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:31,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {3055#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3051#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:31,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {2936#true} ~z~0 := ~y~0; {3055#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:31,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {2936#true} [84] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2936#true} is VALID [2022-04-15 06:37:31,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {2936#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_132 4294967296)) (.cse0 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse1 (= v_main_~y~0_102 v_main_~y~0_101)) (.cse2 (= v_main_~x~0_132 v_main_~x~0_131)) (.cse4 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_132 (* 4294967295 v_it_11)) 4294967296)) (not (<= (+ v_main_~y~0_102 v_it_11 1) v_main_~y~0_101)))) (< v_main_~y~0_102 v_main_~y~0_101) (= v_main_~x~0_131 (+ v_main_~x~0_132 (* (- 1) v_main_~y~0_101) v_main_~y~0_102))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_102, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_131, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {2936#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {2936#true} call #t~ret11 := main(); {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2936#true} {2936#true} #61#return; {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {2936#true} assume true; {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {2936#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(10, 2);call #Ultimate.allocInit(12, 3); {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {2936#true} call ULTIMATE.init(); {2936#true} is VALID [2022-04-15 06:37:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:31,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042482342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:31,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:31,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-15 06:37:31,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:31,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [75166108] [2022-04-15 06:37:31,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [75166108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:31,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:31,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:37:31,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401614076] [2022-04-15 06:37:31,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:31,981 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 06:37:31,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:31,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:32,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:32,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:37:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:32,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:37:32,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:37:32,001 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:32,961 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 06:37:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:37:32,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 06:37:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:32,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:32,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2022-04-15 06:37:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 45 transitions. [2022-04-15 06:37:32,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 45 transitions. [2022-04-15 06:37:33,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:33,052 INFO L225 Difference]: With dead ends: 45 [2022-04-15 06:37:33,052 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 06:37:33,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:37:33,053 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:33,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 58 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:37:33,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 06:37:33,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 06:37:33,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:33,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:33,117 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:33,117 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:33,118 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:37:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:37:33,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:33,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:33,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 06:37:33,118 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 06:37:33,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:33,119 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 06:37:33,119 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:37:33,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:33,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:33,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:33,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:33,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 06:37:33,120 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-04-15 06:37:33,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:33,120 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 06:37:33,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:33,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 06:37:38,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:38,373 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 06:37:38,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:37:38,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:38,374 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:38,390 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 06:37:38,583 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,SelfDestructingSolverStorable12 [2022-04-15 06:37:38,583 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:38,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash -405165152, now seen corresponding path program 9 times [2022-04-15 06:37:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:38,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [128164217] [2022-04-15 06:37:38,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:38,793 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2036813088, now seen corresponding path program 1 times [2022-04-15 06:37:38,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:38,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883951404] [2022-04-15 06:37:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:38,804 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:38,816 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:38,936 INFO L290 TraceCheckUtils]: 0: Hoare triple {3330#(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(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-15 06:37:38,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-15 06:37:38,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3330#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:38,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {3330#(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(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret11 := main(); {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (mod v_main_~x~0_149 4294967296))) (or (and (= v_main_~x~0_149 v_main_~x~0_148) .cse0 .cse1 (= v_main_~y~0_120 v_main_~y~0_119)) (and (<= .cse2 0) (= v_main_~y~0_119 v_main_~y~0_120) (= v_main_~x~0_148 v_main_~x~0_149) .cse0 .cse1) (and (< 0 .cse2) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~y~0_120 v_it_12 1) v_main_~y~0_119)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (= v_main_~x~0_148 (+ (* (- 1) v_main_~y~0_119) v_main_~x~0_149 v_main_~y~0_120)) (< v_main_~y~0_120 v_main_~y~0_119)))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3317#true} is VALID [2022-04-15 06:37:38,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#true} [86] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3317#true} is VALID [2022-04-15 06:37:38,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#true} ~z~0 := ~y~0; {3322#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:37:38,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {3322#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3323#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:37:38,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {3323#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3324#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:38,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3325#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:37:38,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:37:38,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:37:38,942 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:38,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:38,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:38,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3318#false} is VALID [2022-04-15 06:37:38,944 INFO L272 TraceCheckUtils]: 18: Hoare triple {3318#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3318#false} is VALID [2022-04-15 06:37:38,944 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2022-04-15 06:37:38,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2022-04-15 06:37:38,944 INFO L290 TraceCheckUtils]: 21: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-15 06:37:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:38,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:38,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883951404] [2022-04-15 06:37:38,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883951404] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:38,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846795785] [2022-04-15 06:37:38,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:38,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:38,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:38,946 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 06:37:38,947 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 06:37:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:38,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:37:38,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:38,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:39,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#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(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret11 := main(); {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (mod v_main_~x~0_149 4294967296))) (or (and (= v_main_~x~0_149 v_main_~x~0_148) .cse0 .cse1 (= v_main_~y~0_120 v_main_~y~0_119)) (and (<= .cse2 0) (= v_main_~y~0_119 v_main_~y~0_120) (= v_main_~x~0_148 v_main_~x~0_149) .cse0 .cse1) (and (< 0 .cse2) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~y~0_120 v_it_12 1) v_main_~y~0_119)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (= v_main_~x~0_148 (+ (* (- 1) v_main_~y~0_119) v_main_~x~0_149 v_main_~y~0_120)) (< v_main_~y~0_120 v_main_~y~0_119)))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3317#true} is VALID [2022-04-15 06:37:39,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#true} [86] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3317#true} is VALID [2022-04-15 06:37:39,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#true} ~z~0 := ~y~0; {3322#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:37:39,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {3322#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3323#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:37:39,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {3323#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3324#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:39,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {3324#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3325#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:37:39,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:37:39,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:37:39,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:39,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:39,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:39,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3318#false} is VALID [2022-04-15 06:37:39,332 INFO L272 TraceCheckUtils]: 18: Hoare triple {3318#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3318#false} is VALID [2022-04-15 06:37:39,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2022-04-15 06:37:39,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2022-04-15 06:37:39,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-15 06:37:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:39,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:39,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2022-04-15 06:37:39,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2022-04-15 06:37:39,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2022-04-15 06:37:39,658 INFO L272 TraceCheckUtils]: 18: Hoare triple {3318#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3318#false} is VALID [2022-04-15 06:37:39,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3318#false} is VALID [2022-04-15 06:37:39,659 INFO L290 TraceCheckUtils]: 16: Hoare triple {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3329#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:37:39,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3328#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:37:39,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3327#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:37:39,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:37:39,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3424#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3326#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:37:39,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {3428#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3424#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:37:39,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {3432#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3428#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:37:39,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {3436#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3432#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:37:39,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {3317#true} ~z~0 := ~y~0; {3436#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:37:39,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {3317#true} [86] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {3317#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse1 (= |v_main_#t~post5_54| |v_main_#t~post5_53|)) (.cse2 (mod v_main_~x~0_149 4294967296))) (or (and (= v_main_~x~0_149 v_main_~x~0_148) .cse0 .cse1 (= v_main_~y~0_120 v_main_~y~0_119)) (and (<= .cse2 0) (= v_main_~y~0_119 v_main_~y~0_120) (= v_main_~x~0_148 v_main_~x~0_149) .cse0 .cse1) (and (< 0 .cse2) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~y~0_120 v_it_12 1) v_main_~y~0_119)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (= v_main_~x~0_148 (+ (* (- 1) v_main_~y~0_119) v_main_~x~0_149 v_main_~y~0_120)) (< v_main_~y~0_120 v_main_~y~0_119)))) InVars {main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {3317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret11 := main(); {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #61#return; {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {3317#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(10, 2);call #Ultimate.allocInit(12, 3); {3317#true} is VALID [2022-04-15 06:37:39,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2022-04-15 06:37:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:39,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846795785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:39,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:39,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-15 06:37:39,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [128164217] [2022-04-15 06:37:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [128164217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:39,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:39,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:37:39,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541458785] [2022-04-15 06:37:39,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:39,860 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:37:39,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:39,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:39,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:39,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:37:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:39,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:37:39,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:37:39,901 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:41,150 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 06:37:41,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:37:41,150 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 06:37:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2022-04-15 06:37:41,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 34 transitions. [2022-04-15 06:37:41,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 34 transitions. [2022-04-15 06:37:41,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:41,275 INFO L225 Difference]: With dead ends: 32 [2022-04-15 06:37:41,275 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:37:41,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=821, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:37:41,276 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:41,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 61 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:37:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:37:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:37:41,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:41,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,335 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,335 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:41,335 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 06:37:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:37:41,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:41,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:41,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:37:41,336 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:37:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:41,336 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 06:37:41,336 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:37:41,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:41,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:41,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:41,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:41,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 06:37:41,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 25 [2022-04-15 06:37:41,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:41,337 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 06:37:41,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:41,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 06:37:47,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 26 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 06:37:47,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:37:47,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:47,975 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:47,990 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 06:37:48,175 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,SelfDestructingSolverStorable13 [2022-04-15 06:37:48,175 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 10 times [2022-04-15 06:37:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:48,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988958301] [2022-04-15 06:37:48,350 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:48,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:48,353 INFO L85 PathProgramCache]: Analyzing trace with hash 436742413, now seen corresponding path program 1 times [2022-04-15 06:37:48,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:48,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360739380] [2022-04-15 06:37:48,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:48,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:48,362 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:48,374 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:48,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:48,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:48,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {3682#(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(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-15 06:37:48,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-15 06:37:48,466 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-15 06:37:48,467 INFO L272 TraceCheckUtils]: 0: Hoare triple {3670#true} call ULTIMATE.init(); {3682#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:48,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {3682#(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(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-15 06:37:48,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-15 06:37:48,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-15 06:37:48,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {3670#true} call #t~ret11 := main(); {3670#true} is VALID [2022-04-15 06:37:48,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {3670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3670#true} is VALID [2022-04-15 06:37:48,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {3670#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_166 4294967296)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= v_main_~x~0_166 v_main_~x~0_165)) (.cse4 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_136 v_it_13 1) v_main_~y~0_135)) (< 0 (mod (+ v_main_~x~0_166 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_136 v_main_~y~0_135) (< 0 .cse0) (= v_main_~x~0_165 (+ v_main_~x~0_166 v_main_~y~0_136 (* (- 1) v_main_~y~0_135)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_166, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3670#true} is VALID [2022-04-15 06:37:48,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {3670#true} [88] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:48,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,477 INFO L290 TraceCheckUtils]: 15: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:48,478 INFO L290 TraceCheckUtils]: 17: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,482 INFO L272 TraceCheckUtils]: 19: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3680#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:37:48,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {3680#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3681#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:37:48,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {3681#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3671#false} is VALID [2022-04-15 06:37:48,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {3671#false} assume !false; {3671#false} is VALID [2022-04-15 06:37:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360739380] [2022-04-15 06:37:48,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360739380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:48,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625831879] [2022-04-15 06:37:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:48,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:48,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:48,484 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 06:37:48,489 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 06:37:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:48,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:37:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:48,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:48,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {3670#true} call ULTIMATE.init(); {3670#true} is VALID [2022-04-15 06:37:48,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {3670#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(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-15 06:37:48,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-15 06:37:48,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-15 06:37:48,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {3670#true} call #t~ret11 := main(); {3670#true} is VALID [2022-04-15 06:37:48,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {3670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3670#true} is VALID [2022-04-15 06:37:48,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {3670#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_166 4294967296)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= v_main_~x~0_166 v_main_~x~0_165)) (.cse4 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_136 v_it_13 1) v_main_~y~0_135)) (< 0 (mod (+ v_main_~x~0_166 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_136 v_main_~y~0_135) (< 0 .cse0) (= v_main_~x~0_165 (+ v_main_~x~0_166 v_main_~y~0_136 (* (- 1) v_main_~y~0_135)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_166, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3670#true} is VALID [2022-04-15 06:37:48,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {3670#true} [88] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:48,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:48,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:48,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:48,772 INFO L272 TraceCheckUtils]: 19: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:48,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:48,772 INFO L290 TraceCheckUtils]: 21: Hoare triple {3747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3671#false} is VALID [2022-04-15 06:37:48,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {3671#false} assume !false; {3671#false} is VALID [2022-04-15 06:37:48,773 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:48,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:49,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {3671#false} assume !false; {3671#false} is VALID [2022-04-15 06:37:49,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {3747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3671#false} is VALID [2022-04-15 06:37:49,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:37:49,018 INFO L272 TraceCheckUtils]: 19: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:37:49,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:49,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:49,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:49,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:49,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:49,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:49,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3679#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:49,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3678#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:49,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3677#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:49,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3676#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:37:49,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:49,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {3670#true} [88] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3675#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:37:49,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {3670#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_166 4294967296)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= v_main_~y~0_136 v_main_~y~0_135)) (.cse3 (= v_main_~x~0_166 v_main_~x~0_165)) (.cse4 (= |v_main_#t~post5_59| |v_main_#t~post5_58|))) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_136 v_it_13 1) v_main_~y~0_135)) (< 0 (mod (+ v_main_~x~0_166 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_136 v_main_~y~0_135) (< 0 .cse0) (= v_main_~x~0_165 (+ v_main_~x~0_166 v_main_~y~0_136 (* (- 1) v_main_~y~0_135)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_166, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3670#true} is VALID [2022-04-15 06:37:49,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {3670#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3670#true} is VALID [2022-04-15 06:37:49,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {3670#true} call #t~ret11 := main(); {3670#true} is VALID [2022-04-15 06:37:49,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3670#true} {3670#true} #61#return; {3670#true} is VALID [2022-04-15 06:37:49,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {3670#true} assume true; {3670#true} is VALID [2022-04-15 06:37:49,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {3670#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(10, 2);call #Ultimate.allocInit(12, 3); {3670#true} is VALID [2022-04-15 06:37:49,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {3670#true} call ULTIMATE.init(); {3670#true} is VALID [2022-04-15 06:37:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:49,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625831879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:49,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:49,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-15 06:37:49,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988958301] [2022-04-15 06:37:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988958301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:49,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:37:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728220008] [2022-04-15 06:37:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:49,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:37:49,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:49,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:49,235 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 06:37:49,235 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:37:49,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:37:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:37:49,236 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:50,130 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-15 06:37:50,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:37:50,130 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 06:37:50,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 06:37:50,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 49 transitions. [2022-04-15 06:37:50,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 49 transitions. [2022-04-15 06:37:50,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:50,200 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:37:50,200 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:37:50,201 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:37:50,201 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:50,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 40 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:37:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:37:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-04-15 06:37:50,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:50,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,274 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,274 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:50,275 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 06:37:50,275 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 06:37:50,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:50,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:50,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:37:50,276 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:37:50,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:50,276 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 06:37:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2022-04-15 06:37:50,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:50,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:50,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:50,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:50,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 06:37:50,277 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 26 [2022-04-15 06:37:50,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:50,277 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 06:37:50,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:50,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 06:37:55,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:55,285 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 06:37:55,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:37:55,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:37:55,286 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:37:55,302 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 06:37:55,487 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,SelfDestructingSolverStorable14 [2022-04-15 06:37:55,487 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:37:55,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:37:55,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1712811712, now seen corresponding path program 11 times [2022-04-15 06:37:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:55,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [105142963] [2022-04-15 06:37:55,655 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:37:55,657 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:37:55,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1401082688, now seen corresponding path program 1 times [2022-04-15 06:37:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:37:55,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737675065] [2022-04-15 06:37:55,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:37:55,668 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,706 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:37:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:37:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {4095#(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(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-15 06:37:55,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 06:37:55,873 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-15 06:37:55,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4095#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:37:55,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {4095#(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(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret11 := main(); {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_192 4294967296)) (.cse1 (= v_main_~x~0_192 v_main_~x~0_191)) (.cse2 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< 0 .cse0) (= v_main_~y~0_149 (+ v_main_~x~0_192 v_main_~y~0_150 (* v_main_~x~0_191 (- 1)))) (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_191 v_it_14 1) v_main_~x~0_192)) (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_192 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~x~0_191 v_main_~x~0_192)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150) (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_150 v_main_~y~0_149) .cse3))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4080#true} is VALID [2022-04-15 06:37:55,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} ~z~0 := ~y~0; {4085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:37:55,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {4085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:37:55,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {4086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4087#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:55,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4088#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:37:55,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:37:55,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:55,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:55,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:55,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:55,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4081#false} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {4081#false} assume !(~y~0 % 4294967296 > 0); {4081#false} is VALID [2022-04-15 06:37:55,883 INFO L272 TraceCheckUtils]: 20: Hoare triple {4081#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4081#false} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 06:37:55,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 06:37:55,883 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:55,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:37:55,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737675065] [2022-04-15 06:37:55,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737675065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:37:55,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424961754] [2022-04-15 06:37:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:37:55,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:37:55,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:37:55,904 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 06:37:55,919 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 06:37:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:37:55,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:37:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:37:56,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-15 06:37:56,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#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(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-15 06:37:56,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 06:37:56,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-15 06:37:56,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret11 := main(); {4080#true} is VALID [2022-04-15 06:37:56,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4080#true} is VALID [2022-04-15 06:37:56,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_192 4294967296)) (.cse1 (= v_main_~x~0_192 v_main_~x~0_191)) (.cse2 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< 0 .cse0) (= v_main_~y~0_149 (+ v_main_~x~0_192 v_main_~y~0_150 (* v_main_~x~0_191 (- 1)))) (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_191 v_it_14 1) v_main_~x~0_192)) (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_192 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~x~0_191 v_main_~x~0_192)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150) (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_150 v_main_~y~0_149) .cse3))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#true} is VALID [2022-04-15 06:37:56,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4080#true} is VALID [2022-04-15 06:37:56,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} ~z~0 := ~y~0; {4085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:37:56,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {4085#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:37:56,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {4086#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4087#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:37:56,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {4087#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4088#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:37:56,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:37:56,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {4089#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:56,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:56,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:56,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:56,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:56,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4081#false} is VALID [2022-04-15 06:37:56,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {4081#false} assume !(~y~0 % 4294967296 > 0); {4081#false} is VALID [2022-04-15 06:37:56,274 INFO L272 TraceCheckUtils]: 20: Hoare triple {4081#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4081#false} is VALID [2022-04-15 06:37:56,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-15 06:37:56,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 06:37:56,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 06:37:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:56,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:37:56,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {4081#false} assume !false; {4081#false} is VALID [2022-04-15 06:37:56,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {4081#false} assume 0 == ~cond; {4081#false} is VALID [2022-04-15 06:37:56,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {4081#false} ~cond := #in~cond; {4081#false} is VALID [2022-04-15 06:37:56,684 INFO L272 TraceCheckUtils]: 20: Hoare triple {4081#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4081#false} is VALID [2022-04-15 06:37:56,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {4081#false} assume !(~y~0 % 4294967296 > 0); {4081#false} is VALID [2022-04-15 06:37:56,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4081#false} is VALID [2022-04-15 06:37:56,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4094#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:37:56,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4093#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:37:56,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4092#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:56,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4091#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:56,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {4198#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4090#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:37:56,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {4202#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4198#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:56,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {4206#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4202#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:37:56,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {4210#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4206#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:56,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {4214#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4210#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:37:56,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {4080#true} ~z~0 := ~y~0; {4214#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:37:56,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {4080#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4080#true} is VALID [2022-04-15 06:37:56,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {4080#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_192 4294967296)) (.cse1 (= v_main_~x~0_192 v_main_~x~0_191)) (.cse2 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< 0 .cse0) (= v_main_~y~0_149 (+ v_main_~x~0_192 v_main_~y~0_150 (* v_main_~x~0_191 (- 1)))) (forall ((v_it_14 Int)) (or (not (<= (+ v_main_~x~0_191 v_it_14 1) v_main_~x~0_192)) (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_192 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~x~0_191 v_main_~x~0_192)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150) (<= .cse0 0)) (and .cse1 .cse2 (= v_main_~y~0_150 v_main_~y~0_149) .cse3))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_192, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_191, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4080#true} is VALID [2022-04-15 06:37:56,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {4080#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4080#true} is VALID [2022-04-15 06:37:56,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {4080#true} call #t~ret11 := main(); {4080#true} is VALID [2022-04-15 06:37:56,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4080#true} {4080#true} #61#return; {4080#true} is VALID [2022-04-15 06:37:56,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {4080#true} assume true; {4080#true} is VALID [2022-04-15 06:37:56,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {4080#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(10, 2);call #Ultimate.allocInit(12, 3); {4080#true} is VALID [2022-04-15 06:37:56,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {4080#true} call ULTIMATE.init(); {4080#true} is VALID [2022-04-15 06:37:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:37:56,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424961754] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:37:56,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:37:56,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 06:37:56,853 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:37:56,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [105142963] [2022-04-15 06:37:56,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [105142963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:37:56,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:37:56,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:37:56,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335839807] [2022-04-15 06:37:56,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:37:56,854 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:37:56,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:37:56,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:56,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:56,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:37:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:37:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:37:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:37:56,896 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:58,525 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-15 06:37:58,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:37:58,525 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 06:37:58,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:37:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-15 06:37:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-15 06:37:58,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 49 transitions. [2022-04-15 06:37:58,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:37:58,597 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:37:58,597 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 06:37:58,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:37:58,598 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:37:58,598 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 68 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:37:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 06:37:58,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 06:37:58,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:37:58,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,671 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,671 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:58,671 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 06:37:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:37:58,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:58,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:58,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:37:58,672 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 06:37:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:37:58,672 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 06:37:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:37:58,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:37:58,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:37:58,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:37:58,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:37:58,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 06:37:58,673 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-04-15 06:37:58,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:37:58,673 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 06:37:58,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:37:58,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 06:38:07,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 28 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:07,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 06:38:07,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:38:07,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:38:07,842 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:38:07,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 06:38:08,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 06:38:08,043 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:38:08,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:38:08,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1642818962, now seen corresponding path program 12 times [2022-04-15 06:38:08,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:08,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823991563] [2022-04-15 06:38:08,220 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:38:08,221 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:38:08,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1074330223, now seen corresponding path program 1 times [2022-04-15 06:38:08,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:38:08,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12661236] [2022-04-15 06:38:08,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:08,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:38:08,233 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:08,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:08,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:38:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:08,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {4524#(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(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-15 06:38:08,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-15 06:38:08,396 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {4509#true} call ULTIMATE.init(); {4524#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:38:08,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {4524#(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(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {4509#true} call #t~ret11 := main(); {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_171 v_main_~y~0_170)) (.cse0 (mod v_main_~x~0_212 4294967296)) (.cse2 (= v_main_~x~0_212 v_main_~x~0_211)) (.cse3 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_212 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_171 v_it_15 1) v_main_~y~0_170)) (not (<= 1 v_it_15)))) (= v_main_~x~0_211 (+ v_main_~x~0_212 v_main_~y~0_171 (* (- 1) v_main_~y~0_170))) (< 0 .cse0) (< v_main_~y~0_171 v_main_~y~0_170)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_170, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_211, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4509#true} is VALID [2022-04-15 06:38:08,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4509#true} is VALID [2022-04-15 06:38:08,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} ~z~0 := ~y~0; {4514#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:38:08,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4515#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:38:08,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {4515#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:38:08,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {4516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:38:08,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {4517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:38:08,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {4518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:08,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:08,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:38:08,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:38:08,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:38:08,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:38:08,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4510#false} is VALID [2022-04-15 06:38:08,405 INFO L272 TraceCheckUtils]: 20: Hoare triple {4510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4510#false} is VALID [2022-04-15 06:38:08,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#false} ~cond := #in~cond; {4510#false} is VALID [2022-04-15 06:38:08,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#false} assume 0 == ~cond; {4510#false} is VALID [2022-04-15 06:38:08,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#false} assume !false; {4510#false} is VALID [2022-04-15 06:38:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:38:08,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12661236] [2022-04-15 06:38:08,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12661236] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:38:08,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571365286] [2022-04-15 06:38:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:08,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:38:08,407 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:38:08,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 06:38:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:08,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:38:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:08,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:38:08,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {4509#true} call ULTIMATE.init(); {4509#true} is VALID [2022-04-15 06:38:08,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#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(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {4509#true} call #t~ret11 := main(); {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_171 v_main_~y~0_170)) (.cse0 (mod v_main_~x~0_212 4294967296)) (.cse2 (= v_main_~x~0_212 v_main_~x~0_211)) (.cse3 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_212 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_171 v_it_15 1) v_main_~y~0_170)) (not (<= 1 v_it_15)))) (= v_main_~x~0_211 (+ v_main_~x~0_212 v_main_~y~0_171 (* (- 1) v_main_~y~0_170))) (< 0 .cse0) (< v_main_~y~0_171 v_main_~y~0_170)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_170, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_211, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4509#true} is VALID [2022-04-15 06:38:08,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} ~z~0 := ~y~0; {4514#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:38:08,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4515#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:38:08,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {4515#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:38:08,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {4516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:38:08,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {4517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:38:08,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {4518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:08,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:08,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:38:08,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:38:08,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:38:08,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:38:08,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4510#false} is VALID [2022-04-15 06:38:08,806 INFO L272 TraceCheckUtils]: 20: Hoare triple {4510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4510#false} is VALID [2022-04-15 06:38:08,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#false} ~cond := #in~cond; {4510#false} is VALID [2022-04-15 06:38:08,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#false} assume 0 == ~cond; {4510#false} is VALID [2022-04-15 06:38:08,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#false} assume !false; {4510#false} is VALID [2022-04-15 06:38:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:08,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:38:09,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#false} assume !false; {4510#false} is VALID [2022-04-15 06:38:09,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#false} assume 0 == ~cond; {4510#false} is VALID [2022-04-15 06:38:09,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#false} ~cond := #in~cond; {4510#false} is VALID [2022-04-15 06:38:09,162 INFO L272 TraceCheckUtils]: 20: Hoare triple {4510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4510#false} is VALID [2022-04-15 06:38:09,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4510#false} is VALID [2022-04-15 06:38:09,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4523#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:38:09,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4522#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:38:09,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4521#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:38:09,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4520#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:38:09,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:09,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {4627#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4519#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:09,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {4631#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4627#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:38:09,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {4635#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4631#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 06:38:09,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {4639#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4635#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:38:09,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {4643#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4639#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 06:38:09,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {4509#true} ~z~0 := ~y~0; {4643#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:38:09,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {4509#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {4509#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_171 v_main_~y~0_170)) (.cse0 (mod v_main_~x~0_212 4294967296)) (.cse2 (= v_main_~x~0_212 v_main_~x~0_211)) (.cse3 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse4 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_212 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_171 v_it_15 1) v_main_~y~0_170)) (not (<= 1 v_it_15)))) (= v_main_~x~0_211 (+ v_main_~x~0_212 v_main_~y~0_171 (* (- 1) v_main_~y~0_170))) (< 0 .cse0) (< v_main_~y~0_171 v_main_~y~0_170)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_170, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_211, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {4509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {4509#true} call #t~ret11 := main(); {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4509#true} {4509#true} #61#return; {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {4509#true} assume true; {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {4509#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(10, 2);call #Ultimate.allocInit(12, 3); {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {4509#true} call ULTIMATE.init(); {4509#true} is VALID [2022-04-15 06:38:09,173 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:09,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571365286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:38:09,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:38:09,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-15 06:38:09,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:38:09,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823991563] [2022-04-15 06:38:09,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823991563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:38:09,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:38:09,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:38:09,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949838944] [2022-04-15 06:38:09,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:38:09,472 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:38:09,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:38:09,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:09,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:09,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:38:09,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:09,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:38:09,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-15 06:38:09,500 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:11,971 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 06:38:11,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:38:11,971 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 06:38:11,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:38:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2022-04-15 06:38:11,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 37 transitions. [2022-04-15 06:38:11,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 37 transitions. [2022-04-15 06:38:12,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:12,144 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:38:12,144 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:38:12,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:38:12,145 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:38:12,145 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 71 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:38:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:38:12,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:38:12,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:38:12,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:12,233 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:12,233 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:12,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:12,234 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 06:38:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 06:38:12,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:12,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:12,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:38:12,234 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 06:38:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:12,235 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-04-15 06:38:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 06:38:12,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:12,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:12,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:38:12,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:38:12,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-04-15 06:38:12,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2022-04-15 06:38:12,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:38:12,236 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-04-15 06:38:12,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:12,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 32 transitions. [2022-04-15 06:38:20,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 28 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-04-15 06:38:20,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:38:20,605 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:38:20,606 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:38:20,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 06:38:20,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 06:38:20,806 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:38:20,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:38:20,806 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 13 times [2022-04-15 06:38:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:20,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [666530641] [2022-04-15 06:38:23,752 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:38:23,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:38:23,823 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:38:23,824 INFO L85 PathProgramCache]: Analyzing trace with hash -409127522, now seen corresponding path program 1 times [2022-04-15 06:38:23,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:38:23,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134527360] [2022-04-15 06:38:23,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:23,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:38:23,833 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:23,846 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:38:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:23,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {4915#(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(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-15 06:38:23,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-15 06:38:23,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-15 06:38:23,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {4902#true} call ULTIMATE.init(); {4915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:38:23,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {4915#(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(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-15 06:38:23,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-15 06:38:23,964 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-15 06:38:23,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {4902#true} call #t~ret11 := main(); {4902#true} is VALID [2022-04-15 06:38:23,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {4902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4902#true} is VALID [2022-04-15 06:38:23,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {4902#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (= v_main_~x~0_232 v_main_~x~0_231)) (.cse3 (mod v_main_~x~0_232 4294967296))) (or (and (= v_main_~y~0_190 v_main_~y~0_189) .cse0 .cse1 .cse2) (and .cse0 (= v_main_~y~0_189 v_main_~y~0_190) (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_232 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_231 v_it_16 1) v_main_~x~0_232)))) (< v_main_~x~0_231 v_main_~x~0_232) (< 0 .cse3) (= v_main_~y~0_189 (+ v_main_~x~0_232 v_main_~y~0_190 (* v_main_~x~0_231 (- 1))))))) InVars {main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4902#true} is VALID [2022-04-15 06:38:23,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {4902#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:23,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:23,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:38:23,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:23,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:23,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:23,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:38:23,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:38:23,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:23,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:23,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:23,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:38:23,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:23,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:23,975 INFO L272 TraceCheckUtils]: 21: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:38:23,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {4913#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4914#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:38:23,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {4914#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4903#false} is VALID [2022-04-15 06:38:23,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {4903#false} assume !false; {4903#false} is VALID [2022-04-15 06:38:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:38:23,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134527360] [2022-04-15 06:38:23,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134527360] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:38:23,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109631751] [2022-04-15 06:38:23,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:38:23,978 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:38:23,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 06:38:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:24,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:38:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:24,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:38:24,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {4902#true} call ULTIMATE.init(); {4902#true} is VALID [2022-04-15 06:38:24,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4902#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(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-15 06:38:24,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-15 06:38:24,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-15 06:38:24,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {4902#true} call #t~ret11 := main(); {4902#true} is VALID [2022-04-15 06:38:24,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {4902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4902#true} is VALID [2022-04-15 06:38:24,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {4902#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (= v_main_~x~0_232 v_main_~x~0_231)) (.cse3 (mod v_main_~x~0_232 4294967296))) (or (and (= v_main_~y~0_190 v_main_~y~0_189) .cse0 .cse1 .cse2) (and .cse0 (= v_main_~y~0_189 v_main_~y~0_190) (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_232 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_231 v_it_16 1) v_main_~x~0_232)))) (< v_main_~x~0_231 v_main_~x~0_232) (< 0 .cse3) (= v_main_~y~0_189 (+ v_main_~x~0_232 v_main_~y~0_190 (* v_main_~x~0_231 (- 1))))))) InVars {main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4902#true} is VALID [2022-04-15 06:38:24,238 INFO L290 TraceCheckUtils]: 7: Hoare triple {4902#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:38:24,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:38:24,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:38:24,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:38:24,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,248 INFO L272 TraceCheckUtils]: 21: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:38:24,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:38:24,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {4986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4903#false} is VALID [2022-04-15 06:38:24,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {4903#false} assume !false; {4903#false} is VALID [2022-04-15 06:38:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:24,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:38:24,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {4903#false} assume !false; {4903#false} is VALID [2022-04-15 06:38:24,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {4986#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4903#false} is VALID [2022-04-15 06:38:24,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4986#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:38:24,502 INFO L272 TraceCheckUtils]: 21: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4982#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:38:24,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:38:24,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:38:24,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4912#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:38:24,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4911#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4910#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4909#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:24,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4908#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:38:24,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {4902#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4907#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:38:24,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {4902#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse1 (= |v_main_#t~post5_74| |v_main_#t~post5_73|)) (.cse2 (= v_main_~x~0_232 v_main_~x~0_231)) (.cse3 (mod v_main_~x~0_232 4294967296))) (or (and (= v_main_~y~0_190 v_main_~y~0_189) .cse0 .cse1 .cse2) (and .cse0 (= v_main_~y~0_189 v_main_~y~0_190) (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_232 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~x~0_231 v_it_16 1) v_main_~x~0_232)))) (< v_main_~x~0_231 v_main_~x~0_232) (< 0 .cse3) (= v_main_~y~0_189 (+ v_main_~x~0_232 v_main_~y~0_190 (* v_main_~x~0_231 (- 1))))))) InVars {main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_189, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_231, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {4902#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {4902#true} call #t~ret11 := main(); {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4902#true} {4902#true} #61#return; {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {4902#true} assume true; {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {4902#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(10, 2);call #Ultimate.allocInit(12, 3); {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {4902#true} call ULTIMATE.init(); {4902#true} is VALID [2022-04-15 06:38:24,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:24,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2109631751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:38:24,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:38:24,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-15 06:38:24,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:38:24,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [666530641] [2022-04-15 06:38:24,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [666530641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:38:24,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:38:24,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:38:24,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601377780] [2022-04-15 06:38:24,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:38:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:38:24,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:38:24,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:24,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:24,815 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:38:24,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:24,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:38:24,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:38:24,816 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:26,213 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2022-04-15 06:38:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:38:26,214 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 06:38:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:38:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-15 06:38:26,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-15 06:38:26,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2022-04-15 06:38:26,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:26,301 INFO L225 Difference]: With dead ends: 52 [2022-04-15 06:38:26,302 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:38:26,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:38:26,302 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:38:26,302 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 30 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:38:26,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:38:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-04-15 06:38:26,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:38:26,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,407 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,407 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:26,408 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-15 06:38:26,408 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 06:38:26,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:26,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:26,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 06:38:26,408 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 06:38:26,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:26,409 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-15 06:38:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-04-15 06:38:26,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:26,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:26,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:38:26,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:38:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-04-15 06:38:26,410 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2022-04-15 06:38:26,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:38:26,410 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-04-15 06:38:26,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:26,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 35 transitions. [2022-04-15 06:38:32,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-15 06:38:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:38:32,232 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:38:32,232 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:38:32,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 06:38:32,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:38:32,435 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:38:32,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:38:32,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1392182130, now seen corresponding path program 14 times [2022-04-15 06:38:32,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:32,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1699835706] [2022-04-15 06:38:32,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:38:32,932 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:38:32,934 INFO L85 PathProgramCache]: Analyzing trace with hash 2024818895, now seen corresponding path program 1 times [2022-04-15 06:38:32,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:38:32,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576037135] [2022-04-15 06:38:32,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:38:32,942 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:32,957 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:38:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:33,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {5377#(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(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-15 06:38:33,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-15 06:38:33,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-15 06:38:33,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {5360#true} call ULTIMATE.init(); {5377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:38:33,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {5377#(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(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-15 06:38:33,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-15 06:38:33,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-15 06:38:33,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {5360#true} call #t~ret11 := main(); {5360#true} is VALID [2022-04-15 06:38:33,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {5360#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5360#true} is VALID [2022-04-15 06:38:33,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {5360#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_263 4294967296)) (.cse0 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_206 v_main_~y~0_205)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_263 v_main_~x~0_262))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (not (<= (+ v_main_~y~0_206 v_it_17 1) v_main_~y~0_205)) (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_263 (* 4294967295 v_it_17)) 4294967296)))) (= v_main_~x~0_262 (+ v_main_~x~0_263 (* (- 1) v_main_~y~0_205) v_main_~y~0_206)) (< v_main_~y~0_206 v_main_~y~0_205) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5360#true} is VALID [2022-04-15 06:38:33,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {5360#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5360#true} is VALID [2022-04-15 06:38:33,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {5360#true} ~z~0 := ~y~0; {5365#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:38:33,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {5365#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5366#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:38:33,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {5366#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5367#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:38:33,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5368#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:38:33,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5369#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:38:33,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {5369#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:38:33,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:38:33,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:38:33,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5361#false} is VALID [2022-04-15 06:38:33,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {5361#false} assume !(~y~0 % 4294967296 > 0); {5361#false} is VALID [2022-04-15 06:38:33,186 INFO L272 TraceCheckUtils]: 22: Hoare triple {5361#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5361#false} is VALID [2022-04-15 06:38:33,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {5361#false} ~cond := #in~cond; {5361#false} is VALID [2022-04-15 06:38:33,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {5361#false} assume 0 == ~cond; {5361#false} is VALID [2022-04-15 06:38:33,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {5361#false} assume !false; {5361#false} is VALID [2022-04-15 06:38:33,186 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:33,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:38:33,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576037135] [2022-04-15 06:38:33,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576037135] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:38:33,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89710142] [2022-04-15 06:38:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:33,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:33,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:38:33,188 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:38:33,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 06:38:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:33,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:38:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:33,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:38:33,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {5360#true} call ULTIMATE.init(); {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {5360#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(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L272 TraceCheckUtils]: 4: Hoare triple {5360#true} call #t~ret11 := main(); {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {5360#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {5360#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_263 4294967296)) (.cse0 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_206 v_main_~y~0_205)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_263 v_main_~x~0_262))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (not (<= (+ v_main_~y~0_206 v_it_17 1) v_main_~y~0_205)) (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_263 (* 4294967295 v_it_17)) 4294967296)))) (= v_main_~x~0_262 (+ v_main_~x~0_263 (* (- 1) v_main_~y~0_205) v_main_~y~0_206)) (< v_main_~y~0_206 v_main_~y~0_205) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5360#true} is VALID [2022-04-15 06:38:33,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {5360#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5360#true} is VALID [2022-04-15 06:38:33,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {5360#true} ~z~0 := ~y~0; {5365#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:38:33,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {5365#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5366#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:38:33,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {5366#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5367#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:38:33,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {5367#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5368#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:38:33,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {5368#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5369#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:38:33,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {5369#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:38:33,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {5370#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:38:33,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:38:33,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5361#false} is VALID [2022-04-15 06:38:33,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {5361#false} assume !(~y~0 % 4294967296 > 0); {5361#false} is VALID [2022-04-15 06:38:33,540 INFO L272 TraceCheckUtils]: 22: Hoare triple {5361#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5361#false} is VALID [2022-04-15 06:38:33,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {5361#false} ~cond := #in~cond; {5361#false} is VALID [2022-04-15 06:38:33,540 INFO L290 TraceCheckUtils]: 24: Hoare triple {5361#false} assume 0 == ~cond; {5361#false} is VALID [2022-04-15 06:38:33,540 INFO L290 TraceCheckUtils]: 25: Hoare triple {5361#false} assume !false; {5361#false} is VALID [2022-04-15 06:38:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:33,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:38:33,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {5361#false} assume !false; {5361#false} is VALID [2022-04-15 06:38:33,964 INFO L290 TraceCheckUtils]: 24: Hoare triple {5361#false} assume 0 == ~cond; {5361#false} is VALID [2022-04-15 06:38:33,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {5361#false} ~cond := #in~cond; {5361#false} is VALID [2022-04-15 06:38:33,965 INFO L272 TraceCheckUtils]: 22: Hoare triple {5361#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5361#false} is VALID [2022-04-15 06:38:33,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {5361#false} assume !(~y~0 % 4294967296 > 0); {5361#false} is VALID [2022-04-15 06:38:33,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5361#false} is VALID [2022-04-15 06:38:33,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:38:33,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5375#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:38:33,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5374#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5373#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5372#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {5489#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5371#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:38:33,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {5493#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5489#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:38:33,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {5497#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5493#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:38:33,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {5501#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5497#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:38:33,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {5505#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5501#(or (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:38:33,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {5509#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5505#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:38:33,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {5360#true} ~z~0 := ~y~0; {5509#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:38:33,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {5360#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5360#true} is VALID [2022-04-15 06:38:33,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {5360#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_263 4294967296)) (.cse0 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_206 v_main_~y~0_205)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (= v_main_~x~0_263 v_main_~x~0_262))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_17 Int)) (or (not (<= (+ v_main_~y~0_206 v_it_17 1) v_main_~y~0_205)) (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_263 (* 4294967295 v_it_17)) 4294967296)))) (= v_main_~x~0_262 (+ v_main_~x~0_263 (* (- 1) v_main_~y~0_205) v_main_~y~0_206)) (< v_main_~y~0_206 v_main_~y~0_205) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_263, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5360#true} is VALID [2022-04-15 06:38:33,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {5360#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5360#true} is VALID [2022-04-15 06:38:33,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {5360#true} call #t~ret11 := main(); {5360#true} is VALID [2022-04-15 06:38:33,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5360#true} {5360#true} #61#return; {5360#true} is VALID [2022-04-15 06:38:33,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {5360#true} assume true; {5360#true} is VALID [2022-04-15 06:38:33,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {5360#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(10, 2);call #Ultimate.allocInit(12, 3); {5360#true} is VALID [2022-04-15 06:38:33,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {5360#true} call ULTIMATE.init(); {5360#true} is VALID [2022-04-15 06:38:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:33,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89710142] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:38:33,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:38:33,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 21 [2022-04-15 06:38:34,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:38:34,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1699835706] [2022-04-15 06:38:34,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1699835706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:38:34,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:38:34,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:38:34,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433408419] [2022-04-15 06:38:34,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:38:34,275 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 06:38:34,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:38:34,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:34,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:34,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:38:34,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:34,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:38:34,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:38:34,302 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:36,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:36,858 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-04-15 06:38:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:38:36,858 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 06:38:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:38:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2022-04-15 06:38:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:36,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 53 transitions. [2022-04-15 06:38:36,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 53 transitions. [2022-04-15 06:38:37,005 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 06:38:37,005 INFO L225 Difference]: With dead ends: 57 [2022-04-15 06:38:37,005 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 06:38:37,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=311, Invalid=2139, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:38:37,007 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:38:37,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 78 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:38:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 06:38:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 06:38:37,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:38:37,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,118 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,118 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:37,119 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 06:38:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 06:38:37,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:37,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:37,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 06:38:37,120 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 06:38:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:37,120 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-15 06:38:37,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 06:38:37,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:37,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:37,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:38:37,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:38:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 06:38:37,121 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2022-04-15 06:38:37,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:38:37,121 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 06:38:37,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:37,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 06:38:48,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 29 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 06:38:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:38:48,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:38:48,916 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:38:48,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 06:38:49,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:49,116 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:38:49,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:38:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 43269344, now seen corresponding path program 15 times [2022-04-15 06:38:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:49,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1577610328] [2022-04-15 06:38:49,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:38:49,285 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:38:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1661923328, now seen corresponding path program 1 times [2022-04-15 06:38:49,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:38:49,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470806674] [2022-04-15 06:38:49,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:49,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:38:49,295 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:49,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:38:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:38:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:49,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {5854#(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(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-15 06:38:49,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-15 06:38:49,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-15 06:38:49,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:38:49,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {5854#(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(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-15 06:38:49,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-15 06:38:49,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-15 06:38:49,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret11 := main(); {5837#true} is VALID [2022-04-15 06:38:49,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {5837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5837#true} is VALID [2022-04-15 06:38:49,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_286 v_main_~x~0_285)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse2 (= v_main_~y~0_229 v_main_~y~0_228)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|)) (.cse3 (mod v_main_~x~0_286 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_228 (+ v_main_~x~0_286 (* v_main_~x~0_285 (- 1)) v_main_~y~0_229)) (< 0 .cse3) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_285 v_it_18 1) v_main_~x~0_286)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_286 (* 4294967295 v_it_18)) 4294967296)))) (< v_main_~x~0_285 v_main_~x~0_286)))) InVars {main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_286, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5837#true} is VALID [2022-04-15 06:38:49,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5837#true} is VALID [2022-04-15 06:38:49,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#true} ~z~0 := ~y~0; {5842#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:38:49,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {5842#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5843#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:38:49,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {5843#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5844#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:38:49,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {5844#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5845#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:38:49,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {5845#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5846#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:38:49,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {5846#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5847#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:38:49,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {5847#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:38:49,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:38:49,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:49,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:38:49,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:38:49,511 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:38:49,512 INFO L290 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:38:49,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5838#false} is VALID [2022-04-15 06:38:49,513 INFO L272 TraceCheckUtils]: 22: Hoare triple {5838#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5838#false} is VALID [2022-04-15 06:38:49,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2022-04-15 06:38:49,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2022-04-15 06:38:49,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2022-04-15 06:38:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:38:49,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470806674] [2022-04-15 06:38:49,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470806674] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:38:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370469753] [2022-04-15 06:38:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:38:49,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:38:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:38:49,515 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:38:49,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 06:38:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:49,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:38:49,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:38:49,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:38:49,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {5837#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(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret11 := main(); {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {5837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_286 v_main_~x~0_285)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse2 (= v_main_~y~0_229 v_main_~y~0_228)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|)) (.cse3 (mod v_main_~x~0_286 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_228 (+ v_main_~x~0_286 (* v_main_~x~0_285 (- 1)) v_main_~y~0_229)) (< 0 .cse3) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_285 v_it_18 1) v_main_~x~0_286)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_286 (* 4294967295 v_it_18)) 4294967296)))) (< v_main_~x~0_285 v_main_~x~0_286)))) InVars {main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_286, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5837#true} is VALID [2022-04-15 06:38:49,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5837#true} is VALID [2022-04-15 06:38:49,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#true} ~z~0 := ~y~0; {5842#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:38:49,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {5842#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5843#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:38:49,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {5843#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5844#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:38:49,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {5844#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5845#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:38:49,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {5845#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5846#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:38:49,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {5846#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5847#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:38:49,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {5847#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:38:49,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:38:49,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:49,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:38:49,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:38:49,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:38:49,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:38:49,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5838#false} is VALID [2022-04-15 06:38:49,922 INFO L272 TraceCheckUtils]: 22: Hoare triple {5838#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5838#false} is VALID [2022-04-15 06:38:49,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2022-04-15 06:38:49,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2022-04-15 06:38:49,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2022-04-15 06:38:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:49,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:38:50,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {5838#false} assume !false; {5838#false} is VALID [2022-04-15 06:38:50,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {5838#false} assume 0 == ~cond; {5838#false} is VALID [2022-04-15 06:38:50,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {5838#false} ~cond := #in~cond; {5838#false} is VALID [2022-04-15 06:38:50,355 INFO L272 TraceCheckUtils]: 22: Hoare triple {5838#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5838#false} is VALID [2022-04-15 06:38:50,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {5838#false} is VALID [2022-04-15 06:38:50,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5853#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:38:50,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5852#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:38:50,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5851#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:38:50,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5850#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:38:50,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {5849#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:38:50,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:38:50,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {5966#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5848#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:38:50,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {5970#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5966#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:38:50,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {5974#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5970#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:38:50,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {5978#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5974#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:38:50,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {5982#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5978#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:38:50,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {5986#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5982#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:38:50,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {5837#true} ~z~0 := ~y~0; {5986#(or (<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:38:50,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {5837#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5837#true} is VALID [2022-04-15 06:38:50,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_286 v_main_~x~0_285)) (.cse1 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse2 (= v_main_~y~0_229 v_main_~y~0_228)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|)) (.cse3 (mod v_main_~x~0_286 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_228 (+ v_main_~x~0_286 (* v_main_~x~0_285 (- 1)) v_main_~y~0_229)) (< 0 .cse3) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_285 v_it_18 1) v_main_~x~0_286)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_286 (* 4294967295 v_it_18)) 4294967296)))) (< v_main_~x~0_285 v_main_~x~0_286)))) InVars {main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_286, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {5837#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {5837#true} call #t~ret11 := main(); {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5837#true} {5837#true} #61#return; {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {5837#true} assume true; {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {5837#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(10, 2);call #Ultimate.allocInit(12, 3); {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {5837#true} call ULTIMATE.init(); {5837#true} is VALID [2022-04-15 06:38:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:38:50,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370469753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:38:50,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:38:50,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 21 [2022-04-15 06:38:50,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:38:50,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1577610328] [2022-04-15 06:38:50,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1577610328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:38:50,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:38:50,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:38:50,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699012701] [2022-04-15 06:38:50,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:38:50,826 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:38:50,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:38:50,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:50,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:38:50,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:38:50,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:38:50,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:38:50,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2022-04-15 06:38:50,875 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:55,812 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 06:38:55,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:38:55,812 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 06:38:55,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:38:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-15 06:38:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 40 transitions. [2022-04-15 06:38:55,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 40 transitions. [2022-04-15 06:38:56,022 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 06:38:56,022 INFO L225 Difference]: With dead ends: 38 [2022-04-15 06:38:56,022 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:38:56,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=311, Invalid=1759, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:38:56,023 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:38:56,023 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 86 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:38:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:38:56,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:38:56,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:38:56,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:56,140 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:56,140 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:56,140 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 06:38:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 06:38:56,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:56,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:56,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:38:56,141 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 06:38:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:38:56,141 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 06:38:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 06:38:56,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:38:56,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:38:56,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:38:56,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:38:56,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:56,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 06:38:56,142 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 31 [2022-04-15 06:38:56,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:38:56,142 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 06:38:56,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:38:56,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 06:39:07,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 30 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:07,111 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 06:39:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:39:07,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:07,111 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:07,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 06:39:07,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:07,312 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 16 times [2022-04-15 06:39:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:07,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2081893086] [2022-04-15 06:39:07,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:39:07,470 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:39:07,472 INFO L85 PathProgramCache]: Analyzing trace with hash -380435923, now seen corresponding path program 1 times [2022-04-15 06:39:07,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:07,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537031888] [2022-04-15 06:39:07,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:07,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:07,480 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:39:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:07,506 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:39:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:39:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:07,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {6284#(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(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-15 06:39:07,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-15 06:39:07,651 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-15 06:39:07,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6284#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:39:07,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {6284#(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(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-15 06:39:07,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-15 06:39:07,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-15 06:39:07,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret11 := main(); {6270#true} is VALID [2022-04-15 06:39:07,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6270#true} is VALID [2022-04-15 06:39:07,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_309 4294967296)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_251 v_main_~y~0_250)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (= v_main_~x~0_309 v_main_~x~0_308))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_308 v_main_~x~0_309) (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_19)) 4294967296)) (not (<= (+ v_main_~x~0_308 v_it_19 1) v_main_~x~0_309)) (not (<= 1 v_it_19)))) (= v_main_~y~0_250 (+ v_main_~x~0_309 v_main_~y~0_251 (* v_main_~x~0_308 (- 1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_251, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6270#true} is VALID [2022-04-15 06:39:07,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:39:07,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:39:07,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:39:07,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:39:07,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,665 INFO L272 TraceCheckUtils]: 23: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6282#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:39:07,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {6282#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6283#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:39:07,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {6283#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6271#false} is VALID [2022-04-15 06:39:07,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-15 06:39:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:39:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537031888] [2022-04-15 06:39:07,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537031888] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:39:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074230207] [2022-04-15 06:39:07,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:07,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:39:07,667 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:39:07,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 06:39:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:07,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:39:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:07,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:39:07,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6270#true} is VALID [2022-04-15 06:39:07,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#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(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-15 06:39:07,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-15 06:39:07,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-15 06:39:07,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret11 := main(); {6270#true} is VALID [2022-04-15 06:39:07,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6270#true} is VALID [2022-04-15 06:39:07,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_309 4294967296)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_251 v_main_~y~0_250)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (= v_main_~x~0_309 v_main_~x~0_308))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_308 v_main_~x~0_309) (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_19)) 4294967296)) (not (<= (+ v_main_~x~0_308 v_it_19 1) v_main_~x~0_309)) (not (<= 1 v_it_19)))) (= v_main_~y~0_250 (+ v_main_~x~0_309 v_main_~y~0_251 (* v_main_~x~0_308 (- 1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_251, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6270#true} is VALID [2022-04-15 06:39:07,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:39:07,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:39:07,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:39:07,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:07,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:39:07,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:07,998 INFO L272 TraceCheckUtils]: 23: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:39:07,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:39:07,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {6361#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6271#false} is VALID [2022-04-15 06:39:07,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-15 06:39:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:07,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:39:08,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {6271#false} assume !false; {6271#false} is VALID [2022-04-15 06:39:08,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {6361#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6271#false} is VALID [2022-04-15 06:39:08,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6361#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:39:08,272 INFO L272 TraceCheckUtils]: 23: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6357#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:39:08,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:08,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:08,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:39:08,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:39:08,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6281#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6280#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:39:08,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6279#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6278#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6277#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:08,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6276#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:39:08,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:08,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6275#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:39:08,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_309 4294967296)) (.cse1 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= v_main_~y~0_251 v_main_~y~0_250)) (.cse3 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse4 (= v_main_~x~0_309 v_main_~x~0_308))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_308 v_main_~x~0_309) (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_19)) 4294967296)) (not (<= (+ v_main_~x~0_308 v_it_19 1) v_main_~x~0_309)) (not (<= 1 v_it_19)))) (= v_main_~y~0_250 (+ v_main_~x~0_309 v_main_~y~0_251 (* v_main_~x~0_308 (- 1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_251, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6270#true} is VALID [2022-04-15 06:39:08,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {6270#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6270#true} is VALID [2022-04-15 06:39:08,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {6270#true} call #t~ret11 := main(); {6270#true} is VALID [2022-04-15 06:39:08,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6270#true} {6270#true} #61#return; {6270#true} is VALID [2022-04-15 06:39:08,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {6270#true} assume true; {6270#true} is VALID [2022-04-15 06:39:08,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {6270#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(10, 2);call #Ultimate.allocInit(12, 3); {6270#true} is VALID [2022-04-15 06:39:08,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {6270#true} call ULTIMATE.init(); {6270#true} is VALID [2022-04-15 06:39:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:08,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074230207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:39:08,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:39:08,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2022-04-15 06:39:08,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:39:08,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2081893086] [2022-04-15 06:39:08,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2081893086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:08,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:08,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:39:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206181912] [2022-04-15 06:39:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:39:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 06:39:08,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:39:08,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:08,782 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 06:39:08,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:39:08,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:08,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:39:08,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:39:08,783 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:10,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:10,804 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-04-15 06:39:10,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:39:10,804 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 06:39:10,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:39:10,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-15 06:39:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 61 transitions. [2022-04-15 06:39:10,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 61 transitions. [2022-04-15 06:39:10,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:10,923 INFO L225 Difference]: With dead ends: 58 [2022-04-15 06:39:10,923 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:39:10,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=918, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:39:10,924 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:39:10,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 55 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:39:10,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:39:11,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2022-04-15 06:39:11,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:39:11,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:11,046 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:11,046 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:11,046 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 06:39:11,047 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-15 06:39:11,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:11,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:11,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:39:11,047 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 06:39:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:11,048 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2022-04-15 06:39:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2022-04-15 06:39:11,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:11,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:11,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:39:11,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:39:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:11,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 06:39:11,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-04-15 06:39:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:39:11,049 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 06:39:11,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 16 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:11,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 06:39:19,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 34 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 06:39:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:39:19,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:19,996 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:20,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 06:39:20,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:20,196 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:20,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:20,197 INFO L85 PathProgramCache]: Analyzing trace with hash -263990656, now seen corresponding path program 17 times [2022-04-15 06:39:20,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:20,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1732274053] [2022-04-15 06:39:20,401 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:39:20,403 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:39:20,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1767439904, now seen corresponding path program 1 times [2022-04-15 06:39:20,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:20,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517244716] [2022-04-15 06:39:20,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:20,413 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:39:20,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:20,433 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:39:20,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:39:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:20,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {6795#(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(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-15 06:39:20,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-15 06:39:20,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-15 06:39:20,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {6776#true} call ULTIMATE.init(); {6795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:39:20,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {6795#(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(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-15 06:39:20,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-15 06:39:20,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-15 06:39:20,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {6776#true} call #t~ret11 := main(); {6776#true} is VALID [2022-04-15 06:39:20,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {6776#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6776#true} is VALID [2022-04-15 06:39:20,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {6776#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_345 v_main_~x~0_344)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse3 (mod v_main_~x~0_345 4294967296))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2) (and (< 0 .cse3) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_344 (+ v_main_~x~0_345 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_345 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268))))))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_345, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_344, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6776#true} is VALID [2022-04-15 06:39:20,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {6776#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6776#true} is VALID [2022-04-15 06:39:20,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#true} ~z~0 := ~y~0; {6781#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:39:20,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {6781#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6782#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:39:20,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {6782#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6783#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:39:20,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6784#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:39:20,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6785#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:39:20,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {6785#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6786#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:39:20,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {6786#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:39:20,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:39:20,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:20,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:20,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:20,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:20,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:39:20,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:39:20,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6777#false} is VALID [2022-04-15 06:39:20,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#false} assume !(~y~0 % 4294967296 > 0); {6777#false} is VALID [2022-04-15 06:39:20,655 INFO L272 TraceCheckUtils]: 24: Hoare triple {6777#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6777#false} is VALID [2022-04-15 06:39:20,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {6777#false} ~cond := #in~cond; {6777#false} is VALID [2022-04-15 06:39:20,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#false} assume 0 == ~cond; {6777#false} is VALID [2022-04-15 06:39:20,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#false} assume !false; {6777#false} is VALID [2022-04-15 06:39:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:39:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517244716] [2022-04-15 06:39:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517244716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:39:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506423614] [2022-04-15 06:39:20,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:20,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:20,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:39:20,657 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:39:20,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 06:39:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:20,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:39:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:20,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:39:21,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {6776#true} call ULTIMATE.init(); {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {6776#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(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {6776#true} call #t~ret11 := main(); {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {6776#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {6776#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_345 v_main_~x~0_344)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse3 (mod v_main_~x~0_345 4294967296))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2) (and (< 0 .cse3) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_344 (+ v_main_~x~0_345 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_345 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268))))))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_345, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_344, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6776#true} is VALID [2022-04-15 06:39:21,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {6776#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6776#true} is VALID [2022-04-15 06:39:21,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#true} ~z~0 := ~y~0; {6781#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:39:21,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {6781#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6782#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:39:21,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {6782#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6783#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:39:21,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6784#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:39:21,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {6784#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6785#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:39:21,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {6785#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6786#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:39:21,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {6786#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:39:21,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {6787#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:39:21,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:39:21,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:39:21,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6777#false} is VALID [2022-04-15 06:39:21,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#false} assume !(~y~0 % 4294967296 > 0); {6777#false} is VALID [2022-04-15 06:39:21,029 INFO L272 TraceCheckUtils]: 24: Hoare triple {6777#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6777#false} is VALID [2022-04-15 06:39:21,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {6777#false} ~cond := #in~cond; {6777#false} is VALID [2022-04-15 06:39:21,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#false} assume 0 == ~cond; {6777#false} is VALID [2022-04-15 06:39:21,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#false} assume !false; {6777#false} is VALID [2022-04-15 06:39:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:21,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:39:21,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {6777#false} assume !false; {6777#false} is VALID [2022-04-15 06:39:21,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {6777#false} assume 0 == ~cond; {6777#false} is VALID [2022-04-15 06:39:21,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {6777#false} ~cond := #in~cond; {6777#false} is VALID [2022-04-15 06:39:21,551 INFO L272 TraceCheckUtils]: 24: Hoare triple {6777#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6777#false} is VALID [2022-04-15 06:39:21,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {6777#false} assume !(~y~0 % 4294967296 > 0); {6777#false} is VALID [2022-04-15 06:39:21,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6777#false} is VALID [2022-04-15 06:39:21,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6794#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:39:21,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6793#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:39:21,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6792#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6791#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6790#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {6789#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:39:21,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {6916#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {6788#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:39:21,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {6920#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6916#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:39:21,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {6924#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6920#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:39:21,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {6928#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6924#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:39:21,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {6932#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6928#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:39:21,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {6936#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6932#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:39:21,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {6940#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6936#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-15 06:39:21,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {6776#true} ~z~0 := ~y~0; {6940#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:39:21,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {6776#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6776#true} is VALID [2022-04-15 06:39:21,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {6776#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_345 v_main_~x~0_344)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= |v_main_#t~post6_94| |v_main_#t~post6_93|)) (.cse3 (mod v_main_~x~0_345 4294967296))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) .cse0 .cse1 .cse2 (<= .cse3 0)) (and .cse0 .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2) (and (< 0 .cse3) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_344 (+ v_main_~x~0_345 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_345 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268))))))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_345, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_344, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {6776#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {6776#true} call #t~ret11 := main(); {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6776#true} {6776#true} #61#return; {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {6776#true} assume true; {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {6776#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(10, 2);call #Ultimate.allocInit(12, 3); {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {6776#true} call ULTIMATE.init(); {6776#true} is VALID [2022-04-15 06:39:21,565 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:21,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506423614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:39:21,565 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:39:21,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 06:39:22,150 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:39:22,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1732274053] [2022-04-15 06:39:22,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1732274053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:22,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:22,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:39:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62779040] [2022-04-15 06:39:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:39:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:39:22,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:39:22,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:22,201 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 06:39:22,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:39:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:39:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:39:22,202 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:26,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:26,701 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-04-15 06:39:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:39:26,701 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 06:39:26,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:39:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2022-04-15 06:39:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:26,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 57 transitions. [2022-04-15 06:39:26,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 57 transitions. [2022-04-15 06:39:26,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:26,930 INFO L225 Difference]: With dead ends: 63 [2022-04-15 06:39:26,930 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:39:26,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:39:26,932 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:39:26,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 88 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:39:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:39:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 06:39:27,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:39:27,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:27,046 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:27,046 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:27,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:27,046 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 06:39:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 06:39:27,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:27,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:27,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:39:27,047 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:39:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:27,047 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 06:39:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 06:39:27,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:27,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:27,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:39:27,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:39:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 06:39:27,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 33 [2022-04-15 06:39:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:39:27,048 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 06:39:27,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:27,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 06:39:40,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 31 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 06:39:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:39:40,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:39:40,073 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:39:40,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 06:39:40,273 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:40,273 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:39:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:39:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash -685840210, now seen corresponding path program 18 times [2022-04-15 06:39:40,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:40,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652557213] [2022-04-15 06:39:40,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:39:40,440 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:39:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash 144115087, now seen corresponding path program 1 times [2022-04-15 06:39:40,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:39:40,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759561221] [2022-04-15 06:39:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:40,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:39:40,459 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:39:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:40,479 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:39:40,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:39:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:40,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {7320#(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(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-15 06:39:40,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-15 06:39:40,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-15 06:39:40,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:39:40,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {7320#(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(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-15 06:39:40,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-15 06:39:40,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-15 06:39:40,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret11 := main(); {7301#true} is VALID [2022-04-15 06:39:40,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7301#true} is VALID [2022-04-15 06:39:40,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_371 4294967296)) (.cse1 (= v_main_~y~0_295 v_main_~y~0_294)) (.cse2 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse3 (= v_main_~x~0_371 v_main_~x~0_370)) (.cse4 (= |v_main_#t~post6_99| |v_main_#t~post6_98|))) (or (and (< 0 .cse0) (= v_main_~y~0_294 (+ v_main_~x~0_371 v_main_~y~0_295 (* v_main_~x~0_370 (- 1)))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~x~0_370 v_it_21 1) v_main_~x~0_371)) (< 0 (mod (+ v_main_~x~0_371 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~x~0_370 v_main_~x~0_371)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_295, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_371, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7301#true} is VALID [2022-04-15 06:39:40,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7301#true} is VALID [2022-04-15 06:39:40,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} ~z~0 := ~y~0; {7306#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:39:40,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {7306#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7307#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:39:40,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {7307#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7308#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:39:40,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {7308#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7309#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:39:40,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {7309#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7310#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:39:40,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7311#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:39:40,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:39:40,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:39:40,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:39:40,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:39:40,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:39:40,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:39:40,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:39:40,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:39:40,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:39:40,757 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7302#false} is VALID [2022-04-15 06:39:40,757 INFO L272 TraceCheckUtils]: 24: Hoare triple {7302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-15 06:39:40,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-15 06:39:40,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-15 06:39:40,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-15 06:39:40,757 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:40,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:39:40,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759561221] [2022-04-15 06:39:40,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759561221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:39:40,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044518356] [2022-04-15 06:39:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:39:40,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:39:40,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:39:40,759 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:39:40,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 06:39:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:40,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:39:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:39:40,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:39:41,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#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(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret11 := main(); {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_371 4294967296)) (.cse1 (= v_main_~y~0_295 v_main_~y~0_294)) (.cse2 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse3 (= v_main_~x~0_371 v_main_~x~0_370)) (.cse4 (= |v_main_#t~post6_99| |v_main_#t~post6_98|))) (or (and (< 0 .cse0) (= v_main_~y~0_294 (+ v_main_~x~0_371 v_main_~y~0_295 (* v_main_~x~0_370 (- 1)))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~x~0_370 v_it_21 1) v_main_~x~0_371)) (< 0 (mod (+ v_main_~x~0_371 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~x~0_370 v_main_~x~0_371)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_295, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_371, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7301#true} is VALID [2022-04-15 06:39:41,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7301#true} is VALID [2022-04-15 06:39:41,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} ~z~0 := ~y~0; {7306#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:39:41,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {7306#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7307#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:39:41,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {7307#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7308#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:39:41,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {7308#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7309#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:39:41,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {7309#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7310#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:39:41,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {7310#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7311#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:39:41,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {7311#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:39:41,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {7312#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:39:41,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:39:41,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:39:41,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:39:41,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:39:41,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:39:41,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:39:41,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:39:41,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7302#false} is VALID [2022-04-15 06:39:41,244 INFO L272 TraceCheckUtils]: 24: Hoare triple {7302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-15 06:39:41,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-15 06:39:41,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-15 06:39:41,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-15 06:39:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:41,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:39:41,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {7302#false} assume !false; {7302#false} is VALID [2022-04-15 06:39:41,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {7302#false} assume 0 == ~cond; {7302#false} is VALID [2022-04-15 06:39:41,723 INFO L290 TraceCheckUtils]: 25: Hoare triple {7302#false} ~cond := #in~cond; {7302#false} is VALID [2022-04-15 06:39:41,723 INFO L272 TraceCheckUtils]: 24: Hoare triple {7302#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7302#false} is VALID [2022-04-15 06:39:41,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7302#false} is VALID [2022-04-15 06:39:41,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7319#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:39:41,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7318#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:39:41,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7317#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:39:41,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7316#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:39:41,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7315#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:39:41,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7314#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:39:41,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !(~z~0 % 4294967296 > 0); {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:39:41,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {7441#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7313#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:39:41,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {7445#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7441#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 06:39:41,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {7449#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7445#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 06:39:41,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {7453#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7449#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:39:41,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {7457#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7453#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 06:39:41,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {7461#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7457#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)))} is VALID [2022-04-15 06:39:41,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {7465#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7461#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:39:41,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {7301#true} ~z~0 := ~y~0; {7465#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:39:41,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {7301#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {7301#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_371 4294967296)) (.cse1 (= v_main_~y~0_295 v_main_~y~0_294)) (.cse2 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse3 (= v_main_~x~0_371 v_main_~x~0_370)) (.cse4 (= |v_main_#t~post6_99| |v_main_#t~post6_98|))) (or (and (< 0 .cse0) (= v_main_~y~0_294 (+ v_main_~x~0_371 v_main_~y~0_295 (* v_main_~x~0_370 (- 1)))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~x~0_370 v_it_21 1) v_main_~x~0_371)) (< 0 (mod (+ v_main_~x~0_371 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~x~0_370 v_main_~x~0_371)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_295, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_371, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_370, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {7301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L272 TraceCheckUtils]: 4: Hoare triple {7301#true} call #t~ret11 := main(); {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7301#true} {7301#true} #61#return; {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {7301#true} assume true; {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {7301#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(10, 2);call #Ultimate.allocInit(12, 3); {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {7301#true} call ULTIMATE.init(); {7301#true} is VALID [2022-04-15 06:39:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:39:41,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044518356] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:39:41,743 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:39:41,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 24 [2022-04-15 06:39:42,650 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:39:42,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652557213] [2022-04-15 06:39:42,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652557213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:39:42,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:39:42,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:39:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962133643] [2022-04-15 06:39:42,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:39:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 06:39:42,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:39:42,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:42,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:39:42,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:39:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:39:42,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:39:42,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2022-04-15 06:39:42,705 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:52,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:52,367 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 06:39:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:39:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 06:39:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:39:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2022-04-15 06:39:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 43 transitions. [2022-04-15 06:39:52,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 43 transitions. [2022-04-15 06:39:53,389 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 06:39:53,390 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:39:53,390 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 06:39:53,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=396, Invalid=2360, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:39:53,391 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:39:53,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 101 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:39:53,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 06:39:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 06:39:53,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:39:53,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:53,516 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:53,516 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:53,517 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 06:39:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 06:39:53,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:53,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:53,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 06:39:53,517 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 06:39:53,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:39:53,517 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-04-15 06:39:53,518 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 06:39:53,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:39:53,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:39:53,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:39:53,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:39:53,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:53,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-04-15 06:39:53,518 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2022-04-15 06:39:53,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:39:53,519 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-04-15 06:39:53,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:39:53,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 38 transitions. [2022-04-15 06:40:07,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 32 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-04-15 06:40:07,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:40:07,745 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:07,746 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:07,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 06:40:07,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:07,946 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:07,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:07,946 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 19 times [2022-04-15 06:40:07,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:07,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922601263] [2022-04-15 06:40:08,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:08,122 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:08,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1379488130, now seen corresponding path program 1 times [2022-04-15 06:40:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:08,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495773349] [2022-04-15 06:40:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:08,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:08,132 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:08,163 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:08,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {7789#(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(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-15 06:40:08,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-15 06:40:08,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-15 06:40:08,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {7774#true} call ULTIMATE.init(); {7789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:08,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {7789#(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(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-15 06:40:08,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-15 06:40:08,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-15 06:40:08,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#true} call #t~ret11 := main(); {7774#true} is VALID [2022-04-15 06:40:08,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7774#true} is VALID [2022-04-15 06:40:08,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (mod v_main_~x~0_397 4294967296)) (.cse2 (= |v_main_#t~post6_104| |v_main_#t~post6_103|))) (or (and (= v_main_~y~0_320 v_main_~y~0_319) .cse0 .cse1 .cse2) (and (= v_main_~x~0_396 (+ v_main_~x~0_397 v_main_~y~0_320 (* (- 1) v_main_~y~0_319))) (< v_main_~y~0_320 v_main_~y~0_319) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_320 v_it_22 1) v_main_~y~0_319)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_397 (* 4294967295 v_it_22)) 4294967296)))) (< 0 .cse3)) (and .cse0 (= v_main_~y~0_319 v_main_~y~0_320) .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_320, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7774#true} is VALID [2022-04-15 06:40:08,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:08,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:40:08,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:40:08,339 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:08,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,343 INFO L272 TraceCheckUtils]: 25: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7787#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:08,344 INFO L290 TraceCheckUtils]: 26: Hoare triple {7787#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7788#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:08,344 INFO L290 TraceCheckUtils]: 27: Hoare triple {7788#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7775#false} is VALID [2022-04-15 06:40:08,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#false} assume !false; {7775#false} is VALID [2022-04-15 06:40:08,344 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:08,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:08,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495773349] [2022-04-15 06:40:08,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495773349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:08,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961692287] [2022-04-15 06:40:08,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:08,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:08,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:08,346 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:40:08,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 06:40:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:08,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:40:08,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:08,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:08,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {7774#true} call ULTIMATE.init(); {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {7774#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(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#true} call #t~ret11 := main(); {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (mod v_main_~x~0_397 4294967296)) (.cse2 (= |v_main_#t~post6_104| |v_main_#t~post6_103|))) (or (and (= v_main_~y~0_320 v_main_~y~0_319) .cse0 .cse1 .cse2) (and (= v_main_~x~0_396 (+ v_main_~x~0_397 v_main_~y~0_320 (* (- 1) v_main_~y~0_319))) (< v_main_~y~0_320 v_main_~y~0_319) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_320 v_it_22 1) v_main_~y~0_319)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_397 (* 4294967295 v_it_22)) 4294967296)))) (< 0 .cse3)) (and .cse0 (= v_main_~y~0_319 v_main_~y~0_320) .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_320, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7774#true} is VALID [2022-04-15 06:40:08,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:08,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:40:08,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:40:08,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:08,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,669 INFO L290 TraceCheckUtils]: 24: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,669 INFO L272 TraceCheckUtils]: 25: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:40:08,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:08,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {7872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7775#false} is VALID [2022-04-15 06:40:08,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#false} assume !false; {7775#false} is VALID [2022-04-15 06:40:08,671 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:08,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:08,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {7775#false} assume !false; {7775#false} is VALID [2022-04-15 06:40:08,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {7872#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7775#false} is VALID [2022-04-15 06:40:08,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7872#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:40:08,932 INFO L272 TraceCheckUtils]: 25: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7868#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:40:08,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:08,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:40:08,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7786#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7785#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7784#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:40:08,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7783#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7782#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7781#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:08,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7780#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:08,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {7779#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:08,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_397 v_main_~x~0_396)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse3 (mod v_main_~x~0_397 4294967296)) (.cse2 (= |v_main_#t~post6_104| |v_main_#t~post6_103|))) (or (and (= v_main_~y~0_320 v_main_~y~0_319) .cse0 .cse1 .cse2) (and (= v_main_~x~0_396 (+ v_main_~x~0_397 v_main_~y~0_320 (* (- 1) v_main_~y~0_319))) (< v_main_~y~0_320 v_main_~y~0_319) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_320 v_it_22 1) v_main_~y~0_319)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_397 (* 4294967295 v_it_22)) 4294967296)))) (< 0 .cse3)) (and .cse0 (= v_main_~y~0_319 v_main_~y~0_320) .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_320, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_319, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {7774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {7774#true} call #t~ret11 := main(); {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7774#true} {7774#true} #61#return; {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {7774#true} assume true; {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {7774#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(10, 2);call #Ultimate.allocInit(12, 3); {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {7774#true} call ULTIMATE.init(); {7774#true} is VALID [2022-04-15 06:40:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:08,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961692287] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:08,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:08,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 15 [2022-04-15 06:40:09,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:09,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922601263] [2022-04-15 06:40:09,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922601263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:09,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:09,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:40:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534630440] [2022-04-15 06:40:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:09,676 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 06:40:09,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:09,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:09,753 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 06:40:09,753 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:40:09,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:09,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:40:09,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:40:09,754 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:12,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:12,751 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-04-15 06:40:12,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:40:12,751 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 06:40:12,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 06:40:12,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 67 transitions. [2022-04-15 06:40:12,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 67 transitions. [2022-04-15 06:40:12,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:13,000 INFO L225 Difference]: With dead ends: 64 [2022-04-15 06:40:13,000 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 06:40:13,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=344, Invalid=1138, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:40:13,001 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 47 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:13,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 40 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 06:40:13,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 06:40:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2022-04-15 06:40:13,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:13,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:13,146 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:13,146 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:13,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:13,147 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-15 06:40:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-15 06:40:13,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:13,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:13,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:40:13,148 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 06:40:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:13,148 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-04-15 06:40:13,148 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 69 transitions. [2022-04-15 06:40:13,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:13,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:13,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:13,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 06:40:13,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 35 [2022-04-15 06:40:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:13,149 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 06:40:13,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:13,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 06:40:27,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 34 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:27,743 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 06:40:27,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:40:27,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:27,744 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:27,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 06:40:27,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:27,944 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:27,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash -858602802, now seen corresponding path program 20 times [2022-04-15 06:40:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:27,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [158526725] [2022-04-15 06:40:28,122 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:28,123 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:28,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1719415825, now seen corresponding path program 1 times [2022-04-15 06:40:28,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:28,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965077865] [2022-04-15 06:40:28,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:28,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:28,133 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:28,150 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:28,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:28,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {8349#(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(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-15 06:40:28,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-15 06:40:28,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {8328#true} call ULTIMATE.init(); {8349#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:28,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {8349#(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(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {8328#true} call #t~ret11 := main(); {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {8328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_438 4294967296)) (.cse0 (= v_main_~x~0_438 v_main_~x~0_437)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_340 v_main_~y~0_339)) (and (= v_main_~x~0_437 (+ v_main_~x~0_438 v_main_~y~0_340 (* (- 1) v_main_~y~0_339))) (< 0 .cse3) (< v_main_~y~0_340 v_main_~y~0_339) (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~y~0_340 v_it_23 1) v_main_~y~0_339)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_438 (* 4294967295 v_it_23)) 4294967296))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_339 v_main_~y~0_340) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_438, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_339, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_437, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8328#true} is VALID [2022-04-15 06:40:28,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8328#true} is VALID [2022-04-15 06:40:28,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {8328#true} ~z~0 := ~y~0; {8333#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:40:28,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {8333#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8334#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:40:28,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {8334#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:40:28,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {8335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:40:28,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {8336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:40:28,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {8337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8338#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:28,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {8338#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:40:28,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:28,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:40:28,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:28,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:28,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8329#false} is VALID [2022-04-15 06:40:28,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {8329#false} assume !(~y~0 % 4294967296 > 0); {8329#false} is VALID [2022-04-15 06:40:28,431 INFO L272 TraceCheckUtils]: 26: Hoare triple {8329#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8329#false} is VALID [2022-04-15 06:40:28,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {8329#false} ~cond := #in~cond; {8329#false} is VALID [2022-04-15 06:40:28,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {8329#false} assume 0 == ~cond; {8329#false} is VALID [2022-04-15 06:40:28,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {8329#false} assume !false; {8329#false} is VALID [2022-04-15 06:40:28,431 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:28,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965077865] [2022-04-15 06:40:28,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965077865] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:28,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229977360] [2022-04-15 06:40:28,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:28,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:28,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:28,440 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:40:28,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 06:40:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:28,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 06:40:28,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:28,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:28,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {8328#true} call ULTIMATE.init(); {8328#true} is VALID [2022-04-15 06:40:28,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#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(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {8328#true} call #t~ret11 := main(); {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {8328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_438 4294967296)) (.cse0 (= v_main_~x~0_438 v_main_~x~0_437)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_340 v_main_~y~0_339)) (and (= v_main_~x~0_437 (+ v_main_~x~0_438 v_main_~y~0_340 (* (- 1) v_main_~y~0_339))) (< 0 .cse3) (< v_main_~y~0_340 v_main_~y~0_339) (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~y~0_340 v_it_23 1) v_main_~y~0_339)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_438 (* 4294967295 v_it_23)) 4294967296))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_339 v_main_~y~0_340) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_438, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_339, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_437, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8328#true} is VALID [2022-04-15 06:40:28,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {8328#true} ~z~0 := ~y~0; {8333#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:40:28,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {8333#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8334#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:40:28,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {8334#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:40:28,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {8335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:40:28,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {8336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:40:28,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {8337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8338#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:28,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {8338#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:40:28,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {8339#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:28,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {8340#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:40:28,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:28,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:28,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:28,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8329#false} is VALID [2022-04-15 06:40:28,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {8329#false} assume !(~y~0 % 4294967296 > 0); {8329#false} is VALID [2022-04-15 06:40:28,836 INFO L272 TraceCheckUtils]: 26: Hoare triple {8329#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8329#false} is VALID [2022-04-15 06:40:28,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {8329#false} ~cond := #in~cond; {8329#false} is VALID [2022-04-15 06:40:28,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {8329#false} assume 0 == ~cond; {8329#false} is VALID [2022-04-15 06:40:28,836 INFO L290 TraceCheckUtils]: 29: Hoare triple {8329#false} assume !false; {8329#false} is VALID [2022-04-15 06:40:28,836 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:28,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:29,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {8329#false} assume !false; {8329#false} is VALID [2022-04-15 06:40:29,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {8329#false} assume 0 == ~cond; {8329#false} is VALID [2022-04-15 06:40:29,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {8329#false} ~cond := #in~cond; {8329#false} is VALID [2022-04-15 06:40:29,375 INFO L272 TraceCheckUtils]: 26: Hoare triple {8329#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8329#false} is VALID [2022-04-15 06:40:29,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {8329#false} assume !(~y~0 % 4294967296 > 0); {8329#false} is VALID [2022-04-15 06:40:29,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8329#false} is VALID [2022-04-15 06:40:29,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8348#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:29,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8347#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:40:29,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8346#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:29,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8345#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:29,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8344#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:29,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8343#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:29,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8342#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:40:29,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {8479#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8341#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:29,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {8483#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8479#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {8487#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8483#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {8491#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8487#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {8495#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8491#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {8499#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8495#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {8503#(or (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8499#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {8507#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8503#(or (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:40:29,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {8328#true} ~z~0 := ~y~0; {8507#(or (< 0 (mod (+ main_~z~0 4294967289) 4294967296)) (<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:29,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {8328#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {8328#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_438 4294967296)) (.cse0 (= v_main_~x~0_438 v_main_~x~0_437)) (.cse1 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse2 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_340 v_main_~y~0_339)) (and (= v_main_~x~0_437 (+ v_main_~x~0_438 v_main_~y~0_340 (* (- 1) v_main_~y~0_339))) (< 0 .cse3) (< v_main_~y~0_340 v_main_~y~0_339) (forall ((v_it_23 Int)) (or (not (<= (+ v_main_~y~0_340 v_it_23 1) v_main_~y~0_339)) (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_438 (* 4294967295 v_it_23)) 4294967296))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_339 v_main_~y~0_340) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_340, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_438, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_339, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_437, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {8328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {8328#true} call #t~ret11 := main(); {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8328#true} {8328#true} #61#return; {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {8328#true} assume true; {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {8328#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(10, 2);call #Ultimate.allocInit(12, 3); {8328#true} is VALID [2022-04-15 06:40:29,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {8328#true} call ULTIMATE.init(); {8328#true} is VALID [2022-04-15 06:40:29,395 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:29,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229977360] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:29,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:29,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 06:40:30,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:30,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [158526725] [2022-04-15 06:40:30,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [158526725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:30,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:30,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:40:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123729629] [2022-04-15 06:40:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:30,603 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 06:40:30,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:30,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:30,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:30,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:40:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:30,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:40:30,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:40:30,658 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:38,486 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2022-04-15 06:40:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:40:38,486 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 06:40:38,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-15 06:40:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-15 06:40:38,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 61 transitions. [2022-04-15 06:40:38,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:38,715 INFO L225 Difference]: With dead ends: 69 [2022-04-15 06:40:38,715 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 06:40:38,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=477, Invalid=3813, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:40:38,716 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:38,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 108 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 06:40:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 06:40:38,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 06:40:38,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:38,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,875 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,876 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:38,876 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 06:40:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 06:40:38,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:38,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:38,876 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:40:38,877 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 06:40:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:38,877 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2022-04-15 06:40:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 06:40:38,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:38,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:38,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:38,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-04-15 06:40:38,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2022-04-15 06:40:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:38,878 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-04-15 06:40:38,878 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 25 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 40 transitions. [2022-04-15 06:40:54,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 33 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-04-15 06:40:54,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:40:54,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:54,231 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:54,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 06:40:54,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 06:40:54,432 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:54,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:54,433 INFO L85 PathProgramCache]: Analyzing trace with hash 843169312, now seen corresponding path program 21 times [2022-04-15 06:40:54,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:54,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [108863628] [2022-04-15 06:40:57,914 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:40:58,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:58,014 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:58,016 INFO L85 PathProgramCache]: Analyzing trace with hash -855745824, now seen corresponding path program 1 times [2022-04-15 06:40:58,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:58,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655272473] [2022-04-15 06:40:58,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:58,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:58,024 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:58,054 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:58,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {8922#(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(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-15 06:40:58,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-15 06:40:58,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-15 06:40:58,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {8901#true} call ULTIMATE.init(); {8922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:58,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {8922#(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(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {8901#true} call #t~ret11 := main(); {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {8901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {8901#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_467 4294967296)) (.cse1 (= v_main_~x~0_467 v_main_~x~0_466)) (.cse2 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse3 (= |v_main_#t~post6_114| |v_main_#t~post6_113|))) (or (and (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_370 v_it_24 1) v_main_~y~0_369)) (< 0 (mod (+ v_main_~x~0_467 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_466 (+ v_main_~x~0_467 (* (- 1) v_main_~y~0_369) v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369) (< 0 .cse0)) (and (<= .cse0 0) .cse1 (= v_main_~y~0_369 v_main_~y~0_370) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= v_main_~y~0_370 v_main_~y~0_369)))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_467, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_466, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8901#true} is VALID [2022-04-15 06:40:58,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#true} ~z~0 := ~y~0; {8906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:40:58,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {8906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:40:58,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {8907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:40:58,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {8908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:40:58,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {8909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:40:58,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {8910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8911#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:58,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {8911#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:40:58,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:58,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:58,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:58,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:40:58,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:40:58,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:40:58,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:40:58,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:40:58,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:40:58,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:40:58,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8902#false} is VALID [2022-04-15 06:40:58,357 INFO L272 TraceCheckUtils]: 26: Hoare triple {8902#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8902#false} is VALID [2022-04-15 06:40:58,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {8902#false} ~cond := #in~cond; {8902#false} is VALID [2022-04-15 06:40:58,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#false} assume 0 == ~cond; {8902#false} is VALID [2022-04-15 06:40:58,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#false} assume !false; {8902#false} is VALID [2022-04-15 06:40:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655272473] [2022-04-15 06:40:58,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655272473] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:58,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614964023] [2022-04-15 06:40:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:58,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:58,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:58,358 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:40:58,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 06:40:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:58,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:40:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:58,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:58,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {8901#true} call ULTIMATE.init(); {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {8901#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(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {8901#true} call #t~ret11 := main(); {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {8901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {8901#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_467 4294967296)) (.cse1 (= v_main_~x~0_467 v_main_~x~0_466)) (.cse2 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse3 (= |v_main_#t~post6_114| |v_main_#t~post6_113|))) (or (and (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_370 v_it_24 1) v_main_~y~0_369)) (< 0 (mod (+ v_main_~x~0_467 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_466 (+ v_main_~x~0_467 (* (- 1) v_main_~y~0_369) v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369) (< 0 .cse0)) (and (<= .cse0 0) .cse1 (= v_main_~y~0_369 v_main_~y~0_370) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= v_main_~y~0_370 v_main_~y~0_369)))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_467, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_466, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8901#true} is VALID [2022-04-15 06:40:58,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#true} ~z~0 := ~y~0; {8906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:40:58,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {8906#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:40:58,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {8907#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:40:58,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {8908#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:40:58,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {8909#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:40:58,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {8910#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8911#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:58,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {8911#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:40:58,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {8912#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:40:58,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {8913#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:58,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:58,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:40:58,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:40:58,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:40:58,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:40:58,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:40:58,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:40:58,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:40:58,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8902#false} is VALID [2022-04-15 06:40:58,800 INFO L272 TraceCheckUtils]: 26: Hoare triple {8902#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8902#false} is VALID [2022-04-15 06:40:58,800 INFO L290 TraceCheckUtils]: 27: Hoare triple {8902#false} ~cond := #in~cond; {8902#false} is VALID [2022-04-15 06:40:58,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#false} assume 0 == ~cond; {8902#false} is VALID [2022-04-15 06:40:58,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#false} assume !false; {8902#false} is VALID [2022-04-15 06:40:58,801 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:58,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:59,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {8902#false} assume !false; {8902#false} is VALID [2022-04-15 06:40:59,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {8902#false} assume 0 == ~cond; {8902#false} is VALID [2022-04-15 06:40:59,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {8902#false} ~cond := #in~cond; {8902#false} is VALID [2022-04-15 06:40:59,373 INFO L272 TraceCheckUtils]: 26: Hoare triple {8902#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8902#false} is VALID [2022-04-15 06:40:59,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8902#false} is VALID [2022-04-15 06:40:59,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8921#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:40:59,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8920#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:40:59,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8919#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:40:59,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8918#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:40:59,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8917#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:40:59,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8916#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:40:59,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {8915#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:40:59,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:59,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {9052#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8914#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:59,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {9056#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9052#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:40:59,384 INFO L290 TraceCheckUtils]: 14: Hoare triple {9060#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9056#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:40:59,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {9064#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9060#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:40:59,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {9068#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9064#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 06:40:59,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {9072#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9068#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:40:59,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {9076#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9072#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:40:59,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {9080#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9076#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:40:59,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {8901#true} ~z~0 := ~y~0; {9080#(or (<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 06:40:59,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {8901#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8901#true} is VALID [2022-04-15 06:40:59,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {8901#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_467 4294967296)) (.cse1 (= v_main_~x~0_467 v_main_~x~0_466)) (.cse2 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse3 (= |v_main_#t~post6_114| |v_main_#t~post6_113|))) (or (and (forall ((v_it_24 Int)) (or (not (<= (+ v_main_~y~0_370 v_it_24 1) v_main_~y~0_369)) (< 0 (mod (+ v_main_~x~0_467 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)))) (= v_main_~x~0_466 (+ v_main_~x~0_467 (* (- 1) v_main_~y~0_369) v_main_~y~0_370)) (< v_main_~y~0_370 v_main_~y~0_369) (< 0 .cse0)) (and (<= .cse0 0) .cse1 (= v_main_~y~0_369 v_main_~y~0_370) .cse2 .cse3) (and .cse1 .cse2 .cse3 (= v_main_~y~0_370 v_main_~y~0_369)))) InVars {main_~y~0=v_main_~y~0_370, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_467, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_369, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_466, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8901#true} is VALID [2022-04-15 06:40:59,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {8901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8901#true} is VALID [2022-04-15 06:40:59,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {8901#true} call #t~ret11 := main(); {8901#true} is VALID [2022-04-15 06:40:59,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8901#true} {8901#true} #61#return; {8901#true} is VALID [2022-04-15 06:40:59,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {8901#true} assume true; {8901#true} is VALID [2022-04-15 06:40:59,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {8901#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(10, 2);call #Ultimate.allocInit(12, 3); {8901#true} is VALID [2022-04-15 06:40:59,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {8901#true} call ULTIMATE.init(); {8901#true} is VALID [2022-04-15 06:40:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614964023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:59,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 27 [2022-04-15 06:41:01,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:01,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [108863628] [2022-04-15 06:41:01,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [108863628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:01,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:01,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:41:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205587669] [2022-04-15 06:41:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:01,004 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:41:01,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:01,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:01,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:01,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:41:01,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:41:01,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1079, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 06:41:01,339 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:17,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:17,432 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 06:41:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:41:17,432 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 06:41:17,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-04-15 06:41:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:17,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2022-04-15 06:41:17,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 46 transitions. [2022-04-15 06:41:18,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:18,437 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:41:18,437 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:41:18,438 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=491, Invalid=3049, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:41:18,439 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:18,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-04-15 06:41:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:41:18,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:41:18,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:18,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,589 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,589 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:18,590 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 06:41:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 06:41:18,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:18,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:18,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 06:41:18,590 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 06:41:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:18,590 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 06:41:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 06:41:18,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:18,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:18,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:18,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 06:41:18,591 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 37 [2022-04-15 06:41:18,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:18,591 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 06:41:18,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 26 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:18,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 06:41:33,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 34 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 06:41:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:41:33,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:33,739 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:33,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 06:41:33,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:41:33,946 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:33,946 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 22 times [2022-04-15 06:41:33,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:33,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1959168377] [2022-04-15 06:41:34,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:41:34,146 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash -717286579, now seen corresponding path program 1 times [2022-04-15 06:41:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:34,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791275153] [2022-04-15 06:41:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:34,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:34,158 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:34,184 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:34,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:34,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {9430#(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(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-15 06:41:34,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-15 06:41:34,369 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-15 06:41:34,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:34,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {9430#(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(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-15 06:41:34,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-15 06:41:34,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-15 06:41:34,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret11 := main(); {9414#true} is VALID [2022-04-15 06:41:34,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9414#true} is VALID [2022-04-15 06:41:34,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {9414#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_398 v_main_~y~0_397)) (.cse1 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse3 (= v_main_~x~0_496 v_main_~x~0_495)) (.cse2 (mod v_main_~x~0_496 4294967296))) (or (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) .cse0 .cse1 (<= .cse2 0) .cse3) (and .cse0 .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_118|) .cse3) (and (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_496 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_398 v_it_25 1) v_main_~y~0_397)) (not (<= 1 v_it_25)))) (< 0 .cse2) (< v_main_~y~0_398 v_main_~y~0_397) (= v_main_~x~0_495 (+ v_main_~x~0_496 v_main_~y~0_398 (* (- 1) v_main_~y~0_397)))))) InVars {main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_495, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9414#true} is VALID [2022-04-15 06:41:34,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:34,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:41:34,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:41:34,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:34,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,386 INFO L272 TraceCheckUtils]: 27: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:41:34,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {9428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:41:34,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {9429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9415#false} is VALID [2022-04-15 06:41:34,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2022-04-15 06:41:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791275153] [2022-04-15 06:41:34,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791275153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019433824] [2022-04-15 06:41:34,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:34,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:34,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:34,397 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:41:34,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 06:41:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:34,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:41:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:34,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:34,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9414#true} is VALID [2022-04-15 06:41:34,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#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(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-15 06:41:34,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-15 06:41:34,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-15 06:41:34,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret11 := main(); {9414#true} is VALID [2022-04-15 06:41:34,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9414#true} is VALID [2022-04-15 06:41:34,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {9414#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_398 v_main_~y~0_397)) (.cse1 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse3 (= v_main_~x~0_496 v_main_~x~0_495)) (.cse2 (mod v_main_~x~0_496 4294967296))) (or (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) .cse0 .cse1 (<= .cse2 0) .cse3) (and .cse0 .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_118|) .cse3) (and (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_496 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_398 v_it_25 1) v_main_~y~0_397)) (not (<= 1 v_it_25)))) (< 0 .cse2) (< v_main_~y~0_398 v_main_~y~0_397) (= v_main_~x~0_495 (+ v_main_~x~0_496 v_main_~y~0_398 (* (- 1) v_main_~y~0_397)))))) InVars {main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_495, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9414#true} is VALID [2022-04-15 06:41:34,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:34,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:41:34,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:41:34,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:34,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:34,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:34,723 INFO L272 TraceCheckUtils]: 27: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:41:34,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:41:34,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {9519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9415#false} is VALID [2022-04-15 06:41:34,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2022-04-15 06:41:34,724 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:34,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:35,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {9415#false} assume !false; {9415#false} is VALID [2022-04-15 06:41:35,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {9519#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9415#false} is VALID [2022-04-15 06:41:35,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9519#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:41:35,012 INFO L272 TraceCheckUtils]: 27: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9515#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:41:35,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:35,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:35,014 INFO L290 TraceCheckUtils]: 24: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:35,015 INFO L290 TraceCheckUtils]: 23: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:41:35,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9427#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9426#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9425#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9424#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:41:35,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9423#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9422#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9421#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:35,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9420#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:35,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:35,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {9414#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9419#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:35,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {9414#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_398 v_main_~y~0_397)) (.cse1 (= |v_main_#t~post5_119| |v_main_#t~post5_118|)) (.cse3 (= v_main_~x~0_496 v_main_~x~0_495)) (.cse2 (mod v_main_~x~0_496 4294967296))) (or (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) .cse0 .cse1 (<= .cse2 0) .cse3) (and .cse0 .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_118|) .cse3) (and (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_496 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_398 v_it_25 1) v_main_~y~0_397)) (not (<= 1 v_it_25)))) (< 0 .cse2) (< v_main_~y~0_398 v_main_~y~0_397) (= v_main_~x~0_495 (+ v_main_~x~0_496 v_main_~y~0_398 (* (- 1) v_main_~y~0_397)))))) InVars {main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_495, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9414#true} is VALID [2022-04-15 06:41:35,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {9414#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9414#true} is VALID [2022-04-15 06:41:35,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {9414#true} call #t~ret11 := main(); {9414#true} is VALID [2022-04-15 06:41:35,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9414#true} {9414#true} #61#return; {9414#true} is VALID [2022-04-15 06:41:35,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {9414#true} assume true; {9414#true} is VALID [2022-04-15 06:41:35,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {9414#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(10, 2);call #Ultimate.allocInit(12, 3); {9414#true} is VALID [2022-04-15 06:41:35,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {9414#true} call ULTIMATE.init(); {9414#true} is VALID [2022-04-15 06:41:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:35,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019433824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:35,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:35,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2022-04-15 06:41:36,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:36,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1959168377] [2022-04-15 06:41:36,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1959168377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:36,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:36,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:41:36,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286385094] [2022-04-15 06:41:36,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:36,260 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:41:36,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:36,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:36,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:36,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:41:36,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:36,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:41:36,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:41:36,328 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:41,007 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-04-15 06:41:41,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 06:41:41,007 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 06:41:41,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-15 06:41:41,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-15 06:41:41,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2022-04-15 06:41:41,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:41,186 INFO L225 Difference]: With dead ends: 70 [2022-04-15 06:41:41,186 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 06:41:41,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:41:41,187 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:41,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 35 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:41:41,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 06:41:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2022-04-15 06:41:41,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:41,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,360 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,360 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:41,361 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 06:41:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 06:41:41,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:41,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:41,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:41:41,361 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 06:41:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:41,362 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 06:41:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-15 06:41:41,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:41,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:41,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:41,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2022-04-15 06:41:41,363 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 38 [2022-04-15 06:41:41,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:41,363 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2022-04-15 06:41:41,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 20 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:41:41,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 44 transitions. [2022-04-15 06:41:58,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 36 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2022-04-15 06:41:58,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:41:58,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:58,995 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:59,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 06:41:59,195 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:41:59,195 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:59,195 INFO L85 PathProgramCache]: Analyzing trace with hash -359267392, now seen corresponding path program 23 times [2022-04-15 06:41:59,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:59,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [431731255] [2022-04-15 06:41:59,601 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:41:59,603 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:59,605 INFO L85 PathProgramCache]: Analyzing trace with hash -523964160, now seen corresponding path program 1 times [2022-04-15 06:41:59,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:59,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542235427] [2022-04-15 06:41:59,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:59,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:59,615 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:59,636 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:59,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:59,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {10039#(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(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-15 06:41:59,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-15 06:41:59,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {10016#true} call ULTIMATE.init(); {10039#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:59,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {10039#(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(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {10016#true} call #t~ret11 := main(); {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {10016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {10016#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_542 v_main_~x~0_541)) (.cse1 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse2 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (mod v_main_~x~0_542 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_420 v_main_~y~0_419)) (and .cse0 .cse1 .cse2 (<= .cse3 0) (= v_main_~y~0_419 v_main_~y~0_420)) (and (= v_main_~y~0_419 (+ v_main_~x~0_542 v_main_~y~0_420 (* v_main_~x~0_541 (- 1)))) (< v_main_~x~0_541 v_main_~x~0_542) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_541 v_it_26 1) v_main_~x~0_542)) (< 0 (mod (+ v_main_~x~0_542 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26)))) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_542, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_419, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_541, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10016#true} is VALID [2022-04-15 06:41:59,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {10016#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10016#true} is VALID [2022-04-15 06:41:59,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {10016#true} ~z~0 := ~y~0; {10021#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:59,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {10021#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10022#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:59,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {10022#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10023#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:41:59,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {10023#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10024#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:41:59,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10025#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:41:59,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {10025#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10026#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:41:59,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {10026#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:41:59,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:41:59,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:41:59,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:41:59,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:59,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:41:59,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:59,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:59,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:59,978 INFO L290 TraceCheckUtils]: 23: Hoare triple {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:59,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:59,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:59,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10017#false} is VALID [2022-04-15 06:41:59,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {10017#false} assume !(~y~0 % 4294967296 > 0); {10017#false} is VALID [2022-04-15 06:41:59,980 INFO L272 TraceCheckUtils]: 28: Hoare triple {10017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10017#false} is VALID [2022-04-15 06:41:59,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {10017#false} ~cond := #in~cond; {10017#false} is VALID [2022-04-15 06:41:59,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {10017#false} assume 0 == ~cond; {10017#false} is VALID [2022-04-15 06:41:59,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-04-15 06:41:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542235427] [2022-04-15 06:41:59,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542235427] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944999768] [2022-04-15 06:41:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:59,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:59,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:59,982 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:41:59,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 06:42:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:00,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 06:42:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:00,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:00,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {10016#true} call ULTIMATE.init(); {10016#true} is VALID [2022-04-15 06:42:00,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#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(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-15 06:42:00,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-15 06:42:00,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-15 06:42:00,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {10016#true} call #t~ret11 := main(); {10016#true} is VALID [2022-04-15 06:42:00,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {10016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10016#true} is VALID [2022-04-15 06:42:00,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {10016#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_542 v_main_~x~0_541)) (.cse1 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse2 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (mod v_main_~x~0_542 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_420 v_main_~y~0_419)) (and .cse0 .cse1 .cse2 (<= .cse3 0) (= v_main_~y~0_419 v_main_~y~0_420)) (and (= v_main_~y~0_419 (+ v_main_~x~0_542 v_main_~y~0_420 (* v_main_~x~0_541 (- 1)))) (< v_main_~x~0_541 v_main_~x~0_542) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_541 v_it_26 1) v_main_~x~0_542)) (< 0 (mod (+ v_main_~x~0_542 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26)))) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_542, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_419, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_541, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10016#true} is VALID [2022-04-15 06:42:00,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {10016#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10016#true} is VALID [2022-04-15 06:42:00,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {10016#true} ~z~0 := ~y~0; {10021#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:42:00,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {10021#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10022#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:00,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {10022#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10023#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:00,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {10023#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10024#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:00,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {10024#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10025#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:42:00,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {10025#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10026#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:42:00,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {10026#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:42:00,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {10027#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:42:00,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {10028#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:42:00,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {10029#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:42:00,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:00,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:42:00,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:00,425 INFO L290 TraceCheckUtils]: 21: Hoare triple {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:00,425 INFO L290 TraceCheckUtils]: 22: Hoare triple {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:00,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:00,427 INFO L290 TraceCheckUtils]: 24: Hoare triple {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:00,428 INFO L290 TraceCheckUtils]: 25: Hoare triple {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:00,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10017#false} is VALID [2022-04-15 06:42:00,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {10017#false} assume !(~y~0 % 4294967296 > 0); {10017#false} is VALID [2022-04-15 06:42:00,429 INFO L272 TraceCheckUtils]: 28: Hoare triple {10017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10017#false} is VALID [2022-04-15 06:42:00,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {10017#false} ~cond := #in~cond; {10017#false} is VALID [2022-04-15 06:42:00,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {10017#false} assume 0 == ~cond; {10017#false} is VALID [2022-04-15 06:42:00,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-04-15 06:42:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:00,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:01,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {10017#false} assume !false; {10017#false} is VALID [2022-04-15 06:42:01,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {10017#false} assume 0 == ~cond; {10017#false} is VALID [2022-04-15 06:42:01,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {10017#false} ~cond := #in~cond; {10017#false} is VALID [2022-04-15 06:42:01,063 INFO L272 TraceCheckUtils]: 28: Hoare triple {10017#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10017#false} is VALID [2022-04-15 06:42:01,063 INFO L290 TraceCheckUtils]: 27: Hoare triple {10017#false} assume !(~y~0 % 4294967296 > 0); {10017#false} is VALID [2022-04-15 06:42:01,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10017#false} is VALID [2022-04-15 06:42:01,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10038#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:01,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10037#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:01,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10036#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:01,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10035#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:01,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10034#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:01,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10033#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:01,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10032#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:42:01,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10031#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:01,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {10178#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !(~z~0 % 4294967296 > 0); {10030#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:42:01,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {10182#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10178#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 06:42:01,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {10186#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10182#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:01,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {10190#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10186#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 06:42:01,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {10194#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10190#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:42:01,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {10198#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10194#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 06:42:01,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {10202#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10198#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)))} is VALID [2022-04-15 06:42:01,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {10206#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10202#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:42:01,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {10210#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10206#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:42:01,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {10016#true} ~z~0 := ~y~0; {10210#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:42:01,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {10016#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {10016#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_542 v_main_~x~0_541)) (.cse1 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse2 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (mod v_main_~x~0_542 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_420 v_main_~y~0_419)) (and .cse0 .cse1 .cse2 (<= .cse3 0) (= v_main_~y~0_419 v_main_~y~0_420)) (and (= v_main_~y~0_419 (+ v_main_~x~0_542 v_main_~y~0_420 (* v_main_~x~0_541 (- 1)))) (< v_main_~x~0_541 v_main_~x~0_542) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_541 v_it_26 1) v_main_~x~0_542)) (< 0 (mod (+ v_main_~x~0_542 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26)))) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_542, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_419, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_541, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {10016#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {10016#true} call #t~ret11 := main(); {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10016#true} {10016#true} #61#return; {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {10016#true} assume true; {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {10016#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(10, 2);call #Ultimate.allocInit(12, 3); {10016#true} is VALID [2022-04-15 06:42:01,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {10016#true} call ULTIMATE.init(); {10016#true} is VALID [2022-04-15 06:42:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:01,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944999768] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:01,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:01,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 30 [2022-04-15 06:42:03,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:03,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [431731255] [2022-04-15 06:42:03,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [431731255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:03,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:03,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:42:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367679245] [2022-04-15 06:42:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:03,248 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:42:03,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:03,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:03,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:03,357 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:42:03,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:03,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:42:03,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1287, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:42:03,358 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:17,404 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-04-15 06:42:17,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 06:42:17,404 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 06:42:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:17,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2022-04-15 06:42:17,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2022-04-15 06:42:17,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 65 transitions. [2022-04-15 06:42:18,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:18,923 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:42:18,923 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:42:18,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=572, Invalid=4830, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:42:18,924 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:18,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 123 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 06:42:18,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:42:19,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 06:42:19,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:19,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:19,137 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:19,137 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:19,138 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 06:42:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 06:42:19,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:19,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:19,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:42:19,138 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:42:19,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:19,139 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 06:42:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 06:42:19,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:19,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:19,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:19,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 06:42:19,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 39 [2022-04-15 06:42:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:19,142 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 06:42:19,142 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:19,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 06:42:37,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 35 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 06:42:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:42:37,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:37,331 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:37,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 06:42:37,538 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:37,539 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:37,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:37,539 INFO L85 PathProgramCache]: Analyzing trace with hash -416379154, now seen corresponding path program 24 times [2022-04-15 06:42:37,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:37,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1885450372] [2022-04-15 06:42:38,156 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:42:38,158 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:38,160 INFO L85 PathProgramCache]: Analyzing trace with hash 676055215, now seen corresponding path program 1 times [2022-04-15 06:42:38,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:38,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070309592] [2022-04-15 06:42:38,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:38,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:38,169 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,200 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {10660#(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(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {10637#true} call ULTIMATE.init(); {10660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:38,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {10660#(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(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {10637#true} call #t~ret11 := main(); {10637#true} is VALID [2022-04-15 06:42:38,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {10637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10637#true} is VALID [2022-04-15 06:42:38,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {10637#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse3 (= v_main_~x~0_574 v_main_~x~0_573)) (.cse4 (mod v_main_~x~0_574 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~y~0_453 v_it_27 1) v_main_~y~0_452)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_574 (* 4294967295 v_it_27)) 4294967296)))) (< v_main_~y~0_453 v_main_~y~0_452) (= v_main_~x~0_573 (+ v_main_~x~0_574 v_main_~y~0_453 (* (- 1) v_main_~y~0_452))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_574, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_573, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10637#true} is VALID [2022-04-15 06:42:38,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {10637#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10637#true} is VALID [2022-04-15 06:42:38,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {10637#true} ~z~0 := ~y~0; {10642#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:38,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {10642#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:38,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {10643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:38,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {10644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:38,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {10645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:42:38,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {10646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:42:38,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {10647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:42:38,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:42:38,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:42:38,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:38,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:38,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:38,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:42:38,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:42:38,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:42:38,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:42:38,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:38,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:38,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:38,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10638#false} is VALID [2022-04-15 06:42:38,566 INFO L272 TraceCheckUtils]: 28: Hoare triple {10638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10638#false} is VALID [2022-04-15 06:42:38,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#false} ~cond := #in~cond; {10638#false} is VALID [2022-04-15 06:42:38,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {10638#false} assume 0 == ~cond; {10638#false} is VALID [2022-04-15 06:42:38,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {10638#false} assume !false; {10638#false} is VALID [2022-04-15 06:42:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:38,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070309592] [2022-04-15 06:42:38,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070309592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:38,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679283146] [2022-04-15 06:42:38,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:38,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:38,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:38,568 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:42:38,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:42:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:42:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:38,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:39,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {10637#true} call ULTIMATE.init(); {10637#true} is VALID [2022-04-15 06:42:39,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#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(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-15 06:42:39,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-15 06:42:39,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-15 06:42:39,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {10637#true} call #t~ret11 := main(); {10637#true} is VALID [2022-04-15 06:42:39,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {10637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10637#true} is VALID [2022-04-15 06:42:39,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {10637#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse3 (= v_main_~x~0_574 v_main_~x~0_573)) (.cse4 (mod v_main_~x~0_574 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~y~0_453 v_it_27 1) v_main_~y~0_452)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_574 (* 4294967295 v_it_27)) 4294967296)))) (< v_main_~y~0_453 v_main_~y~0_452) (= v_main_~x~0_573 (+ v_main_~x~0_574 v_main_~y~0_453 (* (- 1) v_main_~y~0_452))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_574, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_573, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10637#true} is VALID [2022-04-15 06:42:39,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {10637#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10637#true} is VALID [2022-04-15 06:42:39,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {10637#true} ~z~0 := ~y~0; {10642#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:39,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {10642#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:39,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {10643#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:39,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {10644#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:39,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {10645#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:42:39,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {10646#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:42:39,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {10647#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:42:39,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {10648#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:42:39,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {10649#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:42:39,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {10650#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:39,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:39,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:39,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:42:39,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:42:39,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:42:39,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:42:39,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:39,033 INFO L290 TraceCheckUtils]: 25: Hoare triple {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:39,033 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:39,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10638#false} is VALID [2022-04-15 06:42:39,034 INFO L272 TraceCheckUtils]: 28: Hoare triple {10638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10638#false} is VALID [2022-04-15 06:42:39,034 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#false} ~cond := #in~cond; {10638#false} is VALID [2022-04-15 06:42:39,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {10638#false} assume 0 == ~cond; {10638#false} is VALID [2022-04-15 06:42:39,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {10638#false} assume !false; {10638#false} is VALID [2022-04-15 06:42:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:39,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:39,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {10638#false} assume !false; {10638#false} is VALID [2022-04-15 06:42:39,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {10638#false} assume 0 == ~cond; {10638#false} is VALID [2022-04-15 06:42:39,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {10638#false} ~cond := #in~cond; {10638#false} is VALID [2022-04-15 06:42:39,708 INFO L272 TraceCheckUtils]: 28: Hoare triple {10638#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10638#false} is VALID [2022-04-15 06:42:39,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10638#false} is VALID [2022-04-15 06:42:39,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10659#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:39,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10658#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:39,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10657#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:39,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10656#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:42:39,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10655#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:42:39,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10654#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:42:39,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:42:39,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {10652#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:39,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:39,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {10799#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10651#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:39,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {10803#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10799#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:42:39,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {10807#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10803#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:39,721 INFO L290 TraceCheckUtils]: 14: Hoare triple {10811#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10807#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:42:39,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {10815#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10811#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:39,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {10819#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10815#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:39,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {10823#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10819#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:39,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {10827#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10823#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:39,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {10831#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10827#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 06:42:39,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {10637#true} ~z~0 := ~y~0; {10831#(or (<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:39,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {10637#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {10637#true} is VALID [2022-04-15 06:42:39,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {10637#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_453 v_main_~y~0_452)) (.cse3 (= v_main_~x~0_574 v_main_~x~0_573)) (.cse4 (mod v_main_~x~0_574 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~y~0_453 v_it_27 1) v_main_~y~0_452)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_574 (* 4294967295 v_it_27)) 4294967296)))) (< v_main_~y~0_453 v_main_~y~0_452) (= v_main_~x~0_573 (+ v_main_~x~0_574 v_main_~y~0_453 (* (- 1) v_main_~y~0_452))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_574, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_452, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_573, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10637#true} is VALID [2022-04-15 06:42:39,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {10637#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10637#true} is VALID [2022-04-15 06:42:39,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {10637#true} call #t~ret11 := main(); {10637#true} is VALID [2022-04-15 06:42:39,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10637#true} {10637#true} #61#return; {10637#true} is VALID [2022-04-15 06:42:39,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {10637#true} assume true; {10637#true} is VALID [2022-04-15 06:42:39,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#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(10, 2);call #Ultimate.allocInit(12, 3); {10637#true} is VALID [2022-04-15 06:42:39,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {10637#true} call ULTIMATE.init(); {10637#true} is VALID [2022-04-15 06:42:39,727 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:39,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679283146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:39,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:39,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 30 [2022-04-15 06:42:43,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:43,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1885450372] [2022-04-15 06:42:43,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1885450372] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:43,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:43,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:42:43,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536058971] [2022-04-15 06:42:43,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:43,055 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 06:42:43,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:43,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:42:43,155 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 06:42:43,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:42:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:42:43,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:42:43,156 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:12,924 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 06:43:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:43:12,924 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 06:43:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-04-15 06:43:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2022-04-15 06:43:12,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 49 transitions. [2022-04-15 06:43:14,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:14,765 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:43:14,765 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 06:43:14,766 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=596, Invalid=3826, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 06:43:14,766 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:14,767 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 116 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-04-15 06:43:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 06:43:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 06:43:14,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:14,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,952 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,952 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:14,952 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 06:43:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 06:43:14,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:14,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:14,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 06:43:14,953 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 06:43:14,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:14,953 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2022-04-15 06:43:14,953 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 06:43:14,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:14,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:14,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2022-04-15 06:43:14,954 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2022-04-15 06:43:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:14,954 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2022-04-15 06:43:14,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.2) internal successors, (36), 29 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:14,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 44 transitions. [2022-04-15 06:43:35,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 35 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:35,619 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2022-04-15 06:43:35,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:43:35,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:35,620 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:35,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:43:35,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:43:35,820 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:35,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 25 times [2022-04-15 06:43:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:35,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1918114003] [2022-04-15 06:43:35,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:43:35,978 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:35,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1502637918, now seen corresponding path program 1 times [2022-04-15 06:43:35,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:35,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346293083] [2022-04-15 06:43:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:35,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:35,989 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,004 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:43:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,231 INFO L290 TraceCheckUtils]: 0: Hoare triple {11207#(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(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-15 06:43:36,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-15 06:43:36,232 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-15 06:43:36,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {11190#true} call ULTIMATE.init(); {11207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:36,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {11207#(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(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-15 06:43:36,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-15 06:43:36,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-15 06:43:36,232 INFO L272 TraceCheckUtils]: 4: Hoare triple {11190#true} call #t~ret11 := main(); {11190#true} is VALID [2022-04-15 06:43:36,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {11190#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11190#true} is VALID [2022-04-15 06:43:36,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {11190#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse0 (mod v_main_~x~0_606 4294967296)) (.cse3 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse4 (= v_main_~x~0_606 v_main_~x~0_605))) (or (and (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_606 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_605 v_it_28 1) v_main_~x~0_606)) (not (<= 1 v_it_28)))) (< v_main_~x~0_605 v_main_~x~0_606) (= v_main_~y~0_483 (+ v_main_~x~0_606 v_main_~y~0_484 (* v_main_~x~0_605 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_606, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_483, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_605, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11190#true} is VALID [2022-04-15 06:43:36,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {11190#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,234 INFO L290 TraceCheckUtils]: 9: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:36,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:36,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,239 INFO L290 TraceCheckUtils]: 15: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:43:36,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:43:36,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:36,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,247 INFO L290 TraceCheckUtils]: 25: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,247 INFO L290 TraceCheckUtils]: 26: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:36,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,249 INFO L272 TraceCheckUtils]: 29: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11205#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:43:36,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {11205#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11206#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:43:36,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {11206#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11191#false} is VALID [2022-04-15 06:43:36,250 INFO L290 TraceCheckUtils]: 32: Hoare triple {11191#false} assume !false; {11191#false} is VALID [2022-04-15 06:43:36,250 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:36,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:36,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346293083] [2022-04-15 06:43:36,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346293083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:36,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376242425] [2022-04-15 06:43:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:36,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:36,251 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:43:36,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:43:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:43:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:36,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:36,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {11190#true} call ULTIMATE.init(); {11190#true} is VALID [2022-04-15 06:43:36,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {11190#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(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-15 06:43:36,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-15 06:43:36,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-15 06:43:36,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {11190#true} call #t~ret11 := main(); {11190#true} is VALID [2022-04-15 06:43:36,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {11190#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11190#true} is VALID [2022-04-15 06:43:36,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {11190#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse0 (mod v_main_~x~0_606 4294967296)) (.cse3 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse4 (= v_main_~x~0_606 v_main_~x~0_605))) (or (and (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_606 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_605 v_it_28 1) v_main_~x~0_606)) (not (<= 1 v_it_28)))) (< v_main_~x~0_605 v_main_~x~0_606) (= v_main_~y~0_483 (+ v_main_~x~0_606 v_main_~y~0_484 (* v_main_~x~0_605 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_606, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_483, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_605, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11190#true} is VALID [2022-04-15 06:43:36,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {11190#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:36,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:36,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:43:36,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:43:36,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:36,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:36,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,578 INFO L272 TraceCheckUtils]: 29: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:43:36,578 INFO L290 TraceCheckUtils]: 30: Hoare triple {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:36,578 INFO L290 TraceCheckUtils]: 31: Hoare triple {11302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11191#false} is VALID [2022-04-15 06:43:36,578 INFO L290 TraceCheckUtils]: 32: Hoare triple {11191#false} assume !false; {11191#false} is VALID [2022-04-15 06:43:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:36,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:36,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {11191#false} assume !false; {11191#false} is VALID [2022-04-15 06:43:36,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {11302#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11191#false} is VALID [2022-04-15 06:43:36,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11302#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:43:36,867 INFO L272 TraceCheckUtils]: 29: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11298#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:43:36,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:36,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:36,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:43:36,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11204#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:43:36,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11203#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11202#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11201#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11200#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:36,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11199#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11198#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,881 INFO L290 TraceCheckUtils]: 10: Hoare triple {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11197#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:36,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11196#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:36,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {11190#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11195#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:36,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {11190#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= v_main_~y~0_484 v_main_~y~0_483)) (.cse0 (mod v_main_~x~0_606 4294967296)) (.cse3 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse4 (= v_main_~x~0_606 v_main_~x~0_605))) (or (and (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_606 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_605 v_it_28 1) v_main_~x~0_606)) (not (<= 1 v_it_28)))) (< v_main_~x~0_605 v_main_~x~0_606) (= v_main_~y~0_483 (+ v_main_~x~0_606 v_main_~y~0_484 (* v_main_~x~0_605 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_484, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_606, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_483, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_605, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {11190#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {11190#true} call #t~ret11 := main(); {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11190#true} {11190#true} #61#return; {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {11190#true} assume true; {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {11190#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(10, 2);call #Ultimate.allocInit(12, 3); {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {11190#true} call ULTIMATE.init(); {11190#true} is VALID [2022-04-15 06:43:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:36,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376242425] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:36,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:36,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 17 [2022-04-15 06:43:39,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:39,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1918114003] [2022-04-15 06:43:39,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1918114003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:39,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:39,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:43:39,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395891801] [2022-04-15 06:43:39,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:39,126 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 06:43:39,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:39,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:39,230 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 06:43:39,231 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:43:39,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:39,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:43:39,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:43:39,232 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:46,255 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2022-04-15 06:43:46,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:43:46,255 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 06:43:46,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-15 06:43:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2022-04-15 06:43:46,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 79 transitions. [2022-04-15 06:43:46,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:46,599 INFO L225 Difference]: With dead ends: 76 [2022-04-15 06:43:46,599 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:43:46,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=515, Invalid=1647, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:43:46,600 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:46,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 40 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 06:43:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:43:46,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 44. [2022-04-15 06:43:46,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:46,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,810 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,810 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:46,811 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-15 06:43:46,811 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-15 06:43:46,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:46,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:46,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:43:46,811 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:43:46,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:46,812 INFO L93 Difference]: Finished difference Result 71 states and 83 transitions. [2022-04-15 06:43:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2022-04-15 06:43:46,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:46,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:46,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:46,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 06:43:46,813 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 41 [2022-04-15 06:43:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:46,813 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 06:43:46,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 22 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:43:46,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 06:44:05,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 38 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:05,786 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 06:44:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:44:05,786 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:05,786 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:05,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:44:05,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:05,989 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:05,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:05,989 INFO L85 PathProgramCache]: Analyzing trace with hash 395434254, now seen corresponding path program 26 times [2022-04-15 06:44:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:05,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [356210897] [2022-04-15 06:44:06,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:44:06,155 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash 785385231, now seen corresponding path program 1 times [2022-04-15 06:44:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:06,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717352803] [2022-04-15 06:44:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:06,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:06,167 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:44:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:06,190 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:44:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:06,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {11865#(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(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 06:44:06,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 06:44:06,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:06,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {11865#(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(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret11 := main(); {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {11840#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_508 v_main_~y~0_507)) (.cse0 (mod v_main_~x~0_657 4294967296)) (.cse2 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse3 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse4 (= v_main_~x~0_657 v_main_~x~0_656))) (or (and (< v_main_~y~0_508 v_main_~y~0_507) (= v_main_~x~0_656 (+ v_main_~x~0_657 v_main_~y~0_508 (* (- 1) v_main_~y~0_507))) (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_508 v_it_29 1) v_main_~y~0_507)) (< 0 (mod (+ v_main_~x~0_657 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_508, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_507, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11840#true} is VALID [2022-04-15 06:44:06,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11840#true} is VALID [2022-04-15 06:44:06,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#true} ~z~0 := ~y~0; {11845#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:44:06,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {11845#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11846#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:06,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {11846#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11847#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:06,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {11847#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11848#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:06,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {11848#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11849#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:06,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {11849#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11850#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:44:06,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {11850#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:44:06,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:44:06,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:44:06,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 06:44:06,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:06,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:44:06,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:06,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:44:06,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:06,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:06,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:06,614 INFO L290 TraceCheckUtils]: 25: Hoare triple {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:06,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:06,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:06,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11841#false} is VALID [2022-04-15 06:44:06,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {11841#false} assume !(~y~0 % 4294967296 > 0); {11841#false} is VALID [2022-04-15 06:44:06,616 INFO L272 TraceCheckUtils]: 30: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-15 06:44:06,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-15 06:44:06,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-15 06:44:06,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-15 06:44:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:44:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717352803] [2022-04-15 06:44:06,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717352803] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:06,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934981331] [2022-04-15 06:44:06,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:06,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:06,618 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:44:06,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:44:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:06,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:44:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:06,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:07,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#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(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret11 := main(); {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {11840#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_508 v_main_~y~0_507)) (.cse0 (mod v_main_~x~0_657 4294967296)) (.cse2 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse3 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse4 (= v_main_~x~0_657 v_main_~x~0_656))) (or (and (< v_main_~y~0_508 v_main_~y~0_507) (= v_main_~x~0_656 (+ v_main_~x~0_657 v_main_~y~0_508 (* (- 1) v_main_~y~0_507))) (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_508 v_it_29 1) v_main_~y~0_507)) (< 0 (mod (+ v_main_~x~0_657 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_508, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_507, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11840#true} is VALID [2022-04-15 06:44:07,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#true} ~z~0 := ~y~0; {11845#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:44:07,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {11845#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11846#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:07,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {11846#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11847#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:07,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {11847#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11848#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:07,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {11848#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11849#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:07,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {11849#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11850#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:44:07,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {11850#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:44:07,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {11851#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:44:07,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:44:07,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {11853#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 06:44:07,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {11854#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !(~z~0 % 4294967296 > 0); {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:44:07,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:44:07,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,027 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:07,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:07,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11841#false} is VALID [2022-04-15 06:44:07,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {11841#false} assume !(~y~0 % 4294967296 > 0); {11841#false} is VALID [2022-04-15 06:44:07,029 INFO L272 TraceCheckUtils]: 30: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-15 06:44:07,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-15 06:44:07,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-15 06:44:07,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-15 06:44:07,029 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:44:07,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:07,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {11841#false} assume !false; {11841#false} is VALID [2022-04-15 06:44:07,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {11841#false} assume 0 == ~cond; {11841#false} is VALID [2022-04-15 06:44:07,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {11841#false} ~cond := #in~cond; {11841#false} is VALID [2022-04-15 06:44:07,794 INFO L272 TraceCheckUtils]: 30: Hoare triple {11841#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11841#false} is VALID [2022-04-15 06:44:07,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {11841#false} assume !(~y~0 % 4294967296 > 0); {11841#false} is VALID [2022-04-15 06:44:07,795 INFO L290 TraceCheckUtils]: 28: Hoare triple {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11841#false} is VALID [2022-04-15 06:44:07,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11864#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:07,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11863#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:07,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11862#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11861#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11860#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11859#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11858#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:44:07,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11857#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {11856#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:44:07,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {12013#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11855#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:07,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {12017#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12013#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 06:44:07,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {12021#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12017#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:07,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {12025#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12021#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 06:44:07,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {12029#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12025#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:44:07,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {12033#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12029#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 06:44:07,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {12037#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12033#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))))} is VALID [2022-04-15 06:44:07,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {12041#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12037#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:44:07,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {12045#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12041#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:44:07,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {12049#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12045#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:44:07,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {11840#true} ~z~0 := ~y~0; {12049#(or (<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-15 06:44:07,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {11840#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11840#true} is VALID [2022-04-15 06:44:07,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {11840#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_508 v_main_~y~0_507)) (.cse0 (mod v_main_~x~0_657 4294967296)) (.cse2 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse3 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse4 (= v_main_~x~0_657 v_main_~x~0_656))) (or (and (< v_main_~y~0_508 v_main_~y~0_507) (= v_main_~x~0_656 (+ v_main_~x~0_657 v_main_~y~0_508 (* (- 1) v_main_~y~0_507))) (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_508 v_it_29 1) v_main_~y~0_507)) (< 0 (mod (+ v_main_~x~0_657 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_508, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_657, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_507, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_656, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11840#true} is VALID [2022-04-15 06:44:07,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {11840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11840#true} is VALID [2022-04-15 06:44:07,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {11840#true} call #t~ret11 := main(); {11840#true} is VALID [2022-04-15 06:44:07,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11840#true} {11840#true} #61#return; {11840#true} is VALID [2022-04-15 06:44:07,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {11840#true} assume true; {11840#true} is VALID [2022-04-15 06:44:07,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {11840#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(10, 2);call #Ultimate.allocInit(12, 3); {11840#true} is VALID [2022-04-15 06:44:07,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {11840#true} call ULTIMATE.init(); {11840#true} is VALID [2022-04-15 06:44:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:44:07,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934981331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:07,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:07,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 33 [2022-04-15 06:44:11,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:11,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [356210897] [2022-04-15 06:44:11,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [356210897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:11,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:11,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:44:11,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136197444] [2022-04-15 06:44:11,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:44:11,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:11,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:11,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:11,574 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:44:11,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:11,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:44:11,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1585, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:44:11,575 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:36,950 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-04-15 06:44:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:44:36,950 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 06:44:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:36,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-04-15 06:44:36,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:36,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 69 transitions. [2022-04-15 06:44:36,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 69 transitions. [2022-04-15 06:44:37,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:37,595 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:44:37,595 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:44:37,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1092 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=675, Invalid=5967, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:44:37,596 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:37,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 128 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-04-15 06:44:37,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:44:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 06:44:37,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:37,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:37,798 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:37,798 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:37,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:37,799 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 06:44:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 06:44:37,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:37,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:37,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 06:44:37,800 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 06:44:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:37,801 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2022-04-15 06:44:37,801 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 06:44:37,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:37,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:37,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:37,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:37,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2022-04-15 06:44:37,802 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2022-04-15 06:44:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:37,802 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2022-04-15 06:44:37,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.1875) internal successors, (38), 31 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:44:37,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 46 transitions. [2022-04-15 06:44:59,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 37 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2022-04-15 06:44:59,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:44:59,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:59,084 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:59,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:44:59,286 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 06:44:59,286 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1246089376, now seen corresponding path program 27 times [2022-04-15 06:44:59,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:59,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907609764] [2022-04-15 06:44:59,467 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:44:59,468 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1240232512, now seen corresponding path program 1 times [2022-04-15 06:44:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:59,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142255753] [2022-04-15 06:44:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:59,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:59,479 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:44:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,509 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:44:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {12534#(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(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-15 06:44:59,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-15 06:44:59,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-15 06:44:59,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {12509#true} call ULTIMATE.init(); {12534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:59,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {12534#(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(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {12509#true} call #t~ret11 := main(); {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {12509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {12509#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_543 v_main_~y~0_542)) (.cse1 (= v_main_~x~0_692 v_main_~x~0_691)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_692 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (= v_main_~x~0_691 (+ v_main_~x~0_692 v_main_~y~0_543 (* (- 1) v_main_~y~0_542))) (< 0 .cse4) (< v_main_~y~0_543 v_main_~y~0_542) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_543 v_it_30 1) v_main_~y~0_542)) (< 0 (mod (+ v_main_~x~0_692 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30))))))) InVars {main_~y~0=v_main_~y~0_543, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_692, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_542, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_691, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {12509#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {12509#true} is VALID [2022-04-15 06:44:59,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {12509#true} ~z~0 := ~y~0; {12514#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:44:59,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {12514#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12515#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:44:59,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {12515#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:59,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {12516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:59,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {12517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:59,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {12518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12519#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:44:59,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {12519#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:44:59,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:44:59,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:44:59,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 06:44:59,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:44:59,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:44:59,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:59,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:59,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:44:59,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:44:59,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:44:59,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:59,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:44:59,891 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:59,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:44:59,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12510#false} is VALID [2022-04-15 06:44:59,892 INFO L272 TraceCheckUtils]: 30: Hoare triple {12510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12510#false} is VALID [2022-04-15 06:44:59,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {12510#false} ~cond := #in~cond; {12510#false} is VALID [2022-04-15 06:44:59,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {12510#false} assume 0 == ~cond; {12510#false} is VALID [2022-04-15 06:44:59,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#false} assume !false; {12510#false} is VALID [2022-04-15 06:44:59,893 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:44:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142255753] [2022-04-15 06:44:59,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142255753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:59,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454799453] [2022-04-15 06:44:59,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:59,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:59,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:59,894 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:44:59,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:44:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:44:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:59,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:00,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {12509#true} call ULTIMATE.init(); {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {12509#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(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {12509#true} call #t~ret11 := main(); {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {12509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {12509#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_543 v_main_~y~0_542)) (.cse1 (= v_main_~x~0_692 v_main_~x~0_691)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_692 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (= v_main_~x~0_691 (+ v_main_~x~0_692 v_main_~y~0_543 (* (- 1) v_main_~y~0_542))) (< 0 .cse4) (< v_main_~y~0_543 v_main_~y~0_542) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_543 v_it_30 1) v_main_~y~0_542)) (< 0 (mod (+ v_main_~x~0_692 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30))))))) InVars {main_~y~0=v_main_~y~0_543, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_692, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_542, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_691, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {12509#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {12509#true} is VALID [2022-04-15 06:45:00,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {12509#true} ~z~0 := ~y~0; {12514#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:00,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {12514#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12515#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:45:00,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {12515#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:45:00,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {12516#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:45:00,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {12517#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:45:00,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {12518#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12519#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:45:00,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {12519#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:45:00,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {12520#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:45:00,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {12521#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:45:00,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {12522#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 06:45:00,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {12523#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:45:00,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:45:00,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:00,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:00,348 INFO L290 TraceCheckUtils]: 22: Hoare triple {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:45:00,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:45:00,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:45:00,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:45:00,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:45:00,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:45:00,353 INFO L290 TraceCheckUtils]: 28: Hoare triple {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:45:00,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12510#false} is VALID [2022-04-15 06:45:00,354 INFO L272 TraceCheckUtils]: 30: Hoare triple {12510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12510#false} is VALID [2022-04-15 06:45:00,354 INFO L290 TraceCheckUtils]: 31: Hoare triple {12510#false} ~cond := #in~cond; {12510#false} is VALID [2022-04-15 06:45:00,354 INFO L290 TraceCheckUtils]: 32: Hoare triple {12510#false} assume 0 == ~cond; {12510#false} is VALID [2022-04-15 06:45:00,354 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#false} assume !false; {12510#false} is VALID [2022-04-15 06:45:00,354 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:45:00,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:01,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {12510#false} assume !false; {12510#false} is VALID [2022-04-15 06:45:01,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {12510#false} assume 0 == ~cond; {12510#false} is VALID [2022-04-15 06:45:01,107 INFO L290 TraceCheckUtils]: 31: Hoare triple {12510#false} ~cond := #in~cond; {12510#false} is VALID [2022-04-15 06:45:01,107 INFO L272 TraceCheckUtils]: 30: Hoare triple {12510#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12510#false} is VALID [2022-04-15 06:45:01,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {12510#false} is VALID [2022-04-15 06:45:01,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12533#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:45:01,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12532#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:45:01,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12531#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:45:01,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12530#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:45:01,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12529#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:45:01,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12528#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:45:01,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12527#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:45:01,116 INFO L290 TraceCheckUtils]: 21: Hoare triple {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12526#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {12525#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:01,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !(~z~0 % 4294967296 > 0); {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:45:01,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {12682#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12524#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:45:01,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {12686#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12682#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:45:01,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {12690#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12686#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-15 06:45:01,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {12694#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12690#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:45:01,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {12698#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12694#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-15 06:45:01,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {12702#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12698#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:45:01,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {12706#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12702#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:45:01,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {12710#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12706#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:45:01,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {12714#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12710#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 06:45:01,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {12718#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12714#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:45:01,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {12509#true} ~z~0 := ~y~0; {12718#(or (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304)))} is VALID [2022-04-15 06:45:01,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {12509#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {12509#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_543 v_main_~y~0_542)) (.cse1 (= v_main_~x~0_692 v_main_~x~0_691)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_692 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (= v_main_~x~0_691 (+ v_main_~x~0_692 v_main_~y~0_543 (* (- 1) v_main_~y~0_542))) (< 0 .cse4) (< v_main_~y~0_543 v_main_~y~0_542) (forall ((v_it_30 Int)) (or (not (<= (+ v_main_~y~0_543 v_it_30 1) v_main_~y~0_542)) (< 0 (mod (+ v_main_~x~0_692 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30))))))) InVars {main_~y~0=v_main_~y~0_543, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_692, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_542, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_691, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {12509#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {12509#true} call #t~ret11 := main(); {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12509#true} {12509#true} #61#return; {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {12509#true} assume true; {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {12509#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(10, 2);call #Ultimate.allocInit(12, 3); {12509#true} is VALID [2022-04-15 06:45:01,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {12509#true} call ULTIMATE.init(); {12509#true} is VALID [2022-04-15 06:45:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:45:01,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454799453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:01,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:01,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 33 [2022-04-15 06:45:06,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907609764] [2022-04-15 06:45:06,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907609764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:06,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:06,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:45:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125898801] [2022-04-15 06:45:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:06,905 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:45:06,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:06,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:45:07,877 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 06:45:07,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:45:07,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:07,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:45:07,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1658, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:45:07,879 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:03,759 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-15 06:46:03,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:46:03,760 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 06:46:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2022-04-15 06:46:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 52 transitions. [2022-04-15 06:46:03,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 52 transitions. [2022-04-15 06:46:07,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:07,067 INFO L225 Difference]: With dead ends: 50 [2022-04-15 06:46:07,067 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 06:46:07,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=711, Invalid=4691, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:46:07,068 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:07,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 131 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 17.6s Time] [2022-04-15 06:46:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 06:46:07,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 06:46:07,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:07,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:07,284 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:07,284 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:07,285 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 06:46:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 06:46:07,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:07,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:07,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:46:07,285 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 06:46:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:07,285 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 06:46:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 06:46:07,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:07,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:07,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:07,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:07,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 06:46:07,286 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 43 [2022-04-15 06:46:07,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:07,286 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 06:46:07,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 32 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:07,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 06:46:28,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 38 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 06:46:28,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:46:28,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:28,607 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:28,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 06:46:28,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:28,808 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:28,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:28,808 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 28 times [2022-04-15 06:46:28,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:28,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1994227535] [2022-04-15 06:46:32,335 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:46:32,336 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:32,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1118723181, now seen corresponding path program 1 times [2022-04-15 06:46:32,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:32,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679847179] [2022-04-15 06:46:32,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:32,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:32,347 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,360 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_31.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:32,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {13120#(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(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-15 06:46:32,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 06:46:32,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-15 06:46:32,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13120#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:32,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {13120#(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(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-15 06:46:32,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 06:46:32,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-15 06:46:32,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret11 := main(); {13102#true} is VALID [2022-04-15 06:46:32,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13102#true} is VALID [2022-04-15 06:46:32,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_727 v_main_~x~0_726)) (.cse1 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse2 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (mod v_main_~x~0_727 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_727 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_577 v_it_31 1) v_main_~y~0_576)))) (= (+ v_main_~x~0_727 v_main_~y~0_577 (* (- 1) v_main_~y~0_576)) v_main_~x~0_726) (< v_main_~y~0_577 v_main_~y~0_576)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_577, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_727, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_576, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13102#true} is VALID [2022-04-15 06:46:32,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:32,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:46:32,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:46:32,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:46:32,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:46:32,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:46:32,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,582 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:46:32,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:32,586 INFO L290 TraceCheckUtils]: 29: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,587 INFO L272 TraceCheckUtils]: 31: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13118#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:46:32,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {13118#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {13119#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:46:32,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {13119#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13103#false} is VALID [2022-04-15 06:46:32,588 INFO L290 TraceCheckUtils]: 34: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-15 06:46:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:32,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:32,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679847179] [2022-04-15 06:46:32,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679847179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:32,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661031534] [2022-04-15 06:46:32,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:32,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:32,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:32,590 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:46:32,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:46:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:46:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:32,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13102#true} is VALID [2022-04-15 06:46:32,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#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(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-15 06:46:32,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 06:46:32,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-15 06:46:32,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret11 := main(); {13102#true} is VALID [2022-04-15 06:46:32,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13102#true} is VALID [2022-04-15 06:46:32,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_727 v_main_~x~0_726)) (.cse1 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse2 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (mod v_main_~x~0_727 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_727 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_577 v_it_31 1) v_main_~y~0_576)))) (= (+ v_main_~x~0_727 v_main_~y~0_577 (* (- 1) v_main_~y~0_576)) v_main_~x~0_726) (< v_main_~y~0_577 v_main_~y~0_576)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_577, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_727, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_576, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13102#true} is VALID [2022-04-15 06:46:32,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:32,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:46:32,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:46:32,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:46:32,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:46:32,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:46:32,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:46:32,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,926 INFO L290 TraceCheckUtils]: 28: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:32,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,927 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:32,928 INFO L272 TraceCheckUtils]: 31: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:46:32,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:46:32,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {13221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13103#false} is VALID [2022-04-15 06:46:32,928 INFO L290 TraceCheckUtils]: 34: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-15 06:46:32,929 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:32,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:33,223 INFO L290 TraceCheckUtils]: 34: Hoare triple {13103#false} assume !false; {13103#false} is VALID [2022-04-15 06:46:33,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {13221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13103#false} is VALID [2022-04-15 06:46:33,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:46:33,225 INFO L272 TraceCheckUtils]: 31: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:46:33,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:33,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:33,227 INFO L290 TraceCheckUtils]: 28: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:33,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:46:33,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:46:33,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:46:33,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13117#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:46:33,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13116#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:46:33,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13115#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13114#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13113#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13112#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:46:33,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13111#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13110#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13109#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:33,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13108#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:46:33,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:33,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {13102#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13107#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:46:33,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {13102#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_727 v_main_~x~0_726)) (.cse1 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse2 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse4 (mod v_main_~x~0_727 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (< 0 (mod (+ v_main_~x~0_727 (* 4294967295 v_it_31)) 4294967296)) (not (<= (+ v_main_~y~0_577 v_it_31 1) v_main_~y~0_576)))) (= (+ v_main_~x~0_727 v_main_~y~0_577 (* (- 1) v_main_~y~0_576)) v_main_~x~0_726) (< v_main_~y~0_577 v_main_~y~0_576)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_577, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_727, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_576, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13102#true} is VALID [2022-04-15 06:46:33,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {13102#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13102#true} is VALID [2022-04-15 06:46:33,242 INFO L272 TraceCheckUtils]: 4: Hoare triple {13102#true} call #t~ret11 := main(); {13102#true} is VALID [2022-04-15 06:46:33,243 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13102#true} {13102#true} #61#return; {13102#true} is VALID [2022-04-15 06:46:33,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {13102#true} assume true; {13102#true} is VALID [2022-04-15 06:46:33,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {13102#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(10, 2);call #Ultimate.allocInit(12, 3); {13102#true} is VALID [2022-04-15 06:46:33,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {13102#true} call ULTIMATE.init(); {13102#true} is VALID [2022-04-15 06:46:33,243 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:33,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661031534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:33,243 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:33,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2022-04-15 06:46:37,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:37,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1994227535] [2022-04-15 06:46:37,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1994227535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:37,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:37,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 06:46:37,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73547837] [2022-04-15 06:46:37,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:37,173 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:46:37,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:37,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:37,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:37,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 06:46:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:37,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 06:46:37,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:46:37,394 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:48,447 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2022-04-15 06:46:48,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:46:48,448 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 06:46:48,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-15 06:46:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 85 transitions. [2022-04-15 06:46:48,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 85 transitions. [2022-04-15 06:46:48,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:48,715 INFO L225 Difference]: With dead ends: 82 [2022-04-15 06:46:48,715 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 06:46:48,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=614, Invalid=1936, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:46:48,716 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:48,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 45 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:46:48,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 06:46:48,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 47. [2022-04-15 06:46:48,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:48,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,964 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,964 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:48,965 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 06:46:48,965 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-15 06:46:48,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:48,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:48,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 06:46:48,965 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 06:46:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:48,966 INFO L93 Difference]: Finished difference Result 77 states and 90 transitions. [2022-04-15 06:46:48,966 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 90 transitions. [2022-04-15 06:46:48,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:48,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:48,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:48,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:48,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-04-15 06:46:48,967 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 44 [2022-04-15 06:46:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:48,967 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-04-15 06:46:48,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 24 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:46:48,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 50 transitions. [2022-04-15 06:47:12,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 39 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-04-15 06:47:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:47:12,314 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:12,314 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:12,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 06:47:12,514 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:12,515 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:12,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:12,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1907827968, now seen corresponding path program 29 times [2022-04-15 06:47:12,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:12,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892440162] [2022-04-15 06:47:12,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:47:12,675 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:12,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1764010976, now seen corresponding path program 1 times [2022-04-15 06:47:12,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:12,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981204750] [2022-04-15 06:47:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:12,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:12,686 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:47:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:12,716 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:47:13,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:13,360 INFO L290 TraceCheckUtils]: 0: Hoare triple {13827#(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(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-15 06:47:13,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-15 06:47:13,360 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {13800#true} call ULTIMATE.init(); {13827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:47:13,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {13827#(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(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {13800#true} call #t~ret11 := main(); {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {13800#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {13800#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= v_main_~x~0_783 v_main_~x~0_782)) (.cse3 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse4 (mod v_main_~x~0_783 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (< 0 (mod (+ v_main_~x~0_783 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~x~0_782 v_it_32 1) v_main_~x~0_783)))) (< 0 .cse4) (= v_main_~y~0_602 (+ v_main_~x~0_783 v_main_~y~0_603 (* v_main_~x~0_782 (- 1)))) (< v_main_~x~0_782 v_main_~x~0_783)))) InVars {main_~y~0=v_main_~y~0_603, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_783, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_602, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_782, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13800#true} is VALID [2022-04-15 06:47:13,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {13800#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13800#true} is VALID [2022-04-15 06:47:13,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {13800#true} ~z~0 := ~y~0; {13805#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:47:13,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {13805#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13806#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-15 06:47:13,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {13806#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13807#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)) 4294967293)))} is VALID [2022-04-15 06:47:13,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {13807#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 2 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)) 4294967293)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13808#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 3 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:47:13,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {13808#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 3 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13809#(and (<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 4) 4294967296) 4294967296))) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:47:13,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {13809#(and (<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 4) 4294967296) 4294967296))) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13810#(and (<= (+ 5 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967290 (* (div (+ 5 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:47:14,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {13810#(and (<= (+ 5 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967290 (* (div (+ 5 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13811#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~z~0 (+ 4294967289 (* (div (+ main_~z~0 6 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:47:14,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {13811#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~z~0 (+ 4294967289 (* (div (+ main_~z~0 6 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13812#(and (<= (+ 7 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967288 (* (div (+ 7 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:47:14,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {13812#(and (<= (+ 7 main_~z~0) main_~y~0) (<= main_~z~0 (+ 4294967288 (* (div (+ 7 main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13813#(and (<= main_~z~0 (+ 4294967287 (* (div (+ main_~z~0 8 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:47:14,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {13813#(and (<= main_~z~0 (+ 4294967287 (* (div (+ main_~z~0 8 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13814#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 9 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967286)))} is VALID [2022-04-15 06:47:14,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {13814#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 9 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967286)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13815#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) main_~z~0 10))} is VALID [2022-04-15 06:47:14,013 INFO L290 TraceCheckUtils]: 19: Hoare triple {13815#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) main_~z~0 10))} assume !(~z~0 % 4294967296 > 0); {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:14,014 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:47:14,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:47:14,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:47:14,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:47:14,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13801#false} is VALID [2022-04-15 06:47:14,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {13801#false} assume !(~y~0 % 4294967296 > 0); {13801#false} is VALID [2022-04-15 06:47:14,023 INFO L272 TraceCheckUtils]: 32: Hoare triple {13801#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13801#false} is VALID [2022-04-15 06:47:14,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {13801#false} ~cond := #in~cond; {13801#false} is VALID [2022-04-15 06:47:14,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {13801#false} assume 0 == ~cond; {13801#false} is VALID [2022-04-15 06:47:14,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {13801#false} assume !false; {13801#false} is VALID [2022-04-15 06:47:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:47:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:14,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981204750] [2022-04-15 06:47:14,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981204750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:14,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811682811] [2022-04-15 06:47:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:14,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:14,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:14,025 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:47:14,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:47:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:14,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:47:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:14,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:14,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {13800#true} call ULTIMATE.init(); {13800#true} is VALID [2022-04-15 06:47:14,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {13800#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(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-15 06:47:14,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-15 06:47:14,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-15 06:47:14,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {13800#true} call #t~ret11 := main(); {13800#true} is VALID [2022-04-15 06:47:14,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {13800#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13800#true} is VALID [2022-04-15 06:47:14,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {13800#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= v_main_~x~0_783 v_main_~x~0_782)) (.cse3 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse4 (mod v_main_~x~0_783 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (< 0 (mod (+ v_main_~x~0_783 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~x~0_782 v_it_32 1) v_main_~x~0_783)))) (< 0 .cse4) (= v_main_~y~0_602 (+ v_main_~x~0_783 v_main_~y~0_603 (* v_main_~x~0_782 (- 1)))) (< v_main_~x~0_782 v_main_~x~0_783)))) InVars {main_~y~0=v_main_~y~0_603, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_783, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_602, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_782, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13800#true} is VALID [2022-04-15 06:47:14,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {13800#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13800#true} is VALID [2022-04-15 06:47:14,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {13800#true} ~z~0 := ~y~0; {13805#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:47:14,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {13805#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13858#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:47:14,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {13858#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13862#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:47:14,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {13862#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13866#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:47:14,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {13866#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13870#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:47:14,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {13870#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13874#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-15 06:47:14,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {13874#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13878#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-15 06:47:14,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {13878#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13882#(= (+ (- 2) main_~y~0) (+ 5 main_~z~0))} is VALID [2022-04-15 06:47:14,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {13882#(= (+ (- 2) main_~y~0) (+ 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13886#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:47:14,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {13886#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13890#(= (+ main_~z~0 2) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:47:14,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {13890#(= (+ main_~z~0 2) (+ main_~y~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13894#(= (+ main_~z~0 3) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:47:14,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {13894#(= (+ main_~z~0 3) (+ main_~y~0 (- 7)))} assume !(~z~0 % 4294967296 > 0); {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:14,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:47:14,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:47:14,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:14,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:47:14,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:47:14,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13801#false} is VALID [2022-04-15 06:47:14,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {13801#false} assume !(~y~0 % 4294967296 > 0); {13801#false} is VALID [2022-04-15 06:47:14,643 INFO L272 TraceCheckUtils]: 32: Hoare triple {13801#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13801#false} is VALID [2022-04-15 06:47:14,643 INFO L290 TraceCheckUtils]: 33: Hoare triple {13801#false} ~cond := #in~cond; {13801#false} is VALID [2022-04-15 06:47:14,643 INFO L290 TraceCheckUtils]: 34: Hoare triple {13801#false} assume 0 == ~cond; {13801#false} is VALID [2022-04-15 06:47:14,643 INFO L290 TraceCheckUtils]: 35: Hoare triple {13801#false} assume !false; {13801#false} is VALID [2022-04-15 06:47:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:47:14,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:15,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {13801#false} assume !false; {13801#false} is VALID [2022-04-15 06:47:15,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {13801#false} assume 0 == ~cond; {13801#false} is VALID [2022-04-15 06:47:15,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {13801#false} ~cond := #in~cond; {13801#false} is VALID [2022-04-15 06:47:15,669 INFO L272 TraceCheckUtils]: 32: Hoare triple {13801#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13801#false} is VALID [2022-04-15 06:47:15,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {13801#false} assume !(~y~0 % 4294967296 > 0); {13801#false} is VALID [2022-04-15 06:47:15,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13801#false} is VALID [2022-04-15 06:47:15,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13826#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:47:15,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13825#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:47:15,672 INFO L290 TraceCheckUtils]: 27: Hoare triple {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13824#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:15,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13823#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:15,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13822#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:15,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13821#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:15,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13820#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:47:15,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13819#(<= main_~y~0 (+ 7 (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:15,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13818#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-15 06:47:15,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {13817#(<= main_~y~0 (+ 9 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:15,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {13994#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13816#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:47:15,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {13998#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13994#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:47:15,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {14002#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13998#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:47:15,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {14006#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14002#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:47:15,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {14010#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14006#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:47:15,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {14014#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14010#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:47:15,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {14018#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14014#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:47:15,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {14022#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14018#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:47:15,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {14026#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14022#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-15 06:47:15,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {14030#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14026#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:47:15,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {14034#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14030#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-15 06:47:15,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {13800#true} ~z~0 := ~y~0; {14034#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 10)) (< 0 (mod (+ main_~z~0 4294967286) 4294967296)))} is VALID [2022-04-15 06:47:15,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {13800#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {13800#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse1 (= v_main_~y~0_603 v_main_~y~0_602)) (.cse2 (= v_main_~x~0_783 v_main_~x~0_782)) (.cse3 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse4 (mod v_main_~x~0_783 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (< 0 (mod (+ v_main_~x~0_783 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~x~0_782 v_it_32 1) v_main_~x~0_783)))) (< 0 .cse4) (= v_main_~y~0_602 (+ v_main_~x~0_783 v_main_~y~0_603 (* v_main_~x~0_782 (- 1)))) (< v_main_~x~0_782 v_main_~x~0_783)))) InVars {main_~y~0=v_main_~y~0_603, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_783, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_602, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_782, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {13800#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {13800#true} call #t~ret11 := main(); {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13800#true} {13800#true} #61#return; {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {13800#true} assume true; {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {13800#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(10, 2);call #Ultimate.allocInit(12, 3); {13800#true} is VALID [2022-04-15 06:47:15,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {13800#true} call ULTIMATE.init(); {13800#true} is VALID [2022-04-15 06:47:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:47:15,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811682811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:15,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:15,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 46 [2022-04-15 06:47:24,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:24,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892440162] [2022-04-15 06:47:24,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892440162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:24,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:24,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:47:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499324806] [2022-04-15 06:47:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:24,216 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:47:24,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:24,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:47:26,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:26,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:47:26,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:26,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:47:26,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2883, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:47:26,387 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:11,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:48:19,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:48:38,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:38,423 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2022-04-15 06:48:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:48:38,423 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:48:38,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:38,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2022-04-15 06:48:38,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:38,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 72 transitions. [2022-04-15 06:48:38,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 72 transitions. [2022-04-15 06:48:41,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 71 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:41,485 INFO L225 Difference]: With dead ends: 88 [2022-04-15 06:48:41,485 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:48:41,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=772, Invalid=8930, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 06:48:41,486 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 96 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:41,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 143 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 979 Invalid, 1 Unknown, 0 Unchecked, 15.4s Time] [2022-04-15 06:48:41,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:48:41,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 06:48:41,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:41,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:41,902 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:41,902 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:41,903 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 06:48:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 06:48:41,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:41,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:41,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:48:41,903 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 06:48:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:41,904 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 06:48:41,904 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 06:48:41,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:41,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:41,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:41,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 66 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2022-04-15 06:48:41,905 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 45 [2022-04-15 06:48:41,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:41,905 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2022-04-15 06:48:41,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:48:41,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 75 transitions. [2022-04-15 06:49:07,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 64 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:07,095 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 06:49:07,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 06:49:07,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:07,095 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:07,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:07,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:07,296 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:07,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:07,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1633510225, now seen corresponding path program 30 times [2022-04-15 06:49:07,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1307398777] [2022-04-15 06:49:08,483 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:49:08,484 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash -368491569, now seen corresponding path program 1 times [2022-04-15 06:49:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:08,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195779651] [2022-04-15 06:49:08,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:08,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:08,496 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:49:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:08,529 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_33.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:49:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:08,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {14650#(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(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-15 06:49:08,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-15 06:49:08,985 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-15 06:49:08,985 INFO L272 TraceCheckUtils]: 0: Hoare triple {14623#true} call ULTIMATE.init(); {14650#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:08,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {14650#(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(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-15 06:49:08,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-15 06:49:08,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-15 06:49:08,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {14623#true} call #t~ret11 := main(); {14623#true} is VALID [2022-04-15 06:49:08,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {14623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14623#true} is VALID [2022-04-15 06:49:08,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {14623#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_821 v_main_~x~0_820)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~y~0_641 v_main_~y~0_640)) (.cse0 (mod v_main_~x~0_821 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_641 v_main_~y~0_640) (= v_main_~x~0_820 (+ v_main_~x~0_821 v_main_~y~0_641 (* (- 1) v_main_~y~0_640))) (< 0 .cse0) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_641 v_it_33 1) v_main_~y~0_640)) (< 0 (mod (+ v_main_~x~0_821 (* 4294967295 v_it_33)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_641, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_821, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_640, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_820, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14623#true} is VALID [2022-04-15 06:49:08,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14623#true} is VALID [2022-04-15 06:49:08,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#true} ~z~0 := ~y~0; {14628#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:49:08,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {14628#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14629#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:49:08,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {14629#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14630#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:49:08,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14631#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:49:08,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {14631#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14632#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:49:08,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {14632#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14633#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:49:08,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {14633#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:49:08,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:49:08,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:49:08,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 06:49:08,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-15 06:49:08,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:49:08,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:49:08,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:49:08,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:08,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:08,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:49:08,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:49:08,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:49:09,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:49:09,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:49:09,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:49:09,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:49:09,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14624#false} is VALID [2022-04-15 06:49:09,004 INFO L272 TraceCheckUtils]: 32: Hoare triple {14624#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14624#false} is VALID [2022-04-15 06:49:09,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {14624#false} ~cond := #in~cond; {14624#false} is VALID [2022-04-15 06:49:09,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {14624#false} assume 0 == ~cond; {14624#false} is VALID [2022-04-15 06:49:09,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {14624#false} assume !false; {14624#false} is VALID [2022-04-15 06:49:09,005 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:09,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:09,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195779651] [2022-04-15 06:49:09,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195779651] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:09,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482015215] [2022-04-15 06:49:09,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:09,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:09,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:09,006 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:49:09,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 06:49:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:09,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:49:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:09,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:09,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {14623#true} call ULTIMATE.init(); {14623#true} is VALID [2022-04-15 06:49:09,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {14623#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(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-15 06:49:09,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-15 06:49:09,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-15 06:49:09,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {14623#true} call #t~ret11 := main(); {14623#true} is VALID [2022-04-15 06:49:09,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {14623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14623#true} is VALID [2022-04-15 06:49:09,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {14623#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_821 v_main_~x~0_820)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~y~0_641 v_main_~y~0_640)) (.cse0 (mod v_main_~x~0_821 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_641 v_main_~y~0_640) (= v_main_~x~0_820 (+ v_main_~x~0_821 v_main_~y~0_641 (* (- 1) v_main_~y~0_640))) (< 0 .cse0) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_641 v_it_33 1) v_main_~y~0_640)) (< 0 (mod (+ v_main_~x~0_821 (* 4294967295 v_it_33)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_641, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_821, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_640, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_820, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14623#true} is VALID [2022-04-15 06:49:09,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14623#true} is VALID [2022-04-15 06:49:09,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#true} ~z~0 := ~y~0; {14628#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:49:09,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {14628#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14629#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:49:09,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {14629#(= (+ (- 1) main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14630#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:49:09,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {14630#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14631#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:49:09,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {14631#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14632#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:49:09,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {14632#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14633#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:49:09,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {14633#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:49:09,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {14634#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:49:09,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#(and (<= main_~y~0 (+ 7 main_~z~0)) (<= (+ 7 main_~z~0) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} is VALID [2022-04-15 06:49:09,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {14636#(and (<= main_~y~0 (+ main_~z~0 8)) (<= (+ main_~z~0 8) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} is VALID [2022-04-15 06:49:09,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {14637#(and (<= (+ main_~z~0 9) main_~y~0) (<= main_~y~0 (+ main_~z~0 9)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} is VALID [2022-04-15 06:49:09,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {14638#(and (<= (+ main_~z~0 10) main_~y~0) (<= main_~y~0 (+ main_~z~0 10)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:49:09,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:49:09,560 INFO L290 TraceCheckUtils]: 21: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:49:09,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:09,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:09,563 INFO L290 TraceCheckUtils]: 24: Hoare triple {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:49:09,563 INFO L290 TraceCheckUtils]: 25: Hoare triple {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:49:09,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:49:09,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:49:09,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:49:09,568 INFO L290 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:49:09,568 INFO L290 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:49:09,569 INFO L290 TraceCheckUtils]: 31: Hoare triple {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14624#false} is VALID [2022-04-15 06:49:09,569 INFO L272 TraceCheckUtils]: 32: Hoare triple {14624#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14624#false} is VALID [2022-04-15 06:49:09,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {14624#false} ~cond := #in~cond; {14624#false} is VALID [2022-04-15 06:49:09,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {14624#false} assume 0 == ~cond; {14624#false} is VALID [2022-04-15 06:49:09,569 INFO L290 TraceCheckUtils]: 35: Hoare triple {14624#false} assume !false; {14624#false} is VALID [2022-04-15 06:49:09,570 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:09,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:10,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {14624#false} assume !false; {14624#false} is VALID [2022-04-15 06:49:10,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {14624#false} assume 0 == ~cond; {14624#false} is VALID [2022-04-15 06:49:10,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {14624#false} ~cond := #in~cond; {14624#false} is VALID [2022-04-15 06:49:10,491 INFO L272 TraceCheckUtils]: 32: Hoare triple {14624#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14624#false} is VALID [2022-04-15 06:49:10,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14624#false} is VALID [2022-04-15 06:49:10,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14649#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:49:10,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14648#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:49:10,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14647#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:49:10,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14646#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:49:10,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14645#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-15 06:49:10,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14644#(<= main_~y~0 (+ 4294967300 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-15 06:49:10,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14643#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 7)) 4294967296) 4294967296) 4294967301))} is VALID [2022-04-15 06:49:10,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14642#(<= main_~y~0 (+ 4294967302 (* (div (+ main_~y~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:10,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14641#(<= main_~y~0 (+ 4294967303 (* (div (+ (- 9) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:10,501 INFO L290 TraceCheckUtils]: 21: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {14640#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 10)) 4294967296) 4294967296) 4294967304))} is VALID [2022-04-15 06:49:10,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:49:10,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {14807#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14639#(<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:49:10,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {14811#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14807#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:49:10,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {14815#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14811#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} is VALID [2022-04-15 06:49:10,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {14819#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14815#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:49:10,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {14823#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14819#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} is VALID [2022-04-15 06:49:10,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {14827#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14823#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:49:10,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {14831#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14827#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:49:10,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {14835#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14831#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:49:10,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {14839#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14835#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 06:49:10,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {14843#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14839#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:49:10,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {14847#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14843#(or (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))) (not (< 0 (mod (+ main_~z~0 4294967287) 4294967296))))} is VALID [2022-04-15 06:49:10,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {14623#true} ~z~0 := ~y~0; {14847#(or (not (< 0 (mod (+ main_~z~0 4294967286) 4294967296))) (<= main_~y~0 (+ 4294967305 (* 4294967296 (div (+ (- 11) main_~y~0) 4294967296)))))} is VALID [2022-04-15 06:49:10,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {14623#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {14623#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_821 v_main_~x~0_820)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~y~0_641 v_main_~y~0_640)) (.cse0 (mod v_main_~x~0_821 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_641 v_main_~y~0_640) (= v_main_~x~0_820 (+ v_main_~x~0_821 v_main_~y~0_641 (* (- 1) v_main_~y~0_640))) (< 0 .cse0) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_641 v_it_33 1) v_main_~y~0_640)) (< 0 (mod (+ v_main_~x~0_821 (* 4294967295 v_it_33)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_641, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_821, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_640, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_820, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {14623#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {14623#true} call #t~ret11 := main(); {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14623#true} {14623#true} #61#return; {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {14623#true} assume true; {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {14623#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(10, 2);call #Ultimate.allocInit(12, 3); {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {14623#true} call ULTIMATE.init(); {14623#true} is VALID [2022-04-15 06:49:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:10,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482015215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:10,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:10,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 36 [2022-04-15 06:49:18,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1307398777] [2022-04-15 06:49:18,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1307398777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:18,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:18,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:49:18,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852579254] [2022-04-15 06:49:18,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:18,881 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:49:18,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:18,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:49:19,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:19,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:49:19,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:49:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1914, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 06:49:19,055 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:31,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:31,164 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-15 06:50:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 06:50:31,165 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 06:50:31,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-04-15 06:50:31,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:31,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-04-15 06:50:31,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 54 transitions. [2022-04-15 06:50:36,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:36,730 INFO L225 Difference]: With dead ends: 77 [2022-04-15 06:50:36,730 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 06:50:36,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=796, Invalid=5366, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:50:36,731 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:36,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 136 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 20.8s Time] [2022-04-15 06:50:36,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 06:50:36,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 06:50:36,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:36,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:36,999 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:36,999 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:36,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:36,999 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-15 06:50:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 06:50:36,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:36,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:37,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 06:50:37,000 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 06:50:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:37,000 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2022-04-15 06:50:37,000 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 06:50:37,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:37,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:37,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:37,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-04-15 06:50:37,001 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-04-15 06:50:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:37,001 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-04-15 06:50:37,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 34 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:50:37,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2022-04-15 06:50:59,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 40 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:59,760 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 06:50:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 06:50:59,760 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:59,761 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:59,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 06:50:59,961 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 06:50:59,963 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -457999617, now seen corresponding path program 31 times [2022-04-15 06:50:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:59,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602457926] [2022-04-15 06:51:00,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:51:00,179 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash -2074576834, now seen corresponding path program 1 times [2022-04-15 06:51:00,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:00,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182784740] [2022-04-15 06:51:00,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:00,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:00,191 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:51:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,211 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:51:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {15320#(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(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-15 06:51:00,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-15 06:51:00,467 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-15 06:51:00,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {15301#true} call ULTIMATE.init(); {15320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:00,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {15320#(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(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-15 06:51:00,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-15 06:51:00,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-15 06:51:00,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {15301#true} call #t~ret11 := main(); {15301#true} is VALID [2022-04-15 06:51:00,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {15301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15301#true} is VALID [2022-04-15 06:51:00,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {15301#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~y~0_677 v_main_~y~0_676)) (.cse4 (= v_main_~x~0_858 v_main_~x~0_857)) (.cse3 (mod v_main_~x~0_858 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_34 Int)) (or (not (<= (+ v_main_~x~0_857 v_it_34 1) v_main_~x~0_858)) (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_858 (* 4294967295 v_it_34)) 4294967296)))) (< v_main_~x~0_857 v_main_~x~0_858) (= v_main_~y~0_676 (+ (* v_main_~x~0_857 (- 1)) v_main_~x~0_858 v_main_~y~0_677))))) InVars {main_~y~0=v_main_~y~0_677, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_858, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_676, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_857, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15301#true} is VALID [2022-04-15 06:51:00,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {15301#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:51:00,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:51:00,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:51:00,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:51:00,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:51:00,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:51:00,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:51:00,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:51:00,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,482 INFO L290 TraceCheckUtils]: 24: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:51:00,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:51:00,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,489 INFO L290 TraceCheckUtils]: 32: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,489 INFO L272 TraceCheckUtils]: 33: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15318#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:51:00,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {15318#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {15319#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:51:00,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {15319#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15302#false} is VALID [2022-04-15 06:51:00,490 INFO L290 TraceCheckUtils]: 36: Hoare triple {15302#false} assume !false; {15302#false} is VALID [2022-04-15 06:51:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182784740] [2022-04-15 06:51:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182784740] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340917970] [2022-04-15 06:51:00,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:00,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:00,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:00,493 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:51:00,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:51:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 06:51:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:00,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:00,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {15301#true} call ULTIMATE.init(); {15301#true} is VALID [2022-04-15 06:51:00,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {15301#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(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-15 06:51:00,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-15 06:51:00,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-15 06:51:00,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {15301#true} call #t~ret11 := main(); {15301#true} is VALID [2022-04-15 06:51:00,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {15301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15301#true} is VALID [2022-04-15 06:51:00,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {15301#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~y~0_677 v_main_~y~0_676)) (.cse4 (= v_main_~x~0_858 v_main_~x~0_857)) (.cse3 (mod v_main_~x~0_858 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_34 Int)) (or (not (<= (+ v_main_~x~0_857 v_it_34 1) v_main_~x~0_858)) (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_858 (* 4294967295 v_it_34)) 4294967296)))) (< v_main_~x~0_857 v_main_~x~0_858) (= v_main_~y~0_676 (+ (* v_main_~x~0_857 (- 1)) v_main_~x~0_858 v_main_~y~0_677))))) InVars {main_~y~0=v_main_~y~0_677, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_858, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_676, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_857, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15301#true} is VALID [2022-04-15 06:51:00,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {15301#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:51:00,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:51:00,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:51:00,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:51:00,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:51:00,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:51:00,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:51:00,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:51:00,871 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:51:00,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:00,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:51:00,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:00,879 INFO L272 TraceCheckUtils]: 33: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:51:00,879 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:51:00,880 INFO L290 TraceCheckUtils]: 35: Hoare triple {15427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15302#false} is VALID [2022-04-15 06:51:00,880 INFO L290 TraceCheckUtils]: 36: Hoare triple {15302#false} assume !false; {15302#false} is VALID [2022-04-15 06:51:00,880 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:00,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:01,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {15302#false} assume !false; {15302#false} is VALID [2022-04-15 06:51:01,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {15427#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {15302#false} is VALID [2022-04-15 06:51:01,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15427#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:51:01,209 INFO L272 TraceCheckUtils]: 33: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15423#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:51:01,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:01,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:01,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:51:01,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:51:01,215 INFO L290 TraceCheckUtils]: 25: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:51:01,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~x~0;~x~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~y~0;~y~0 := #t~post10 - 1;havoc #t~post10; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:51:01,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:51:01,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15317#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:51:01,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15316#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:51:01,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15315#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:51:01,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15314#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15313#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15312#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15311#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:51:01,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15310#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15309#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15308#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:01,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15307#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:51:01,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:01,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {15301#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {15306#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:51:01,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {15301#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~y~0_677 v_main_~y~0_676)) (.cse4 (= v_main_~x~0_858 v_main_~x~0_857)) (.cse3 (mod v_main_~x~0_858 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_34 Int)) (or (not (<= (+ v_main_~x~0_857 v_it_34 1) v_main_~x~0_858)) (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_858 (* 4294967295 v_it_34)) 4294967296)))) (< v_main_~x~0_857 v_main_~x~0_858) (= v_main_~y~0_676 (+ (* v_main_~x~0_857 (- 1)) v_main_~x~0_858 v_main_~y~0_677))))) InVars {main_~y~0=v_main_~y~0_677, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_858, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_676, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_857, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15301#true} is VALID [2022-04-15 06:51:01,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {15301#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15301#true} is VALID [2022-04-15 06:51:01,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {15301#true} call #t~ret11 := main(); {15301#true} is VALID [2022-04-15 06:51:01,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15301#true} {15301#true} #61#return; {15301#true} is VALID [2022-04-15 06:51:01,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {15301#true} assume true; {15301#true} is VALID [2022-04-15 06:51:01,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {15301#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(10, 2);call #Ultimate.allocInit(12, 3); {15301#true} is VALID [2022-04-15 06:51:01,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {15301#true} call ULTIMATE.init(); {15301#true} is VALID [2022-04-15 06:51:01,235 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:01,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340917970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:01,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:01,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 19 [2022-04-15 06:51:06,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:06,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602457926] [2022-04-15 06:51:06,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602457926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:06,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:06,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:51:06,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036706335] [2022-04-15 06:51:06,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 06:51:06,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:06,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:51:06,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:06,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:51:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:06,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:51:06,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=624, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:51:06,424 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 26 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)