/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-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:41:18,395 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:41:18,397 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:41:18,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:41:18,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:41:18,435 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:41:18,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:41:18,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:41:18,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:41:18,445 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:41:18,445 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:41:18,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:41:18,447 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:41:18,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:41:18,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:41:18,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:41:18,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:41:18,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:41:18,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:41:18,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:41:18,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:41:18,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:41:18,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:41:18,462 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:41:18,463 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:41:18,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:41:18,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:41:18,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:41:18,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:41:18,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:41:18,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:41:18,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:41:18,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:41:18,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:41:18,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:41:18,469 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:41:18,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:41:18,470 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:41:18,470 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:41:18,470 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:41:18,471 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:41:18,472 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:41:18,472 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:41:18,481 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:41:18,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:41:18,482 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:41:18,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:41:18,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:41:18,483 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:41:18,483 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:41:18,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:41:18,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:41:18,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:41:18,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:41:18,484 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:41:18,484 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:41:18,485 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:41:18,485 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:41:18,485 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:41:18,485 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:41:18,485 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:41:18,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:41:18,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:41:18,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:41:18,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:41:18,716 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:41:18,717 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-15 06:41:18,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3f89c1e/f2ad14a0f5ad45ff8a6dd77d15b0313e/FLAGa17cbdc1d [2022-04-15 06:41:19,136 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:41:19,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-04-15 06:41:19,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3f89c1e/f2ad14a0f5ad45ff8a6dd77d15b0313e/FLAGa17cbdc1d [2022-04-15 06:41:19,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac3f89c1e/f2ad14a0f5ad45ff8a6dd77d15b0313e [2022-04-15 06:41:19,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:41:19,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:41:19,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:41:19,577 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:41:19,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:41:19,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ba88ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19, skipping insertion in model container [2022-04-15 06:41:19,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,585 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:41:19,594 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:41:19,718 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-de62.c[368,381] [2022-04-15 06:41:19,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:41:19,735 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:41:19,751 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-de62.c[368,381] [2022-04-15 06:41:19,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:41:19,769 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:41:19,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19 WrapperNode [2022-04-15 06:41:19,769 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:41:19,770 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:41:19,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:41:19,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:41:19,778 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,792 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:41:19,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:41:19,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:41:19,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:41:19,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (1/1) ... [2022-04-15 06:41:19,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:41:19,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:19,836 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:41:19,841 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:41:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:41:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:41:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:41:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:41:19,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:41:19,865 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:41:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:41:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:41:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:41:19,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:41:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:41:19,867 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:41:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:41:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:41:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:41:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:41:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:41:19,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:41:19,919 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:41:19,920 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:41:20,079 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:41:20,083 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:41:20,083 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 06:41:20,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:41:20 BoogieIcfgContainer [2022-04-15 06:41:20,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:41:20,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:41:20,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:41:20,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:41:20,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:41:19" (1/3) ... [2022-04-15 06:41:20,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55ea61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:41:20, skipping insertion in model container [2022-04-15 06:41:20,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:41:19" (2/3) ... [2022-04-15 06:41:20,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55ea61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:41:20, skipping insertion in model container [2022-04-15 06:41:20,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:41:20" (3/3) ... [2022-04-15 06:41:20,101 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.c [2022-04-15 06:41:20,104 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:41:20,104 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:41:20,131 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:41:20,135 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:41:20,136 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:41:20,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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:41:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:41:20,152 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:20,153 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:41:20,153 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:20,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:20,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 1 times [2022-04-15 06:41:20,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:20,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1022007714] [2022-04-15 06:41:20,172 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:41:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1370249117, now seen corresponding path program 2 times [2022-04-15 06:41:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:20,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202264363] [2022-04-15 06:41:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:20,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:20,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:20,315 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); {28#true} is VALID [2022-04-15 06:41:20,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:41:20,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 06:41:20,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:20,318 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); {28#true} is VALID [2022-04-15 06:41:20,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 06:41:20,318 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #94#return; {28#true} is VALID [2022-04-15 06:41:20,318 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret17 := main(); {28#true} is VALID [2022-04-15 06:41:20,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28#true} is VALID [2022-04-15 06:41:20,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !(~x~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 06:41:20,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} ~z~0 := ~y~0; {28#true} is VALID [2022-04-15 06:41:20,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} assume !(~z~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 06:41:20,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume !(~y~0 % 4294967296 > 0); {28#true} is VALID [2022-04-15 06:41:20,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 06:41:20,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume !(~z~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 06:41:20,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !(~y~0 % 4294967296 > 0); {29#false} is VALID [2022-04-15 06:41:20,320 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {29#false} is VALID [2022-04-15 06:41:20,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 06:41:20,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 06:41:20,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 06:41:20,321 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:41:20,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:20,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202264363] [2022-04-15 06:41:20,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202264363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:20,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:20,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:41:20,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:20,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1022007714] [2022-04-15 06:41:20,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1022007714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:20,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:20,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:41:20,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149062759] [2022-04-15 06:41:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:20,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:20,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,369 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:41:20,369 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:41:20,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:20,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:41:20,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:41:20,393 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 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 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:20,502 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-15 06:41:20,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:41:20,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:20,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 06:41:20,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 06:41:20,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 06:41:20,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:20,585 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:41:20,585 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 06:41:20,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:41:20,593 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:20,595 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:20,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 06:41:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 06:41:20,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:20,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:41:20,624 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:41:20,625 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:41:20,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:20,628 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 06:41:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 06:41:20,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:20,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:20,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-15 06:41:20,629 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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 18 states. [2022-04-15 06:41:20,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:20,632 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 06:41:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 06:41:20,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:20,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:20,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:20,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 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:41:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-15 06:41:20,634 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-15 06:41:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:20,635 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-15 06:41:20,635 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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:41:20,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 23 transitions. [2022-04-15 06:41:20,655 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:41:20,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 06:41:20,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:41:20,656 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:20,656 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:41:20,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:41:20,657 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:20,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:20,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 1 times [2022-04-15 06:41:20,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:20,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [573056701] [2022-04-15 06:41:20,658 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:41:20,658 INFO L85 PathProgramCache]: Analyzing trace with hash 2115201689, now seen corresponding path program 2 times [2022-04-15 06:41:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:20,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964822227] [2022-04-15 06:41:20,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:20,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:20,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:20,761 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(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); {194#true} is VALID [2022-04-15 06:41:20,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 06:41:20,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 06:41:20,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {202#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:20,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#(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); {194#true} is VALID [2022-04-15 06:41:20,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 06:41:20,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #94#return; {194#true} is VALID [2022-04-15 06:41:20,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret17 := main(); {194#true} is VALID [2022-04-15 06:41:20,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {194#true} is VALID [2022-04-15 06:41:20,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} ~z~0 := ~y~0; {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~x~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~z~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} assume !(~y~0 % 4294967296 > 0); {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} is VALID [2022-04-15 06:41:20,769 INFO L272 TraceCheckUtils]: 13: Hoare triple {199#(= (+ (* (- 4294967296) (div main_~x~0 4294967296)) main_~x~0) 0)} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {200#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:41:20,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {200#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {201#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:41:20,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {201#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-15 06:41:20,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 06:41:20,771 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:41:20,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:20,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964822227] [2022-04-15 06:41:20,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964822227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:20,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:20,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:20,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:20,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [573056701] [2022-04-15 06:41:20,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [573056701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:20,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:20,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:20,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349387133] [2022-04-15 06:41:20,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:20,774 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:20,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:20,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:20,787 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:41:20,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:20,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:20,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:41:20,789 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:20,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,000 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 06:41:21,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:21,000 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:21,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 06:41:21,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:21,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-15 06:41:21,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-15 06:41:21,048 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:21,050 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:41:21,050 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:41:21,050 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:21,053 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:21,053 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 35 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:21,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:41:21,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:41:21,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:21,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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:41:21,062 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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:41:21,062 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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:41:21,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,064 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 06:41:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:41:21,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:21,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:21,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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 23 states. [2022-04-15 06:41:21,066 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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 23 states. [2022-04-15 06:41:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,068 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 06:41:21,068 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:41:21,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:21,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:21,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:21,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:21,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 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:41:21,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-15 06:41:21,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 17 [2022-04-15 06:41:21,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:21,071 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-15 06:41:21,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:41:21,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-15 06:41:21,104 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:41:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:41:21,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:41:21,104 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:21,105 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:21,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:41:21,105 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:21,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:21,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 1 times [2022-04-15 06:41:21,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1141590490] [2022-04-15 06:41:21,106 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:41:21,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1181238037, now seen corresponding path program 2 times [2022-04-15 06:41:21,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:21,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531163895] [2022-04-15 06:41:21,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:21,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {377#(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); {371#true} is VALID [2022-04-15 06:41:21,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 06:41:21,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-15 06:41:21,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:21,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#(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); {371#true} is VALID [2022-04-15 06:41:21,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2022-04-15 06:41:21,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #94#return; {371#true} is VALID [2022-04-15 06:41:21,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret17 := main(); {371#true} is VALID [2022-04-15 06:41:21,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {371#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {371#true} is VALID [2022-04-15 06:41:21,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~x~0 % 4294967296 > 0); {371#true} is VALID [2022-04-15 06:41:21,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {371#true} ~z~0 := ~y~0; {371#true} is VALID [2022-04-15 06:41:21,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {371#true} assume !(~z~0 % 4294967296 > 0); {371#true} is VALID [2022-04-15 06:41:21,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(~y~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:21,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:21,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:21,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {372#false} is VALID [2022-04-15 06:41:21,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {372#false} assume !(~y~0 % 4294967296 > 0); {372#false} is VALID [2022-04-15 06:41:21,195 INFO L272 TraceCheckUtils]: 14: Hoare triple {372#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {372#false} is VALID [2022-04-15 06:41:21,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {372#false} ~cond := #in~cond; {372#false} is VALID [2022-04-15 06:41:21,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {372#false} assume 0 == ~cond; {372#false} is VALID [2022-04-15 06:41:21,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {372#false} assume !false; {372#false} is VALID [2022-04-15 06:41:21,196 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:41:21,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531163895] [2022-04-15 06:41:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531163895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:21,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:21,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:21,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:21,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1141590490] [2022-04-15 06:41:21,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1141590490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:21,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:21,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472466616] [2022-04-15 06:41:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:21,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:21,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,207 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:41:21,208 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:41:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:41:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:41:21,208 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,313 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2022-04-15 06:41:21,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:41:21,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-15 06:41:21,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-15 06:41:21,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-15 06:41:21,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:21,354 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:41:21,354 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:41:21,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:41:21,356 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:21,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 25 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:21,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:41:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:41:21,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:21,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:21,378 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:21,378 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:21,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,379 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-15 06:41:21,379 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 06:41:21,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:21,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:21,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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 33 states. [2022-04-15 06:41:21,380 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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 33 states. [2022-04-15 06:41:21,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,381 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2022-04-15 06:41:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 06:41:21,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:21,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:21,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:21,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-15 06:41:21,383 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 18 [2022-04-15 06:41:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:21,383 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-15 06:41:21,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-15 06:41:21,430 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:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 06:41:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:41:21,431 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:21,432 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:21,432 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:41:21,434 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:21,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:21,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 1 times [2022-04-15 06:41:21,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1512751270] [2022-04-15 06:41:21,437 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:41:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1710900860, now seen corresponding path program 2 times [2022-04-15 06:41:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:21,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062360052] [2022-04-15 06:41:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:21,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:21,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {615#(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); {609#true} is VALID [2022-04-15 06:41:21,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-15 06:41:21,502 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-15 06:41:21,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {609#true} call ULTIMATE.init(); {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:21,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#(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); {609#true} is VALID [2022-04-15 06:41:21,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-15 06:41:21,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {609#true} {609#true} #94#return; {609#true} is VALID [2022-04-15 06:41:21,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {609#true} call #t~ret17 := main(); {609#true} is VALID [2022-04-15 06:41:21,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {609#true} is VALID [2022-04-15 06:41:21,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {609#true} assume !(~x~0 % 4294967296 > 0); {609#true} is VALID [2022-04-15 06:41:21,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#true} ~z~0 := ~y~0; {609#true} is VALID [2022-04-15 06:41:21,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {609#true} assume !(~z~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:21,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:21,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:21,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {610#false} is VALID [2022-04-15 06:41:21,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {610#false} assume !(~z~0 % 4294967296 > 0); {610#false} is VALID [2022-04-15 06:41:21,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {610#false} assume !(~y~0 % 4294967296 > 0); {610#false} is VALID [2022-04-15 06:41:21,505 INFO L272 TraceCheckUtils]: 14: Hoare triple {610#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {610#false} is VALID [2022-04-15 06:41:21,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#false} ~cond := #in~cond; {610#false} is VALID [2022-04-15 06:41:21,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#false} assume 0 == ~cond; {610#false} is VALID [2022-04-15 06:41:21,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-04-15 06:41:21,506 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:41:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:21,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062360052] [2022-04-15 06:41:21,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062360052] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:21,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:21,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:21,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1512751270] [2022-04-15 06:41:21,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1512751270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:21,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:21,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:41:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205760026] [2022-04-15 06:41:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:21,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:21,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,522 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:41:21,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:41:21,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:41:21,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:41:21,524 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,610 INFO L93 Difference]: Finished difference Result 49 states and 69 transitions. [2022-04-15 06:41:21,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:41:21,611 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:21,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 06:41:21,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 06:41:21,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 06:41:21,636 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:21,637 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:41:21,638 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 06:41:21,638 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:41:21,638 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:21,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 28 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:21,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 06:41:21,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 06:41:21,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:21,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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:21,676 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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:21,676 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,677 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-15 06:41:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 06:41:21,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:21,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:21,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 37 states. [2022-04-15 06:41:21,682 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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 37 states. [2022-04-15 06:41:21,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:21,684 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-04-15 06:41:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 06:41:21,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:21,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:21,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:21,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.46875) internal successors, (47), 32 states have internal predecessors, (47), 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:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 06:41:21,686 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 18 [2022-04-15 06:41:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:21,686 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2022-04-15 06:41:21,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 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:41:21,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 06:41:21,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2022-04-15 06:41:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:41:21,732 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:21,732 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:21,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:41:21,732 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 375506293, now seen corresponding path program 1 times [2022-04-15 06:41:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:21,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1997666269] [2022-04-15 06:41:22,106 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:22,109 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:22,112 INFO L85 PathProgramCache]: Analyzing trace with hash -289672842, now seen corresponding path program 1 times [2022-04-15 06:41:22,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:22,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306555123] [2022-04-15 06:41:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:22,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:22,130 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:41:22,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:22,169 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:41:22,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:22,272 INFO L290 TraceCheckUtils]: 0: Hoare triple {875#(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); {866#true} is VALID [2022-04-15 06:41:22,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 06:41:22,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-15 06:41:22,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:22,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {875#(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); {866#true} is VALID [2022-04-15 06:41:22,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 06:41:22,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #94#return; {866#true} is VALID [2022-04-15 06:41:22,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret17 := main(); {866#true} is VALID [2022-04-15 06:41:22,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {871#(= main_~y~0 0)} is VALID [2022-04-15 06:41:22,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 06:41:22,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:41:22,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [98] L23-2-->L29-1_primed: Formula: (let ((.cse0 (mod v_main_~z~0_12 4294967296)) (.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_17 v_main_~x~0_16)) (.cse4 (= v_main_~z~0_12 v_main_~z~0_11))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= v_main_~x~0_16 (+ v_main_~x~0_17 v_main_~z~0_12 (* (- 1) v_main_~z~0_11))) (< v_main_~z~0_11 v_main_~z~0_12) (< 0 .cse0) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_11 v_it_1 1) v_main_~z~0_12)) (< 0 (mod (+ v_main_~z~0_12 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~x~0=v_main_~x~0_17, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_16, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:22,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [97] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:22,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:22,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {867#false} is VALID [2022-04-15 06:41:22,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#false} assume !(~x~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 06:41:22,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#false} assume !(~z~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 06:41:22,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {867#false} is VALID [2022-04-15 06:41:22,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#false} assume !(~y~0 % 4294967296 > 0); {867#false} is VALID [2022-04-15 06:41:22,278 INFO L272 TraceCheckUtils]: 16: Hoare triple {867#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {867#false} is VALID [2022-04-15 06:41:22,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {867#false} ~cond := #in~cond; {867#false} is VALID [2022-04-15 06:41:22,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#false} assume 0 == ~cond; {867#false} is VALID [2022-04-15 06:41:22,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 06:41:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:22,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:22,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306555123] [2022-04-15 06:41:22,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306555123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:22,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:22,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:41:22,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:22,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1997666269] [2022-04-15 06:41:22,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1997666269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:22,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:22,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:41:22,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290968358] [2022-04-15 06:41:22,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:22,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,318 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:41:22,318 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:41:22,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:22,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:41:22,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:41:22,319 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:22,519 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 06:41:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:41:22,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 06:41:22,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 06:41:22,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-15 06:41:22,553 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:41:22,554 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:41:22,554 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:41:22,555 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:41:22,555 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:22,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:41:22,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:41:22,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:22,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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:22,575 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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:22,576 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:22,577 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-15 06:41:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-15 06:41:22,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:22,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:22,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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:41:22,578 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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:41:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:22,579 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-04-15 06:41:22,579 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-15 06:41:22,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:22,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:22,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:22,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:22,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 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:22,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-04-15 06:41:22,580 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 20 [2022-04-15 06:41:22,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:22,580 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-04-15 06:41:22,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 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:41:22,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 45 transitions. [2022-04-15 06:41:22,633 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:41:22,633 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-04-15 06:41:22,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:41:22,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:22,634 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:22,634 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:41:22,634 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:22,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:22,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1300031754, now seen corresponding path program 1 times [2022-04-15 06:41:22,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:22,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [689365979] [2022-04-15 06:41:23,190 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:23,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:23,194 INFO L85 PathProgramCache]: Analyzing trace with hash 313424023, now seen corresponding path program 1 times [2022-04-15 06:41:23,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:23,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341461310] [2022-04-15 06:41:23,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:23,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:23,202 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:41:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,224 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:41:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(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); {1112#true} is VALID [2022-04-15 06:41:23,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1112#true} assume true; {1112#true} is VALID [2022-04-15 06:41:23,272 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1112#true} {1112#true} #94#return; {1112#true} is VALID [2022-04-15 06:41:23,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {1112#true} call ULTIMATE.init(); {1119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:23,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#(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); {1112#true} is VALID [2022-04-15 06:41:23,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1112#true} assume true; {1112#true} is VALID [2022-04-15 06:41:23,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1112#true} {1112#true} #94#return; {1112#true} is VALID [2022-04-15 06:41:23,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {1112#true} call #t~ret17 := main(); {1112#true} is VALID [2022-04-15 06:41:23,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1112#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1112#true} is VALID [2022-04-15 06:41:23,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse4 (mod v_main_~x~0_25 4294967296)) (.cse1 (= v_main_~y~0_15 v_main_~y~0_14)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~x~0_25 v_main_~x~0_24))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_25 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_15 v_it_2 1) v_main_~y~0_14)))) (< 0 .cse4) (= v_main_~x~0_24 (+ v_main_~x~0_25 v_main_~y~0_15 (* (- 1) v_main_~y~0_14))) (< v_main_~y~0_15 v_main_~y~0_14)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_14, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1112#true} is VALID [2022-04-15 06:41:23,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#true} [99] 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[] {1112#true} is VALID [2022-04-15 06:41:23,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {1112#true} ~z~0 := ~y~0; {1117#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:41:23,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1117#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1118#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:23,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {1118#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1113#false} is VALID [2022-04-15 06:41:23,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {1113#false} assume !(~y~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-15 06:41:23,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {1113#false} assume !(~x~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-15 06:41:23,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {1113#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1113#false} is VALID [2022-04-15 06:41:23,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {1113#false} assume !(~z~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-15 06:41:23,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {1113#false} assume !(~y~0 % 4294967296 > 0); {1113#false} is VALID [2022-04-15 06:41:23,286 INFO L272 TraceCheckUtils]: 16: Hoare triple {1113#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1113#false} is VALID [2022-04-15 06:41:23,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {1113#false} ~cond := #in~cond; {1113#false} is VALID [2022-04-15 06:41:23,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {1113#false} assume 0 == ~cond; {1113#false} is VALID [2022-04-15 06:41:23,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {1113#false} assume !false; {1113#false} is VALID [2022-04-15 06:41:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:23,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341461310] [2022-04-15 06:41:23,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341461310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:23,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:23,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:41:23,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:23,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [689365979] [2022-04-15 06:41:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [689365979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:23,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:23,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:23,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954286245] [2022-04-15 06:41:23,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:23,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:23,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,328 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:41:23,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:23,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:23,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:23,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:41:23,329 INFO L87 Difference]: Start difference. First operand 33 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:23,477 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 06:41:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:23,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 06:41:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-15 06:41:23,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-15 06:41:23,514 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:41:23,514 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:41:23,515 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:41:23,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:23,516 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:23,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:41:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:41:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:41:23,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:23,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 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:41:23,539 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 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:41:23,539 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 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:41:23,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:23,540 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-15 06:41:23,540 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 06:41:23,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:23,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:23,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 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 30 states. [2022-04-15 06:41:23,541 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 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 30 states. [2022-04-15 06:41:23,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:23,542 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-04-15 06:41:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 06:41:23,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:23,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:23,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:23,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 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:41:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-15 06:41:23,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-04-15 06:41:23,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:23,546 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-15 06:41:23,546 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 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:41:23,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 40 transitions. [2022-04-15 06:41:23,583 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:41:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 06:41:23,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:41:23,584 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:23,584 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:23,584 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:41:23,584 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:23,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 30273528, now seen corresponding path program 1 times [2022-04-15 06:41:23,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:23,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977301644] [2022-04-15 06:41:23,762 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:23,764 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:23,766 INFO L85 PathProgramCache]: Analyzing trace with hash 511781431, now seen corresponding path program 1 times [2022-04-15 06:41:23,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:23,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224205906] [2022-04-15 06:41:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:23,775 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:41:23,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,789 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:41:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {1340#(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); {1332#true} is VALID [2022-04-15 06:41:23,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-15 06:41:23,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1340#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:23,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {1340#(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); {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret17 := main(); {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~x~0_32 v_main_~x~0_31)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~y~0_23 v_main_~y~0_22))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_23 v_main_~y~0_22) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_32 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~y~0_23 v_it_3 1) v_main_~y~0_22)))) (< 0 .cse0) (= (+ v_main_~x~0_32 (* (- 1) v_main_~y~0_22) v_main_~y~0_23) v_main_~x~0_31)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_31, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1332#true} is VALID [2022-04-15 06:41:23,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#true} [101] 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[] {1332#true} is VALID [2022-04-15 06:41:23,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#true} ~z~0 := ~y~0; {1337#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:41:23,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#(= (+ 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; {1338#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:23,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {1338#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 1))) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1339#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:41:23,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#(and (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-15 06:41:23,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {1333#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1333#false} is VALID [2022-04-15 06:41:23,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1333#false} assume !(~x~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-15 06:41:23,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1333#false} assume !(~z~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {1333#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {1333#false} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L272 TraceCheckUtils]: 17: Hoare triple {1333#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2022-04-15 06:41:23,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224205906] [2022-04-15 06:41:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224205906] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876263764] [2022-04-15 06:41:23,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:23,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:23,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:23,897 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:41:23,898 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:41:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:23,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:24,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2022-04-15 06:41:24,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#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); {1332#true} is VALID [2022-04-15 06:41:24,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-15 06:41:24,042 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-15 06:41:24,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret17 := main(); {1332#true} is VALID [2022-04-15 06:41:24,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1332#true} is VALID [2022-04-15 06:41:24,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~x~0_32 v_main_~x~0_31)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~y~0_23 v_main_~y~0_22))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_23 v_main_~y~0_22) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_32 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~y~0_23 v_it_3 1) v_main_~y~0_22)))) (< 0 .cse0) (= (+ v_main_~x~0_32 (* (- 1) v_main_~y~0_22) v_main_~y~0_23) v_main_~x~0_31)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_31, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1332#true} is VALID [2022-04-15 06:41:24,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#true} [101] 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[] {1332#true} is VALID [2022-04-15 06:41:24,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#true} ~z~0 := ~y~0; {1337#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:41:24,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {1337#(= (+ 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; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,044 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:24,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:24,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:24,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-15 06:41:24,048 INFO L272 TraceCheckUtils]: 17: Hoare triple {1333#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1333#false} is VALID [2022-04-15 06:41:24,048 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2022-04-15 06:41:24,048 INFO L290 TraceCheckUtils]: 19: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2022-04-15 06:41:24,048 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2022-04-15 06:41:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:24,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:24,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {1333#false} assume !false; {1333#false} is VALID [2022-04-15 06:41:24,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {1333#false} assume 0 == ~cond; {1333#false} is VALID [2022-04-15 06:41:24,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#false} ~cond := #in~cond; {1333#false} is VALID [2022-04-15 06:41:24,129 INFO L272 TraceCheckUtils]: 17: Hoare triple {1333#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1333#false} is VALID [2022-04-15 06:41:24,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1333#false} is VALID [2022-04-15 06:41:24,130 INFO L290 TraceCheckUtils]: 15: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:24,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:24,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1381#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:24,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {1371#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {1439#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod 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; {1371#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:24,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#true} ~z~0 := ~y~0; {1439#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:24,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {1332#true} [101] 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[] {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {1332#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_32 4294967296)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= v_main_~x~0_32 v_main_~x~0_31)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (= v_main_~y~0_23 v_main_~y~0_22))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_23 v_main_~y~0_22) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_32 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~y~0_23 v_it_3 1) v_main_~y~0_22)))) (< 0 .cse0) (= (+ v_main_~x~0_32 (* (- 1) v_main_~y~0_22) v_main_~y~0_23) v_main_~x~0_31)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_31, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {1332#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {1332#true} call #t~ret17 := main(); {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1332#true} {1332#true} #94#return; {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {1332#true} assume true; {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {1332#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); {1332#true} is VALID [2022-04-15 06:41:24,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {1332#true} call ULTIMATE.init(); {1332#true} is VALID [2022-04-15 06:41:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:24,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876263764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:24,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:24,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-04-15 06:41:24,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:24,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977301644] [2022-04-15 06:41:24,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977301644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:24,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:24,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:41:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395824964] [2022-04-15 06:41:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:24,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,176 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:41:24,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:41:24,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:24,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:41:24,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:41:24,177 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:24,430 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-15 06:41:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:41:24,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 06:41:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 06:41:24,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 06:41:24,466 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:41:24,467 INFO L225 Difference]: With dead ends: 37 [2022-04-15 06:41:24,467 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:41:24,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:41:24,467 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:24,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 40 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:41:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:41:24,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:24,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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:41:24,485 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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:41:24,485 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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:41:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:24,486 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 06:41:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 06:41:24,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:24,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:24,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 27 states. [2022-04-15 06:41:24,487 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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 27 states. [2022-04-15 06:41:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:24,488 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2022-04-15 06:41:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 06:41:24,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:24,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:24,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:24,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:24,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 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:41:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-04-15 06:41:24,489 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 21 [2022-04-15 06:41:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:24,489 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-04-15 06:41:24,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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:41:24,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 35 transitions. [2022-04-15 06:41:24,523 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:41:24,524 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-15 06:41:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:41:24,524 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:24,524 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:24,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:41:24,725 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:24,725 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:24,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1232820840, now seen corresponding path program 1 times [2022-04-15 06:41:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:24,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1551124051] [2022-04-15 06:41:26,943 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:26,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:26,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1252673431, now seen corresponding path program 1 times [2022-04-15 06:41:26,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:26,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877546847] [2022-04-15 06:41:26,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:26,954 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:41:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:26,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:41:27,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:27,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {1666#(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); {1659#true} is VALID [2022-04-15 06:41:27,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-15 06:41:27,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-15 06:41:27,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1666#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:27,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {1666#(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); {1659#true} is VALID [2022-04-15 06:41:27,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-15 06:41:27,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-15 06:41:27,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {1659#true} call #t~ret17 := main(); {1659#true} is VALID [2022-04-15 06:41:27,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {1659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1659#true} is VALID [2022-04-15 06:41:27,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< 0 .cse0) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_34 v_it_4 1) v_main_~y~0_33)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_42) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_41 (+ v_main_~x~0_42 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1659#true} is VALID [2022-04-15 06:41:27,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#true} [103] 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[] {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:27,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:27,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#(<= 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; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1660#false} is VALID [2022-04-15 06:41:27,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#false} assume !(~z~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#false} assume !(~y~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,023 INFO L272 TraceCheckUtils]: 17: Hoare triple {1660#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-15 06:41:27,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-15 06:41:27,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-15 06:41:27,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-15 06:41:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877546847] [2022-04-15 06:41:27,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877546847] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459556952] [2022-04-15 06:41:27,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:27,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:27,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:27,025 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:41:27,026 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:41:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:27,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 06:41:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:27,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:27,342 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-15 06:41:27,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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); {1659#true} is VALID [2022-04-15 06:41:27,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-15 06:41:27,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-15 06:41:27,343 INFO L272 TraceCheckUtils]: 4: Hoare triple {1659#true} call #t~ret17 := main(); {1659#true} is VALID [2022-04-15 06:41:27,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {1659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1659#true} is VALID [2022-04-15 06:41:27,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< 0 .cse0) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_34 v_it_4 1) v_main_~y~0_33)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_42) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_41 (+ v_main_~x~0_42 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1659#true} is VALID [2022-04-15 06:41:27,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#true} [103] 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[] {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:27,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:27,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {1664#(<= 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; {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:27,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:27,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:27,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {1697#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#false} assume !(~z~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#false} assume !(~y~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L272 TraceCheckUtils]: 17: Hoare triple {1660#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 19: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-15 06:41:27,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-15 06:41:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:27,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:27,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-15 06:41:27,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-15 06:41:27,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-15 06:41:27,433 INFO L272 TraceCheckUtils]: 17: Hoare triple {1660#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-15 06:41:27,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1660#false} assume !(~y~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1660#false} assume !(~z~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {1660#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1660#false} is VALID [2022-04-15 06:41:27,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1660#false} is VALID [2022-04-15 06:41:27,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~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; {1665#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:41:27,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 06:41:27,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {1659#true} [103] 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[] {1764#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 06:41:27,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {1659#true} [104] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< 0 .cse0) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_34 v_it_4 1) v_main_~y~0_33)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_42) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_41 (+ v_main_~x~0_42 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1659#true} is VALID [2022-04-15 06:41:27,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {1659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1659#true} is VALID [2022-04-15 06:41:27,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {1659#true} call #t~ret17 := main(); {1659#true} is VALID [2022-04-15 06:41:27,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1659#true} {1659#true} #94#return; {1659#true} is VALID [2022-04-15 06:41:27,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {1659#true} assume true; {1659#true} is VALID [2022-04-15 06:41:27,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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); {1659#true} is VALID [2022-04-15 06:41:27,468 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-15 06:41:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:27,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459556952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:27,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:27,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 06:41:27,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:27,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1551124051] [2022-04-15 06:41:27,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1551124051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:27,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:27,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095939947] [2022-04-15 06:41:27,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:27,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:27,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,507 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:41:27,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:27,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:27,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:41:27,508 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:27,800 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-15 06:41:27,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:41:27,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-15 06:41:27,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-04-15 06:41:27,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-04-15 06:41:27,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:27,864 INFO L225 Difference]: With dead ends: 55 [2022-04-15 06:41:27,864 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 06:41:27,865 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:41:27,865 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:27,866 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 32 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 06:41:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2022-04-15 06:41:27,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:27,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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:41:27,904 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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:41:27,904 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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:41:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:27,906 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-15 06:41:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2022-04-15 06:41:27,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:27,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:27,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 47 states. [2022-04-15 06:41:27,906 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 47 states. [2022-04-15 06:41:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:27,908 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-15 06:41:27,908 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 66 transitions. [2022-04-15 06:41:27,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:27,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:27,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:27,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:27,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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:41:27,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-15 06:41:27,909 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2022-04-15 06:41:27,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:27,909 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-15 06:41:27,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 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:41:27,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-15 06:41:27,961 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:41:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-15 06:41:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:41:27,961 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:27,961 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:27,981 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:41:28,162 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,SelfDestructingSolverStorable7 [2022-04-15 06:41:28,162 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -29884763, now seen corresponding path program 1 times [2022-04-15 06:41:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:28,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1660750216] [2022-04-15 06:41:28,368 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:28,369 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1705061574, now seen corresponding path program 1 times [2022-04-15 06:41:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:28,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849995414] [2022-04-15 06:41:28,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:28,385 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:41:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:28,412 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:41:28,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:28,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {2077#(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); {2070#true} is VALID [2022-04-15 06:41:28,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-15 06:41:28,442 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-15 06:41:28,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:28,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#(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); {2070#true} is VALID [2022-04-15 06:41:28,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-15 06:41:28,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-15 06:41:28,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret17 := main(); {2070#true} is VALID [2022-04-15 06:41:28,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#true} is VALID [2022-04-15 06:41:28,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (mod v_main_~x~0_53 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42))) (or (and .cse0 (= |v_main_#t~post5_20| |v_main_#t~post5_19|) .cse1 (= |v_main_#t~post6_20| |v_main_#t~post6_19|)) (and (< 0 .cse2) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_53 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_43 v_it_5 1) v_main_~y~0_42)) (not (<= 1 v_it_5)))) (= v_main_~x~0_52 (+ v_main_~x~0_53 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42)) (and .cse0 (<= .cse2 0) .cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_20|) (= |v_main_#t~post6_19| |v_main_#t~post6_20|)))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_20|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2070#true} is VALID [2022-04-15 06:41:28,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} [105] 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[] {2070#true} is VALID [2022-04-15 06:41:28,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~z~0 := ~y~0; {2070#true} is VALID [2022-04-15 06:41:28,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:28,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:28,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#false} assume !(~y~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L272 TraceCheckUtils]: 18: Hoare triple {2071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-15 06:41:28,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:28,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849995414] [2022-04-15 06:41:28,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849995414] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:28,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468898903] [2022-04-15 06:41:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:28,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:28,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:28,464 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:41:28,465 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:41:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:28,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:28,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:28,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#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); {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret17 := main(); {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (mod v_main_~x~0_53 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42))) (or (and .cse0 (= |v_main_#t~post5_20| |v_main_#t~post5_19|) .cse1 (= |v_main_#t~post6_20| |v_main_#t~post6_19|)) (and (< 0 .cse2) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_53 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_43 v_it_5 1) v_main_~y~0_42)) (not (<= 1 v_it_5)))) (= v_main_~x~0_52 (+ v_main_~x~0_53 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42)) (and .cse0 (<= .cse2 0) .cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_20|) (= |v_main_#t~post6_19| |v_main_#t~post6_20|)))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_20|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} [105] 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[] {2070#true} is VALID [2022-04-15 06:41:28,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~z~0 := ~y~0; {2070#true} is VALID [2022-04-15 06:41:28,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:28,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:28,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#false} assume !(~y~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L272 TraceCheckUtils]: 18: Hoare triple {2071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-15 06:41:28,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:28,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:28,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {2071#false} assume !false; {2071#false} is VALID [2022-04-15 06:41:28,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#false} assume 0 == ~cond; {2071#false} is VALID [2022-04-15 06:41:28,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#false} ~cond := #in~cond; {2071#false} is VALID [2022-04-15 06:41:28,784 INFO L272 TraceCheckUtils]: 18: Hoare triple {2071#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2071#false} is VALID [2022-04-15 06:41:28,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#false} assume !(~y~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-15 06:41:28,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2071#false} is VALID [2022-04-15 06:41:28,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2071#false} is VALID [2022-04-15 06:41:28,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2076#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:28,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:28,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {2070#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2075#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:28,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {2070#true} ~z~0 := ~y~0; {2070#true} is VALID [2022-04-15 06:41:28,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {2070#true} [105] 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[] {2070#true} is VALID [2022-04-15 06:41:28,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {2070#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (mod v_main_~x~0_53 4294967296)) (.cse1 (= v_main_~y~0_43 v_main_~y~0_42))) (or (and .cse0 (= |v_main_#t~post5_20| |v_main_#t~post5_19|) .cse1 (= |v_main_#t~post6_20| |v_main_#t~post6_19|)) (and (< 0 .cse2) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_53 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_43 v_it_5 1) v_main_~y~0_42)) (not (<= 1 v_it_5)))) (= v_main_~x~0_52 (+ v_main_~x~0_53 v_main_~y~0_43 (* (- 1) v_main_~y~0_42))) (< v_main_~y~0_43 v_main_~y~0_42)) (and .cse0 (<= .cse2 0) .cse1 (= |v_main_#t~post5_19| |v_main_#t~post5_20|) (= |v_main_#t~post6_19| |v_main_#t~post6_20|)))) InVars {main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_20|} OutVars{main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2070#true} is VALID [2022-04-15 06:41:28,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {2070#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2070#true} is VALID [2022-04-15 06:41:28,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {2070#true} call #t~ret17 := main(); {2070#true} is VALID [2022-04-15 06:41:28,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2070#true} {2070#true} #94#return; {2070#true} is VALID [2022-04-15 06:41:28,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {2070#true} assume true; {2070#true} is VALID [2022-04-15 06:41:28,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {2070#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); {2070#true} is VALID [2022-04-15 06:41:28,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {2070#true} call ULTIMATE.init(); {2070#true} is VALID [2022-04-15 06:41:28,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:28,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468898903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:28,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:28,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 06:41:28,808 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:28,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1660750216] [2022-04-15 06:41:28,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1660750216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:28,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:28,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:41:28,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466348785] [2022-04-15 06:41:28,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:28,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:28,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:28,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:28,826 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:41:28,826 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:41:28,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:28,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:41:28,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:41:28,827 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:29,076 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-04-15 06:41:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:41:29,077 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 06:41:29,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-04-15 06:41:29,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-04-15 06:41:29,117 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:41:29,118 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:41:29,118 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:41:29,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:41:29,119 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:29,119 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:41:29,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-04-15 06:41:29,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:29,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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:29,167 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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:29,167 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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:29,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:29,168 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 06:41:29,168 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-15 06:41:29,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:29,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:29,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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:29,169 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:29,169 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-15 06:41:29,169 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-15 06:41:29,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:29,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:29,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:29,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 33 states have internal predecessors, (49), 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:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2022-04-15 06:41:29,171 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 53 transitions. Word has length 22 [2022-04-15 06:41:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:29,171 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 53 transitions. [2022-04-15 06:41:29,171 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 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:41:29,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 53 transitions. [2022-04-15 06:41:29,235 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:41:29,236 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 53 transitions. [2022-04-15 06:41:29,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:41:29,236 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:29,236 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:29,255 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:41:29,436 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:29,437 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:29,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1372943636, now seen corresponding path program 1 times [2022-04-15 06:41:29,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:29,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367544927] [2022-04-15 06:41:29,640 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:29,642 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:29,644 INFO L85 PathProgramCache]: Analyzing trace with hash 806957941, now seen corresponding path program 1 times [2022-04-15 06:41:29,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:29,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873390264] [2022-04-15 06:41:29,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:29,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:29,653 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:41:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:29,666 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:41:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:29,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {2478#(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); {2467#true} is VALID [2022-04-15 06:41:29,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-15 06:41:29,783 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-15 06:41:29,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {2467#true} call ULTIMATE.init(); {2478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:29,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {2478#(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); {2467#true} is VALID [2022-04-15 06:41:29,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-15 06:41:29,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-15 06:41:29,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {2467#true} call #t~ret17 := main(); {2467#true} is VALID [2022-04-15 06:41:29,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {2467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2472#(= main_~y~0 0)} is VALID [2022-04-15 06:41:29,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#(= main_~y~0 0)} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_63 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_53 v_it_6 1) v_main_~y~0_52)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_63 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_53 (* (- 1) v_main_~y~0_52))) (< v_main_~y~0_53 v_main_~y~0_52)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2473#(or (and (<= 0 main_~y~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:41:29,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {2473#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [107] 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[] {2474#(or (and (<= 0 main_~y~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:41:29,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {2474#(or (and (<= 0 main_~y~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; {2475#(or (and (<= main_~z~0 0) (<= 0 main_~z~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:41:29,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~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; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:29,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:29,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:29,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:29,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:29,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:29,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:29,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:29,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2468#false} is VALID [2022-04-15 06:41:29,800 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2468#false} is VALID [2022-04-15 06:41:29,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#false} ~cond := #in~cond; {2468#false} is VALID [2022-04-15 06:41:29,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {2468#false} assume 0 == ~cond; {2468#false} is VALID [2022-04-15 06:41:29,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {2468#false} assume !false; {2468#false} is VALID [2022-04-15 06:41:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873390264] [2022-04-15 06:41:29,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873390264] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:29,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991666303] [2022-04-15 06:41:29,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:29,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:29,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:29,802 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:41:29,802 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:41:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:29,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:29,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:30,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {2467#true} call ULTIMATE.init(); {2467#true} is VALID [2022-04-15 06:41:30,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {2467#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); {2467#true} is VALID [2022-04-15 06:41:30,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-15 06:41:30,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-15 06:41:30,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {2467#true} call #t~ret17 := main(); {2467#true} is VALID [2022-04-15 06:41:30,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {2467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2467#true} is VALID [2022-04-15 06:41:30,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {2467#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_63 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_53 v_it_6 1) v_main_~y~0_52)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_63 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_53 (* (- 1) v_main_~y~0_52))) (< v_main_~y~0_53 v_main_~y~0_52)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2467#true} is VALID [2022-04-15 06:41:30,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {2467#true} [107] 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[] {2467#true} is VALID [2022-04-15 06:41:30,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#true} ~z~0 := ~y~0; {2506#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:41:30,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {2506#(= 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; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:30,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:30,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2468#false} is VALID [2022-04-15 06:41:30,097 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2468#false} is VALID [2022-04-15 06:41:30,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#false} ~cond := #in~cond; {2468#false} is VALID [2022-04-15 06:41:30,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {2468#false} assume 0 == ~cond; {2468#false} is VALID [2022-04-15 06:41:30,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2468#false} assume !false; {2468#false} is VALID [2022-04-15 06:41:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:30,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:30,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {2468#false} assume !false; {2468#false} is VALID [2022-04-15 06:41:30,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {2468#false} assume 0 == ~cond; {2468#false} is VALID [2022-04-15 06:41:30,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {2468#false} ~cond := #in~cond; {2468#false} is VALID [2022-04-15 06:41:30,320 INFO L272 TraceCheckUtils]: 18: Hoare triple {2468#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2468#false} is VALID [2022-04-15 06:41:30,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2468#false} is VALID [2022-04-15 06:41:30,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !(~y~0 % 4294967296 > 0); {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:30,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2477#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:41:30,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2582#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) 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; {2476#(<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:30,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#true} ~z~0 := ~y~0; {2582#(or (<= main_~y~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:41:30,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {2467#true} [107] 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[] {2467#true} is VALID [2022-04-15 06:41:30,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {2467#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_63 4294967296)) (.cse1 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse2 (= v_main_~y~0_53 v_main_~y~0_52)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= |v_main_#t~post6_25| |v_main_#t~post6_24|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_53 v_it_6 1) v_main_~y~0_52)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_63 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_53 (* (- 1) v_main_~y~0_52))) (< v_main_~y~0_53 v_main_~y~0_52)) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_53, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_52, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2467#true} is VALID [2022-04-15 06:41:30,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {2467#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2467#true} is VALID [2022-04-15 06:41:30,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {2467#true} call #t~ret17 := main(); {2467#true} is VALID [2022-04-15 06:41:30,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2467#true} {2467#true} #94#return; {2467#true} is VALID [2022-04-15 06:41:30,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {2467#true} assume true; {2467#true} is VALID [2022-04-15 06:41:30,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {2467#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); {2467#true} is VALID [2022-04-15 06:41:30,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {2467#true} call ULTIMATE.init(); {2467#true} is VALID [2022-04-15 06:41:30,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:30,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991666303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:30,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:30,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 11 [2022-04-15 06:41:31,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:31,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367544927] [2022-04-15 06:41:31,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367544927] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:31,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:31,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468275526] [2022-04-15 06:41:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:31,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:31,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:31,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:31,580 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:41:31,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-04-15 06:41:31,581 INFO L87 Difference]: Start difference. First operand 38 states and 53 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:31,905 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-04-15 06:41:31,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:41:31,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:31,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-15 06:41:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:31,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-15 06:41:31,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-15 06:41:32,070 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:41:32,071 INFO L225 Difference]: With dead ends: 51 [2022-04-15 06:41:32,071 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 06:41:32,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:41:32,072 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:32,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 32 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-04-15 06:41:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 06:41:32,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2022-04-15 06:41:32,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:32,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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:32,149 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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:32,149 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:32,151 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-15 06:41:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-15 06:41:32,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:32,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:32,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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 46 states. [2022-04-15 06:41:32,152 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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 46 states. [2022-04-15 06:41:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:32,152 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2022-04-15 06:41:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2022-04-15 06:41:32,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:32,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:32,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:32,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 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:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-04-15 06:41:32,153 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 22 [2022-04-15 06:41:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:32,154 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-04-15 06:41:32,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 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:41:32,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 60 transitions. [2022-04-15 06:41:32,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-04-15 06:41:32,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:41:32,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:32,957 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:32,981 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:41:33,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:33,159 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -353925126, now seen corresponding path program 1 times [2022-04-15 06:41:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:33,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897177654] [2022-04-15 06:41:33,374 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:33,376 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash 965938553, now seen corresponding path program 1 times [2022-04-15 06:41:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:33,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034512269] [2022-04-15 06:41:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:33,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:33,386 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:41:33,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:33,435 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:41:33,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:33,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {2909#(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); {2900#true} is VALID [2022-04-15 06:41:33,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-15 06:41:33,495 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-15 06:41:33,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2909#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:33,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {2909#(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); {2900#true} is VALID [2022-04-15 06:41:33,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-15 06:41:33,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-15 06:41:33,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret17 := main(); {2900#true} is VALID [2022-04-15 06:41:33,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2900#true} is VALID [2022-04-15 06:41:33,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_73 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72))) (or (and (= v_main_~x~0_72 (+ v_main_~x~0_73 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_73 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_7 1) v_main_~y~0_63)) (not (<= 1 v_it_7)))) (< v_main_~y~0_64 v_main_~y~0_63) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) (= |v_main_#t~post6_29| |v_main_#t~post6_30|) (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse1 .cse2 (= |v_main_#t~post5_30| |v_main_#t~post5_29|) (= |v_main_#t~post6_30| |v_main_#t~post6_29|)))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_30|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_29|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2900#true} is VALID [2022-04-15 06:41:33,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#true} [109] 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[] {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2905#(<= 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; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,504 INFO L272 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:41:33,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {2907#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2908#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:41:33,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {2908#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2901#false} is VALID [2022-04-15 06:41:33,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2022-04-15 06:41:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:33,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034512269] [2022-04-15 06:41:33,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034512269] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:33,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768798566] [2022-04-15 06:41:33,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:33,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:33,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:33,520 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:41:33,523 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:41:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:33,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:33,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:33,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#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); {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret17 := main(); {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_73 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72))) (or (and (= v_main_~x~0_72 (+ v_main_~x~0_73 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_73 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_7 1) v_main_~y~0_63)) (not (<= 1 v_it_7)))) (< v_main_~y~0_64 v_main_~y~0_63) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) (= |v_main_#t~post6_29| |v_main_#t~post6_30|) (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse1 .cse2 (= |v_main_#t~post5_30| |v_main_#t~post5_29|) (= |v_main_#t~post6_30| |v_main_#t~post6_29|)))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_30|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_29|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#true} [109] 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[] {2900#true} is VALID [2022-04-15 06:41:33,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {2900#true} ~z~0 := ~y~0; {2900#true} is VALID [2022-04-15 06:41:33,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {2900#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2900#true} is VALID [2022-04-15 06:41:33,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#true} assume !(~z~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-15 06:41:33,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2900#true} is VALID [2022-04-15 06:41:33,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2900#true} assume !(~y~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-15 06:41:33,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2900#true} is VALID [2022-04-15 06:41:33,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#true} assume !(~x~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,763 INFO L272 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:41:33,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:41:33,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2901#false} is VALID [2022-04-15 06:41:33,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2022-04-15 06:41:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:33,764 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:33,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {2901#false} assume !false; {2901#false} is VALID [2022-04-15 06:41:33,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {2974#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2901#false} is VALID [2022-04-15 06:41:33,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2974#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:41:33,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {2970#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:41:33,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2906#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {2900#true} assume !(~x~0 % 4294967296 > 0); {2905#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2900#true} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {2900#true} assume !(~y~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {2900#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2900#true} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {2900#true} assume !(~z~0 % 4294967296 > 0); {2900#true} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {2900#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2900#true} is VALID [2022-04-15 06:41:33,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {2900#true} ~z~0 := ~y~0; {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {2900#true} [109] 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[] {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {2900#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_73 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= v_main_~x~0_73 v_main_~x~0_72))) (or (and (= v_main_~x~0_72 (+ v_main_~x~0_73 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_73 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_7 1) v_main_~y~0_63)) (not (<= 1 v_it_7)))) (< v_main_~y~0_64 v_main_~y~0_63) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) (= |v_main_#t~post6_29| |v_main_#t~post6_30|) (= |v_main_#t~post5_29| |v_main_#t~post5_30|)) (and .cse1 .cse2 (= |v_main_#t~post5_30| |v_main_#t~post5_29|) (= |v_main_#t~post6_30| |v_main_#t~post6_29|)))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_30|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_72, main_#t~post6=|v_main_#t~post6_29|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {2900#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {2900#true} call #t~ret17 := main(); {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2900#true} {2900#true} #94#return; {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {2900#true} assume true; {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2900#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); {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {2900#true} call ULTIMATE.init(); {2900#true} is VALID [2022-04-15 06:41:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:33,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768798566] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:33,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:33,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:41:34,044 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897177654] [2022-04-15 06:41:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897177654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:34,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:41:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066461181] [2022-04-15 06:41:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:34,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,045 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:34,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,066 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:41:34,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:41:34,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:34,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:41:34,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:41:34,067 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:34,597 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-04-15 06:41:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:41:34,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-15 06:41:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 65 transitions. [2022-04-15 06:41:34,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 65 transitions. [2022-04-15 06:41:34,665 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:41:34,666 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:41:34,666 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 06:41:34,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 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:41:34,667 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:34,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 36 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:34,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 06:41:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2022-04-15 06:41:34,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:34,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 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:34,802 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 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:34,802 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 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:34,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:34,804 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-15 06:41:34,804 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-04-15 06:41:34,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:34,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:34,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 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 66 states. [2022-04-15 06:41:34,804 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 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 66 states. [2022-04-15 06:41:34,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:34,807 INFO L93 Difference]: Finished difference Result 66 states and 95 transitions. [2022-04-15 06:41:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2022-04-15 06:41:34,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:34,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:34,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:34,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.510204081632653) internal successors, (74), 49 states have internal predecessors, (74), 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:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 78 transitions. [2022-04-15 06:41:34,809 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 78 transitions. Word has length 23 [2022-04-15 06:41:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:34,809 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 78 transitions. [2022-04-15 06:41:34,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 6 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:41:34,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 78 transitions. [2022-04-15 06:41:36,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 78 transitions. [2022-04-15 06:41:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:41:36,979 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:36,979 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:36,995 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 06:41:37,187 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,SelfDestructingSolverStorable10 [2022-04-15 06:41:37,190 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1894791784, now seen corresponding path program 2 times [2022-04-15 06:41:37,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:37,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1922363713] [2022-04-15 06:41:37,430 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:37,443 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:37,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1110622935, now seen corresponding path program 1 times [2022-04-15 06:41:37,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:37,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754559777] [2022-04-15 06:41:37,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:37,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:37,456 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:41:37,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:37,475 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:41:37,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:37,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:37,519 INFO L290 TraceCheckUtils]: 0: Hoare triple {3470#(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); {3462#true} is VALID [2022-04-15 06:41:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-15 06:41:37,519 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-15 06:41:37,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {3462#true} call ULTIMATE.init(); {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:37,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {3470#(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); {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#true} call #t~ret17 := main(); {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {3462#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse2 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (= |v_main_#t~post6_35| |v_main_#t~post6_34|)) (.cse1 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 (<= .cse1 0) (= v_main_~y~0_71 v_main_~y~0_72) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~y~0_72 v_main_~y~0_71) .cse3) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_84) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_8 1) v_main_~x~0_84)) (not (<= 1 v_it_8)))) (< 0 .cse1) (= v_main_~y~0_71 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_72)) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_35|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#true} [111] 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[] {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#true} ~z~0 := ~y~0; {3462#true} is VALID [2022-04-15 06:41:37,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {3462#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3462#true} is VALID [2022-04-15 06:41:37,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {3462#true} assume !(~z~0 % 4294967296 > 0); {3467#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:41:37,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {3467#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3468#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:41:37,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {3468#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:37,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:37,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:37,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:41:37,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {3469#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-15 06:41:37,524 INFO L290 TraceCheckUtils]: 17: Hoare triple {3463#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3463#false} is VALID [2022-04-15 06:41:37,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {3463#false} assume !(~y~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-15 06:41:37,524 INFO L272 TraceCheckUtils]: 19: Hoare triple {3463#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3463#false} is VALID [2022-04-15 06:41:37,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {3463#false} ~cond := #in~cond; {3463#false} is VALID [2022-04-15 06:41:37,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {3463#false} assume 0 == ~cond; {3463#false} is VALID [2022-04-15 06:41:37,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#false} assume !false; {3463#false} is VALID [2022-04-15 06:41:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754559777] [2022-04-15 06:41:37,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754559777] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:37,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421011780] [2022-04-15 06:41:37,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:37,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:37,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:37,526 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:41:37,528 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:41:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:37,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:37,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:37,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:37,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {3462#true} call ULTIMATE.init(); {3462#true} is VALID [2022-04-15 06:41:37,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {3462#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); {3462#true} is VALID [2022-04-15 06:41:37,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-15 06:41:37,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-15 06:41:37,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#true} call #t~ret17 := main(); {3462#true} is VALID [2022-04-15 06:41:37,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3462#true} is VALID [2022-04-15 06:41:37,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {3462#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse2 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (= |v_main_#t~post6_35| |v_main_#t~post6_34|)) (.cse1 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 (<= .cse1 0) (= v_main_~y~0_71 v_main_~y~0_72) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~y~0_72 v_main_~y~0_71) .cse3) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_84) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_8 1) v_main_~x~0_84)) (not (<= 1 v_it_8)))) (< 0 .cse1) (= v_main_~y~0_71 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_72)) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_35|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3462#true} is VALID [2022-04-15 06:41:37,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#true} [111] 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[] {3462#true} is VALID [2022-04-15 06:41:37,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#true} ~z~0 := ~y~0; {3498#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:41:37,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {3498#(= 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; {3502#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:41:37,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {3502#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3506#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:41:37,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {3506#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:41:37,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:41:37,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3463#false} is VALID [2022-04-15 06:41:37,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {3463#false} assume !(~y~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-15 06:41:37,677 INFO L272 TraceCheckUtils]: 19: Hoare triple {3463#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3463#false} is VALID [2022-04-15 06:41:37,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {3463#false} ~cond := #in~cond; {3463#false} is VALID [2022-04-15 06:41:37,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {3463#false} assume 0 == ~cond; {3463#false} is VALID [2022-04-15 06:41:37,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#false} assume !false; {3463#false} is VALID [2022-04-15 06:41:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:37,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:37,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {3463#false} assume !false; {3463#false} is VALID [2022-04-15 06:41:37,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {3463#false} assume 0 == ~cond; {3463#false} is VALID [2022-04-15 06:41:37,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {3463#false} ~cond := #in~cond; {3463#false} is VALID [2022-04-15 06:41:37,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {3463#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {3463#false} is VALID [2022-04-15 06:41:37,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {3463#false} assume !(~y~0 % 4294967296 > 0); {3463#false} is VALID [2022-04-15 06:41:37,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {3463#false} is VALID [2022-04-15 06:41:37,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:41:37,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3514#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:41:37,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {3506#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3510#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:37,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {3581#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3506#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:41:37,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {3585#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~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; {3581#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:41:37,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {3462#true} ~z~0 := ~y~0; {3585#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:41:37,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {3462#true} [111] 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[] {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {3462#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_35| |v_main_#t~post5_34|)) (.cse2 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (= |v_main_#t~post6_35| |v_main_#t~post6_34|)) (.cse1 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 (<= .cse1 0) (= v_main_~y~0_71 v_main_~y~0_72) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~y~0_72 v_main_~y~0_71) .cse3) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_84) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_8 1) v_main_~x~0_84)) (not (<= 1 v_it_8)))) (< 0 .cse1) (= v_main_~y~0_71 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_72)) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_72, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_35|} OutVars{main_~y~0=v_main_~y~0_71, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_34|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {3462#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {3462#true} call #t~ret17 := main(); {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3462#true} {3462#true} #94#return; {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {3462#true} assume true; {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {3462#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); {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {3462#true} call ULTIMATE.init(); {3462#true} is VALID [2022-04-15 06:41:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:41:37,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421011780] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:37,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:37,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2022-04-15 06:41:37,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:37,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1922363713] [2022-04-15 06:41:37,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1922363713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:37,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:37,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:41:37,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990715066] [2022-04-15 06:41:37,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:37,857 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:37,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:37,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:37,873 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:41:37,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:41:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:37,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:41:37,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:41:37,874 INFO L87 Difference]: Start difference. First operand 54 states and 78 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:38,368 INFO L93 Difference]: Finished difference Result 82 states and 120 transitions. [2022-04-15 06:41:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:41:38,368 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:38,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-15 06:41:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-15 06:41:38,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-15 06:41:38,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:38,421 INFO L225 Difference]: With dead ends: 82 [2022-04-15 06:41:38,421 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 06:41:38,422 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:41:38,422 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:38,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 42 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:38,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 06:41:38,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2022-04-15 06:41:38,595 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:38,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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:38,595 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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:38,595 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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:38,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:38,596 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2022-04-15 06:41:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-04-15 06:41:38,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:38,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:38,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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:41:38,597 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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:41:38,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:38,598 INFO L93 Difference]: Finished difference Result 71 states and 101 transitions. [2022-04-15 06:41:38,598 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2022-04-15 06:41:38,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:38,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:38,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:38,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.484375) internal successors, (95), 64 states have internal predecessors, (95), 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:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2022-04-15 06:41:38,599 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 23 [2022-04-15 06:41:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:38,599 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2022-04-15 06:41:38,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 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:41:38,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 99 transitions. [2022-04-15 06:41:38,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:38,824 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2022-04-15 06:41:38,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 06:41:38,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:38,825 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:38,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 06:41:39,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:39,041 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:39,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:39,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1015896408, now seen corresponding path program 2 times [2022-04-15 06:41:39,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:39,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761783095] [2022-04-15 06:41:39,257 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:39,260 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1411894871, now seen corresponding path program 1 times [2022-04-15 06:41:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:39,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446708362] [2022-04-15 06:41:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:39,270 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:41:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:39,280 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:41:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:39,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {4084#(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); {4075#true} is VALID [2022-04-15 06:41:39,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-15 06:41:39,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4084#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:39,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {4084#(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); {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret17 := main(); {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse1 (= |v_main_#t~post6_40| |v_main_#t~post6_39|)) (.cse2 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse3 (mod v_main_~x~0_94 4294967296))) (or (and (= |v_main_#t~post5_40| |v_main_#t~post5_39|) .cse0 .cse1 .cse2) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~x~0_93 v_it_9 1) v_main_~x~0_94)) (< 0 (mod (+ v_main_~x~0_94 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~y~0_85 (+ v_main_~x~0_94 v_main_~y~0_86 (* (- 1) v_main_~x~0_93))) (< v_main_~x~0_93 v_main_~x~0_94) (< 0 .cse3)) (and (= |v_main_#t~post5_39| |v_main_#t~post5_40|) .cse0 .cse1 .cse2 (<= .cse3 0)))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_40|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_39|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4075#true} is VALID [2022-04-15 06:41:39,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {4075#true} [113] 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[] {4075#true} is VALID [2022-04-15 06:41:39,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {4075#true} ~z~0 := ~y~0; {4080#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:39,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#(= (+ 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; {4081#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:39,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {4081#(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; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(<= 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; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#false} assume !(~x~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {4076#false} assume !(~z~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#false} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L272 TraceCheckUtils]: 19: Hoare triple {4076#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2022-04-15 06:41:39,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2022-04-15 06:41:39,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2022-04-15 06:41:39,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:39,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:39,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446708362] [2022-04-15 06:41:39,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446708362] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:39,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394272798] [2022-04-15 06:41:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:39,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:39,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:39,343 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:41:39,347 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:41:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:39,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:41:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:39,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:39,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#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); {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret17 := main(); {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse1 (= |v_main_#t~post6_40| |v_main_#t~post6_39|)) (.cse2 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse3 (mod v_main_~x~0_94 4294967296))) (or (and (= |v_main_#t~post5_40| |v_main_#t~post5_39|) .cse0 .cse1 .cse2) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~x~0_93 v_it_9 1) v_main_~x~0_94)) (< 0 (mod (+ v_main_~x~0_94 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~y~0_85 (+ v_main_~x~0_94 v_main_~y~0_86 (* (- 1) v_main_~x~0_93))) (< v_main_~x~0_93 v_main_~x~0_94) (< 0 .cse3)) (and (= |v_main_#t~post5_39| |v_main_#t~post5_40|) .cse0 .cse1 .cse2 (<= .cse3 0)))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_40|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_39|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4075#true} is VALID [2022-04-15 06:41:39,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {4075#true} [113] 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[] {4075#true} is VALID [2022-04-15 06:41:39,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {4075#true} ~z~0 := ~y~0; {4080#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:41:39,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {4080#(= (+ 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; {4081#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:39,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {4081#(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; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(<= 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; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:39,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#false} assume !(~x~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4076#false} is VALID [2022-04-15 06:41:39,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {4076#false} assume !(~z~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#false} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,680 INFO L272 TraceCheckUtils]: 19: Hoare triple {4076#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4076#false} is VALID [2022-04-15 06:41:39,680 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2022-04-15 06:41:39,680 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2022-04-15 06:41:39,680 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2022-04-15 06:41:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:39,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:39,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {4076#false} assume !false; {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {4076#false} assume 0 == ~cond; {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {4076#false} ~cond := #in~cond; {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {4076#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {4076#false} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {4076#false} assume !(~z~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {4076#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4076#false} is VALID [2022-04-15 06:41:39,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {4076#false} assume !(~x~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4076#false} is VALID [2022-04-15 06:41:39,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4083#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:41:39,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {4082#(<= 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; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {4190#(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; {4082#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:41:39,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {4194#(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; {4190#(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:41:39,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {4075#true} ~z~0 := ~y~0; {4194#(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:41:39,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {4075#true} [113] 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[] {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#true} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse1 (= |v_main_#t~post6_40| |v_main_#t~post6_39|)) (.cse2 (= v_main_~x~0_94 v_main_~x~0_93)) (.cse3 (mod v_main_~x~0_94 4294967296))) (or (and (= |v_main_#t~post5_40| |v_main_#t~post5_39|) .cse0 .cse1 .cse2) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~x~0_93 v_it_9 1) v_main_~x~0_94)) (< 0 (mod (+ v_main_~x~0_94 (* v_it_9 4294967295)) 4294967296)))) (= v_main_~y~0_85 (+ v_main_~x~0_94 v_main_~y~0_86 (* (- 1) v_main_~x~0_93))) (< v_main_~x~0_93 v_main_~x~0_94) (< 0 .cse3)) (and (= |v_main_#t~post5_39| |v_main_#t~post5_40|) .cse0 .cse1 .cse2 (<= .cse3 0)))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_40|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_39|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#true} call #t~ret17 := main(); {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#true} {4075#true} #94#return; {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#true} assume true; {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#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); {4075#true} is VALID [2022-04-15 06:41:39,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {4075#true} call ULTIMATE.init(); {4075#true} is VALID [2022-04-15 06:41:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:39,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394272798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:39,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:39,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-15 06:41:39,980 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:39,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761783095] [2022-04-15 06:41:39,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761783095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:39,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:39,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:41:39,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172896763] [2022-04-15 06:41:39,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:39,981 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:39,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:39,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:40,003 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:41:40,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:41:40,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:40,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:41:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:41:40,004 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:40,538 INFO L93 Difference]: Finished difference Result 82 states and 113 transitions. [2022-04-15 06:41:40,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:41:40,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 06:41:40,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2022-04-15 06:41:40,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2022-04-15 06:41:40,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:40,584 INFO L225 Difference]: With dead ends: 82 [2022-04-15 06:41:40,584 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 06:41:40,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:41:40,585 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:40,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 06:41:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2022-04-15 06:41:40,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:40,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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:40,737 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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:40,737 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:40,738 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2022-04-15 06:41:40,738 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-04-15 06:41:40,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:40,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:40,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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 62 states. [2022-04-15 06:41:40,739 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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 62 states. [2022-04-15 06:41:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:40,739 INFO L93 Difference]: Finished difference Result 62 states and 87 transitions. [2022-04-15 06:41:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 87 transitions. [2022-04-15 06:41:40,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:40,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:40,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:40,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 56 states have internal predecessors, (82), 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:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2022-04-15 06:41:40,741 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 23 [2022-04-15 06:41:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:40,741 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2022-04-15 06:41:40,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 7 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:41:40,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 86 transitions. [2022-04-15 06:41:41,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2022-04-15 06:41:41,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 06:41:41,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:41,185 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:41,202 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:41:41,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:41,385 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:41,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:41,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1947718100, now seen corresponding path program 2 times [2022-04-15 06:41:41,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610785954] [2022-04-15 06:41:41,572 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:41,573 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:41,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2051243253, now seen corresponding path program 1 times [2022-04-15 06:41:41,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:41,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873643044] [2022-04-15 06:41:41,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:41,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:41,583 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:41:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:41,593 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:41:41,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:41,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {4661#(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); {4651#true} is VALID [2022-04-15 06:41:41,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-15 06:41:41,658 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L272 TraceCheckUtils]: 0: Hoare triple {4651#true} call ULTIMATE.init(); {4661#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:41,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {4661#(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); {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#true} call #t~ret17 := main(); {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse0 (mod v_main_~x~0_105 4294967296)) (.cse2 (= |v_main_#t~post6_45| |v_main_#t~post6_44|)) (.cse3 (= |v_main_#t~post5_45| |v_main_#t~post5_44|))) (or (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_95 v_it_10 1) v_main_~y~0_94)) (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_95 v_main_~y~0_94) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_95 (* (- 1) v_main_~y~0_94)))) (and .cse1 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and .cse1 (= v_main_~x~0_104 v_main_~x~0_105) (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_45|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#true} is VALID [2022-04-15 06:41:41,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#true} [115] 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[] {4651#true} is VALID [2022-04-15 06:41:41,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#true} ~z~0 := ~y~0; {4656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:41:41,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {4656#(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; {4657#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:41:41,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {4657#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4658#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:41:41,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {4658#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:41,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:41,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:41,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4652#false} is VALID [2022-04-15 06:41:41,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#false} assume !(~y~0 % 4294967296 > 0); {4652#false} is VALID [2022-04-15 06:41:41,666 INFO L272 TraceCheckUtils]: 20: Hoare triple {4652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4652#false} is VALID [2022-04-15 06:41:41,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {4652#false} ~cond := #in~cond; {4652#false} is VALID [2022-04-15 06:41:41,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {4652#false} assume 0 == ~cond; {4652#false} is VALID [2022-04-15 06:41:41,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {4652#false} assume !false; {4652#false} is VALID [2022-04-15 06:41:41,666 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:41,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:41,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873643044] [2022-04-15 06:41:41,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873643044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:41,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312065946] [2022-04-15 06:41:41,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:41,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:41,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:41,668 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:41:41,668 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:41:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:41,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:41,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:41,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {4651#true} call ULTIMATE.init(); {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#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); {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#true} call #t~ret17 := main(); {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse0 (mod v_main_~x~0_105 4294967296)) (.cse2 (= |v_main_#t~post6_45| |v_main_#t~post6_44|)) (.cse3 (= |v_main_#t~post5_45| |v_main_#t~post5_44|))) (or (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_95 v_it_10 1) v_main_~y~0_94)) (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_95 v_main_~y~0_94) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_95 (* (- 1) v_main_~y~0_94)))) (and .cse1 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and .cse1 (= v_main_~x~0_104 v_main_~x~0_105) (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_45|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#true} is VALID [2022-04-15 06:41:41,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#true} [115] 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[] {4651#true} is VALID [2022-04-15 06:41:41,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#true} ~z~0 := ~y~0; {4656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:41:41,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {4656#(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; {4651#true} is VALID [2022-04-15 06:41:41,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {4651#true} assume !(~z~0 % 4294967296 > 0); {4651#true} is VALID [2022-04-15 06:41:41,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4651#true} is VALID [2022-04-15 06:41:41,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#true} assume !(~y~0 % 4294967296 > 0); {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:41,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:41,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:41,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4652#false} is VALID [2022-04-15 06:41:41,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#false} assume !(~y~0 % 4294967296 > 0); {4652#false} is VALID [2022-04-15 06:41:41,967 INFO L272 TraceCheckUtils]: 20: Hoare triple {4652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4652#false} is VALID [2022-04-15 06:41:41,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {4652#false} ~cond := #in~cond; {4652#false} is VALID [2022-04-15 06:41:41,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {4652#false} assume 0 == ~cond; {4652#false} is VALID [2022-04-15 06:41:41,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {4652#false} assume !false; {4652#false} is VALID [2022-04-15 06:41:41,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:41:41,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:42,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {4652#false} assume !false; {4652#false} is VALID [2022-04-15 06:41:42,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {4652#false} assume 0 == ~cond; {4652#false} is VALID [2022-04-15 06:41:42,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {4652#false} ~cond := #in~cond; {4652#false} is VALID [2022-04-15 06:41:42,038 INFO L272 TraceCheckUtils]: 20: Hoare triple {4652#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {4652#false} is VALID [2022-04-15 06:41:42,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {4652#false} assume !(~y~0 % 4294967296 > 0); {4652#false} is VALID [2022-04-15 06:41:42,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4652#false} is VALID [2022-04-15 06:41:42,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:42,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~z~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:42,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:42,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:42,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4660#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:41:42,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#true} assume !(~y~0 % 4294967296 > 0); {4659#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:41:42,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4651#true} is VALID [2022-04-15 06:41:42,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {4651#true} assume !(~z~0 % 4294967296 > 0); {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {4651#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#true} ~z~0 := ~y~0; {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#true} [115] 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[] {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {4651#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_95 v_main_~y~0_94)) (.cse0 (mod v_main_~x~0_105 4294967296)) (.cse2 (= |v_main_#t~post6_45| |v_main_#t~post6_44|)) (.cse3 (= |v_main_#t~post5_45| |v_main_#t~post5_44|))) (or (and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_95 v_it_10 1) v_main_~y~0_94)) (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_95 v_main_~y~0_94) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_95 (* (- 1) v_main_~y~0_94)))) (and .cse1 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and .cse1 (= v_main_~x~0_104 v_main_~x~0_105) (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_45|} OutVars{main_~y~0=v_main_~y~0_94, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_44|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#true} call #t~ret17 := main(); {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#true} {4651#true} #94#return; {4651#true} is VALID [2022-04-15 06:41:42,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#true} assume true; {4651#true} is VALID [2022-04-15 06:41:42,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#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); {4651#true} is VALID [2022-04-15 06:41:42,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {4651#true} call ULTIMATE.init(); {4651#true} is VALID [2022-04-15 06:41:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:42,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312065946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:42,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:42,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 8 [2022-04-15 06:41:42,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:42,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610785954] [2022-04-15 06:41:42,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610785954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:42,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:42,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295663166] [2022-04-15 06:41:42,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:42,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:42,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,087 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:41:42,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:42,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:42,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:42,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:41:42,087 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:42,682 INFO L93 Difference]: Finished difference Result 108 states and 156 transitions. [2022-04-15 06:41:42,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:41:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-04-15 06:41:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-04-15 06:41:42,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 68 transitions. [2022-04-15 06:41:42,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:42,740 INFO L225 Difference]: With dead ends: 108 [2022-04-15 06:41:42,740 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 06:41:42,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:41:42,741 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:42,741 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 46 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:41:42,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 06:41:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-04-15 06:41:42,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:42,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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:42,875 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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:42,875 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:42,876 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 06:41:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-15 06:41:42,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:42,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:42,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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:41:42,877 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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:41:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:42,877 INFO L93 Difference]: Finished difference Result 53 states and 73 transitions. [2022-04-15 06:41:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-15 06:41:42,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:42,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:42,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:42,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4666666666666666) internal successors, (66), 45 states have internal predecessors, (66), 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:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-04-15 06:41:42,878 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 24 [2022-04-15 06:41:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:42,879 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-04-15 06:41:42,879 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:42,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 70 transitions. [2022-04-15 06:41:43,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-04-15 06:41:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:41:43,310 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:43,310 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:43,327 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:41:43,523 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,SelfDestructingSolverStorable13 [2022-04-15 06:41:43,523 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1703302776, now seen corresponding path program 3 times [2022-04-15 06:41:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:43,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [83654513] [2022-04-15 06:41:47,626 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:41:47,711 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:47,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 513778662, now seen corresponding path program 1 times [2022-04-15 06:41:47,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:47,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785942601] [2022-04-15 06:41:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:47,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:47,722 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:41:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:47,743 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:41:47,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:47,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:47,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {5258#(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); {5249#true} is VALID [2022-04-15 06:41:47,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-15 06:41:47,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-15 06:41:47,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:47,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#(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); {5249#true} is VALID [2022-04-15 06:41:47,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-15 06:41:47,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-15 06:41:47,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret17 := main(); {5249#true} is VALID [2022-04-15 06:41:47,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {5249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5249#true} is VALID [2022-04-15 06:41:47,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {5249#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_50| |v_main_#t~post5_49|)) (.cse0 (mod v_main_~x~0_117 4294967296)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_109 v_main_~y~0_108))) (or (and (forall ((v_it_11 Int)) (or (not (<= (+ v_main_~x~0_116 v_it_11 1) v_main_~x~0_117)) (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_117 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse0) (< v_main_~x~0_116 v_main_~x~0_117) (= (+ (* v_main_~x~0_116 (- 1)) v_main_~x~0_117 v_main_~y~0_109) v_main_~y~0_108)) (and (= |v_main_#t~post6_50| |v_main_#t~post6_49|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_49| |v_main_#t~post6_50|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_50|} OutVars{main_~y~0=v_main_~y~0_108, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5249#true} is VALID [2022-04-15 06:41:47,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {5249#true} [117] 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[] {5254#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:47,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {5254#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5254#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:41:47,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {5254#(<= 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; {5255#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:41:47,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {5255#(<= 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; {5256#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:47,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {5256#(<= 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; {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:41:47,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:41:47,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:41:47,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:41:47,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:41:47,810 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {5250#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {5250#false} assume !(~z~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {5250#false} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L272 TraceCheckUtils]: 20: Hoare triple {5250#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2022-04-15 06:41:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:47,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:47,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785942601] [2022-04-15 06:41:47,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785942601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:47,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951588595] [2022-04-15 06:41:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:47,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:47,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:47,813 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:41:47,814 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:41:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:47,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:47,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:47,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2022-04-15 06:41:47,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#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); {5249#true} is VALID [2022-04-15 06:41:47,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-15 06:41:47,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-15 06:41:47,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret17 := main(); {5249#true} is VALID [2022-04-15 06:41:47,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {5249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5249#true} is VALID [2022-04-15 06:41:47,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {5249#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_50| |v_main_#t~post5_49|)) (.cse0 (mod v_main_~x~0_117 4294967296)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_109 v_main_~y~0_108))) (or (and (forall ((v_it_11 Int)) (or (not (<= (+ v_main_~x~0_116 v_it_11 1) v_main_~x~0_117)) (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_117 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse0) (< v_main_~x~0_116 v_main_~x~0_117) (= (+ (* v_main_~x~0_116 (- 1)) v_main_~x~0_117 v_main_~y~0_109) v_main_~y~0_108)) (and (= |v_main_#t~post6_50| |v_main_#t~post6_49|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_49| |v_main_#t~post6_50|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_50|} OutVars{main_~y~0=v_main_~y~0_108, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5249#true} is VALID [2022-04-15 06:41:47,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {5249#true} [117] 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[] {5249#true} is VALID [2022-04-15 06:41:47,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {5249#true} ~z~0 := ~y~0; {5286#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:41:47,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {5286#(= 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; {5290#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:41:47,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {5290#(= 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; {5294#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:41:47,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {5294#(= 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; {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:41:47,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:41:47,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5305#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {5305#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5309#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {5309#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {5250#false} assume !(~x~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {5250#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {5250#false} assume !(~z~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {5250#false} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L272 TraceCheckUtils]: 20: Hoare triple {5250#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 21: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2022-04-15 06:41:47,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2022-04-15 06:41:47,959 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:47,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {5250#false} assume !false; {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {5250#false} assume 0 == ~cond; {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {5250#false} ~cond := #in~cond; {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L272 TraceCheckUtils]: 20: Hoare triple {5250#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {5250#false} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {5250#false} assume !(~z~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {5250#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5250#false} is VALID [2022-04-15 06:41:48,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {5250#false} assume !(~x~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:48,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {5309#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5250#false} is VALID [2022-04-15 06:41:48,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {5305#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5309#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:48,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5305#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:41:48,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:41:48,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {5373#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {5298#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:41:48,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {5377#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {5373#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:41:48,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {5381#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {5377#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:41:48,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {5249#true} ~z~0 := ~y~0; {5381#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:41:48,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {5249#true} [117] 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[] {5249#true} is VALID [2022-04-15 06:41:48,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {5249#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_50| |v_main_#t~post5_49|)) (.cse0 (mod v_main_~x~0_117 4294967296)) (.cse2 (= v_main_~x~0_117 v_main_~x~0_116)) (.cse3 (= v_main_~y~0_109 v_main_~y~0_108))) (or (and (forall ((v_it_11 Int)) (or (not (<= (+ v_main_~x~0_116 v_it_11 1) v_main_~x~0_117)) (not (<= 1 v_it_11)) (< 0 (mod (+ v_main_~x~0_117 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse0) (< v_main_~x~0_116 v_main_~x~0_117) (= (+ (* v_main_~x~0_116 (- 1)) v_main_~x~0_117 v_main_~y~0_109) v_main_~y~0_108)) (and (= |v_main_#t~post6_50| |v_main_#t~post6_49|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_49| |v_main_#t~post6_50|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_109, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_50|} OutVars{main_~y~0=v_main_~y~0_108, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_49|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {5249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {5249#true} call #t~ret17 := main(); {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5249#true} {5249#true} #94#return; {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {5249#true} assume true; {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {5249#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); {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {5249#true} call ULTIMATE.init(); {5249#true} is VALID [2022-04-15 06:41:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:41:48,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951588595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:48,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:48,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 16 [2022-04-15 06:41:48,179 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:48,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [83654513] [2022-04-15 06:41:48,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [83654513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:48,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:48,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:41:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253444906] [2022-04-15 06:41:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:48,180 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 25 [2022-04-15 06:41:48,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:48,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:48,196 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:41:48,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:41:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:48,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:41:48,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:41:48,197 INFO L87 Difference]: Start difference. First operand 50 states and 70 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:49,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,328 INFO L93 Difference]: Finished difference Result 140 states and 211 transitions. [2022-04-15 06:41:49,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:41:49,328 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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 25 [2022-04-15 06:41:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-15 06:41:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 104 transitions. [2022-04-15 06:41:49,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 104 transitions. [2022-04-15 06:41:49,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:49,439 INFO L225 Difference]: With dead ends: 140 [2022-04-15 06:41:49,439 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 06:41:49,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:41:49,440 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:49,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 53 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:41:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 06:41:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 63. [2022-04-15 06:41:49,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:49,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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:49,607 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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:49,607 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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:49,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,609 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-04-15 06:41:49,609 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-04-15 06:41:49,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:49,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:49,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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 118 states. [2022-04-15 06:41:49,610 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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 118 states. [2022-04-15 06:41:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:49,611 INFO L93 Difference]: Finished difference Result 118 states and 170 transitions. [2022-04-15 06:41:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2022-04-15 06:41:49,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:49,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:49,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:49,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:49,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 58 states have internal predecessors, (84), 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:49,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2022-04-15 06:41:49,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 25 [2022-04-15 06:41:49,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:49,613 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2022-04-15 06:41:49,613 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 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:41:49,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 88 transitions. [2022-04-15 06:41:50,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2022-04-15 06:41:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 06:41:50,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:50,183 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:50,199 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:41:50,383 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,SelfDestructingSolverStorable14 [2022-04-15 06:41:50,384 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:50,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2090989180, now seen corresponding path program 2 times [2022-04-15 06:41:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:50,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1853429868] [2022-04-15 06:41:50,574 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:50,576 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1469062490, now seen corresponding path program 1 times [2022-04-15 06:41:50,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:50,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008646420] [2022-04-15 06:41:50,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:50,594 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:41:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:50,610 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:41:50,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:50,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {6079#(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); {6071#true} is VALID [2022-04-15 06:41:50,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-15 06:41:50,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {6071#true} call ULTIMATE.init(); {6079#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:50,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {6079#(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); {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {6071#true} call #t~ret17 := main(); {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {6071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {6071#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_55| |v_main_#t~post6_54|)) (.cse2 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse3 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse0 (mod v_main_~x~0_129 4294967296)) (.cse4 (= |v_main_#t~post5_55| |v_main_#t~post5_54|))) (or (and (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_128 v_it_12 1) v_main_~x~0_129)) (< 0 (mod (+ v_main_~x~0_129 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0) (= v_main_~y~0_120 (+ v_main_~x~0_129 v_main_~y~0_121 (* v_main_~x~0_128 (- 1)))) (< v_main_~x~0_128 v_main_~x~0_129)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_55|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L290 TraceCheckUtils]: 7: Hoare triple {6071#true} [119] 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[] {6071#true} is VALID [2022-04-15 06:41:50,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {6071#true} ~z~0 := ~y~0; {6071#true} is VALID [2022-04-15 06:41:50,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6071#true} is VALID [2022-04-15 06:41:50,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:50,656 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:50,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:50,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,659 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:50,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-15 06:41:50,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {6072#false} assume !(~y~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-15 06:41:50,660 INFO L272 TraceCheckUtils]: 21: Hoare triple {6072#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6072#false} is VALID [2022-04-15 06:41:50,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {6072#false} ~cond := #in~cond; {6072#false} is VALID [2022-04-15 06:41:50,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {6072#false} assume 0 == ~cond; {6072#false} is VALID [2022-04-15 06:41:50,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#false} assume !false; {6072#false} is VALID [2022-04-15 06:41:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:50,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:50,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008646420] [2022-04-15 06:41:50,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008646420] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:50,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872924241] [2022-04-15 06:41:50,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:50,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:50,672 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:41:50,674 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:41:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:50,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:41:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:50,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:50,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {6071#true} call ULTIMATE.init(); {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {6071#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); {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {6071#true} call #t~ret17 := main(); {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {6071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6071#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_55| |v_main_#t~post6_54|)) (.cse2 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse3 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse0 (mod v_main_~x~0_129 4294967296)) (.cse4 (= |v_main_#t~post5_55| |v_main_#t~post5_54|))) (or (and (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_128 v_it_12 1) v_main_~x~0_129)) (< 0 (mod (+ v_main_~x~0_129 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0) (= v_main_~y~0_120 (+ v_main_~x~0_129 v_main_~y~0_121 (* v_main_~x~0_128 (- 1)))) (< v_main_~x~0_128 v_main_~x~0_129)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_55|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6071#true} is VALID [2022-04-15 06:41:50,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {6071#true} [119] 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[] {6071#true} is VALID [2022-04-15 06:41:50,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {6071#true} ~z~0 := ~y~0; {6071#true} is VALID [2022-04-15 06:41:50,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6071#true} is VALID [2022-04-15 06:41:50,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:50,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:50,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:50,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:50,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:50,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-15 06:41:50,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {6072#false} assume !(~y~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-15 06:41:50,910 INFO L272 TraceCheckUtils]: 21: Hoare triple {6072#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6072#false} is VALID [2022-04-15 06:41:50,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {6072#false} ~cond := #in~cond; {6072#false} is VALID [2022-04-15 06:41:50,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {6072#false} assume 0 == ~cond; {6072#false} is VALID [2022-04-15 06:41:50,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#false} assume !false; {6072#false} is VALID [2022-04-15 06:41:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:50,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:51,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {6072#false} assume !false; {6072#false} is VALID [2022-04-15 06:41:51,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {6072#false} assume 0 == ~cond; {6072#false} is VALID [2022-04-15 06:41:51,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {6072#false} ~cond := #in~cond; {6072#false} is VALID [2022-04-15 06:41:51,143 INFO L272 TraceCheckUtils]: 21: Hoare triple {6072#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6072#false} is VALID [2022-04-15 06:41:51,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {6072#false} assume !(~y~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-15 06:41:51,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6072#false} is VALID [2022-04-15 06:41:51,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:51,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:51,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:51,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:51,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:51,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6078#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:41:51,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6077#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:41:51,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:51,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6076#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:51,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {6071#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6071#true} is VALID [2022-04-15 06:41:51,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {6071#true} ~z~0 := ~y~0; {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {6071#true} [119] 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[] {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {6071#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_55| |v_main_#t~post6_54|)) (.cse2 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse3 (= v_main_~x~0_129 v_main_~x~0_128)) (.cse0 (mod v_main_~x~0_129 4294967296)) (.cse4 (= |v_main_#t~post5_55| |v_main_#t~post5_54|))) (or (and (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_128 v_it_12 1) v_main_~x~0_129)) (< 0 (mod (+ v_main_~x~0_129 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse0) (= v_main_~y~0_120 (+ v_main_~x~0_129 v_main_~y~0_121 (* v_main_~x~0_128 (- 1)))) (< v_main_~x~0_128 v_main_~x~0_129)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_55|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_54|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {6071#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {6071#true} call #t~ret17 := main(); {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6071#true} {6071#true} #94#return; {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {6071#true} assume true; {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {6071#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); {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {6071#true} call ULTIMATE.init(); {6071#true} is VALID [2022-04-15 06:41:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:51,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872924241] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:51,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:51,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-15 06:41:51,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:51,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1853429868] [2022-04-15 06:41:51,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1853429868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:51,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:51,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:41:51,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897528211] [2022-04-15 06:41:51,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:51,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 26 [2022-04-15 06:41:51,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:51,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:41:51,229 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:41:51,229 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:41:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:41:51,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:41:51,230 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:41:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:51,961 INFO L93 Difference]: Finished difference Result 81 states and 110 transitions. [2022-04-15 06:41:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:41:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 26 [2022-04-15 06:41:51,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:41:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-15 06:41:51,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:41:51,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-15 06:41:51,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-15 06:41:52,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:52,042 INFO L225 Difference]: With dead ends: 81 [2022-04-15 06:41:52,042 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 06:41:52,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:41:52,043 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:52,043 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 40 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:41:52,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 06:41:52,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-04-15 06:41:52,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:52,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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:52,266 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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:52,266 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:52,267 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-15 06:41:52,267 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-15 06:41:52,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:52,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:52,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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 72 states. [2022-04-15 06:41:52,267 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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 72 states. [2022-04-15 06:41:52,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:52,268 INFO L93 Difference]: Finished difference Result 72 states and 98 transitions. [2022-04-15 06:41:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 98 transitions. [2022-04-15 06:41:52,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:52,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:52,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:52,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 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:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2022-04-15 06:41:52,270 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 26 [2022-04-15 06:41:52,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:52,270 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2022-04-15 06:41:52,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:41:52,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 90 transitions. [2022-04-15 06:41:52,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:41:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2022-04-15 06:41:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:41:52,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:41:52,964 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:41:52,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 06:41:53,177 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,SelfDestructingSolverStorable15 [2022-04-15 06:41:53,178 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:41:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:41:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1041168377, now seen corresponding path program 3 times [2022-04-15 06:41:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:53,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1770556778] [2022-04-15 06:41:57,293 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:41:57,370 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:57,371 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:41:57,373 INFO L85 PathProgramCache]: Analyzing trace with hash 634434391, now seen corresponding path program 1 times [2022-04-15 06:41:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:41:57,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84711805] [2022-04-15 06:41:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:57,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:41:57,386 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:41:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:57,397 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:41:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:41:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:57,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {6704#(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); {6694#true} is VALID [2022-04-15 06:41:57,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-15 06:41:57,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-15 06:41:57,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:41:57,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {6704#(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); {6694#true} is VALID [2022-04-15 06:41:57,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-15 06:41:57,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-15 06:41:57,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret17 := main(); {6694#true} is VALID [2022-04-15 06:41:57,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {6694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6694#true} is VALID [2022-04-15 06:41:57,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132)) (.cse2 (mod v_main_~x~0_141 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_60|)) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse3) (and (< v_main_~y~0_133 v_main_~y~0_132) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_141 (* 4294967295 v_it_13)) 4294967296)) (not (<= (+ v_main_~y~0_133 v_it_13 1) v_main_~y~0_132)))) (< 0 .cse2) (= v_main_~x~0_140 (+ v_main_~x~0_141 v_main_~y~0_133 (* (- 1) v_main_~y~0_132)))))) InVars {main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_132, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6694#true} is VALID [2022-04-15 06:41:57,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#true} [121] 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[] {6694#true} is VALID [2022-04-15 06:41:57,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#true} ~z~0 := ~y~0; {6699#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:41:57,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {6699#(= (+ 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; {6700#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:41:57,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {6700#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~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; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:57,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:41:57,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !(~y~0 % 4294967296 > 0); {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:41:57,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {6703#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} is VALID [2022-04-15 06:41:57,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {6702#(<= main_~y~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,477 INFO L290 TraceCheckUtils]: 19: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:41:57,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {6701#(<= main_~y~0 (+ 4294967295 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6695#false} is VALID [2022-04-15 06:41:57,478 INFO L272 TraceCheckUtils]: 22: Hoare triple {6695#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6695#false} is VALID [2022-04-15 06:41:57,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2022-04-15 06:41:57,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2022-04-15 06:41:57,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2022-04-15 06:41:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:41:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:41:57,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84711805] [2022-04-15 06:41:57,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84711805] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:41:57,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145934616] [2022-04-15 06:41:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:41:57,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:41:57,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:41:57,480 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:41:57,481 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:41:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:57,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:41:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:41:57,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:41:57,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#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); {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret17 := main(); {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {6694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132)) (.cse2 (mod v_main_~x~0_141 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_60|)) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse3) (and (< v_main_~y~0_133 v_main_~y~0_132) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_141 (* 4294967295 v_it_13)) 4294967296)) (not (<= (+ v_main_~y~0_133 v_it_13 1) v_main_~y~0_132)))) (< 0 .cse2) (= v_main_~x~0_140 (+ v_main_~x~0_141 v_main_~y~0_133 (* (- 1) v_main_~y~0_132)))))) InVars {main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_132, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6694#true} is VALID [2022-04-15 06:41:57,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#true} [121] 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[] {6694#true} is VALID [2022-04-15 06:41:57,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#true} ~z~0 := ~y~0; {6699#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:41:57,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {6699#(= (+ 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; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {6735#(< 0 (mod 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; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:41:57,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:41:57,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:41:57,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:41:57,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,617 INFO L290 TraceCheckUtils]: 20: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6695#false} is VALID [2022-04-15 06:41:57,617 INFO L272 TraceCheckUtils]: 22: Hoare triple {6695#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6695#false} is VALID [2022-04-15 06:41:57,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2022-04-15 06:41:57,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2022-04-15 06:41:57,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2022-04-15 06:41:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:57,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:41:57,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {6695#false} assume !false; {6695#false} is VALID [2022-04-15 06:41:57,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {6695#false} assume 0 == ~cond; {6695#false} is VALID [2022-04-15 06:41:57,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {6695#false} ~cond := #in~cond; {6695#false} is VALID [2022-04-15 06:41:57,706 INFO L272 TraceCheckUtils]: 22: Hoare triple {6695#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {6695#false} is VALID [2022-04-15 06:41:57,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6695#false} is VALID [2022-04-15 06:41:57,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,707 INFO L290 TraceCheckUtils]: 19: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,707 INFO L290 TraceCheckUtils]: 18: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:41:57,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !(~y~0 % 4294967296 > 0); {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:41:57,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6749#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:41:57,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6745#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:41:57,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {6735#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {6735#(< 0 (mod 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; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {6834#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod 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; {6735#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:41:57,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {6694#true} ~z~0 := ~y~0; {6834#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:41:57,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {6694#true} [121] 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[] {6694#true} is VALID [2022-04-15 06:41:57,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {6694#true} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_141 v_main_~x~0_140)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_133 v_main_~y~0_132)) (.cse2 (mod v_main_~x~0_141 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 (= |v_main_#t~post5_59| |v_main_#t~post5_60|)) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse3) (and (< v_main_~y~0_133 v_main_~y~0_132) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_141 (* 4294967295 v_it_13)) 4294967296)) (not (<= (+ v_main_~y~0_133 v_it_13 1) v_main_~y~0_132)))) (< 0 .cse2) (= v_main_~x~0_140 (+ v_main_~x~0_141 v_main_~y~0_133 (* (- 1) v_main_~y~0_132)))))) InVars {main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_141, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_132, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6694#true} is VALID [2022-04-15 06:41:57,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {6694#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6694#true} is VALID [2022-04-15 06:41:57,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {6694#true} call #t~ret17 := main(); {6694#true} is VALID [2022-04-15 06:41:57,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6694#true} {6694#true} #94#return; {6694#true} is VALID [2022-04-15 06:41:57,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {6694#true} assume true; {6694#true} is VALID [2022-04-15 06:41:57,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {6694#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); {6694#true} is VALID [2022-04-15 06:41:57,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {6694#true} call ULTIMATE.init(); {6694#true} is VALID [2022-04-15 06:41:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 06:41:57,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145934616] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:41:57,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:41:57,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 12 [2022-04-15 06:41:57,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:41:57,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1770556778] [2022-04-15 06:41:57,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1770556778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:41:57,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:41:57,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:41:57,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582843347] [2022-04-15 06:41:57,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:41:57,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 27 [2022-04-15 06:41:57,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:41:57,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:41:57,780 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:41:57,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:41:57,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:41:57,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:41:57,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:41:57,780 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:41:58,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:58,947 INFO L93 Difference]: Finished difference Result 93 states and 128 transitions. [2022-04-15 06:41:58,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:41:58,947 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 27 [2022-04-15 06:41:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:41:58,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:41:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-15 06:41:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:41:58,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 79 transitions. [2022-04-15 06:41:58,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 79 transitions. [2022-04-15 06:41:59,037 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:41:59,038 INFO L225 Difference]: With dead ends: 93 [2022-04-15 06:41:59,039 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 06:41:59,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:41:59,039 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:41:59,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 49 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:41:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 06:41:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 71. [2022-04-15 06:41:59,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:41:59,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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:59,279 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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:59,279 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:59,280 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2022-04-15 06:41:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2022-04-15 06:41:59,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:59,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:59,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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 88 states. [2022-04-15 06:41:59,280 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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 88 states. [2022-04-15 06:41:59,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:41:59,281 INFO L93 Difference]: Finished difference Result 88 states and 121 transitions. [2022-04-15 06:41:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 121 transitions. [2022-04-15 06:41:59,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:41:59,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:41:59,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:41:59,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:41:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2022-04-15 06:41:59,283 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 27 [2022-04-15 06:41:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:41:59,283 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2022-04-15 06:41:59,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:41:59,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 99 transitions. [2022-04-15 06:42:01,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:01,828 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2022-04-15 06:42:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 06:42:01,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:01,828 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:01,845 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:42:02,031 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,SelfDestructingSolverStorable16 [2022-04-15 06:42:02,031 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:02,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:02,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1238601096, now seen corresponding path program 3 times [2022-04-15 06:42:02,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:02,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985782464] [2022-04-15 06:42:04,254 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:04,344 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:04,345 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1674725082, now seen corresponding path program 1 times [2022-04-15 06:42:04,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:04,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976669121] [2022-04-15 06:42:04,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:04,354 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:42:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:04,365 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:42:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:04,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {7415#(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); {7405#true} is VALID [2022-04-15 06:42:04,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-15 06:42:04,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-15 06:42:04,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:04,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {7415#(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); {7405#true} is VALID [2022-04-15 06:42:04,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-15 06:42:04,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-15 06:42:04,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret17 := main(); {7405#true} is VALID [2022-04-15 06:42:04,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {7405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7405#true} is VALID [2022-04-15 06:42:04,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {7405#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_155 4294967296)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= v_main_~x~0_155 v_main_~x~0_154)) (.cse3 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_148 (+ v_main_~x~0_155 v_main_~y~0_149 (* v_main_~x~0_154 (- 1)))) (< v_main_~x~0_154 v_main_~x~0_155) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_155 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_154 v_it_14 1) v_main_~x~0_155))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_155, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_154, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7405#true} is VALID [2022-04-15 06:42:04,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {7405#true} [123] 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[] {7410#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:04,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {7410#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7410#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:04,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {7410#(<= 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; {7411#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:04,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {7411#(<= 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; {7412#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {7412#(<= 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; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {7413#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7414#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {7414#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {7406#false} assume !(~z~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {7406#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {7406#false} assume !(~y~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L272 TraceCheckUtils]: 22: Hoare triple {7406#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2022-04-15 06:42:04,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2022-04-15 06:42:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:42:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:04,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976669121] [2022-04-15 06:42:04,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976669121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:04,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312766350] [2022-04-15 06:42:04,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:04,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:04,438 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:42:04,439 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:42:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:04,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:42:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:04,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:04,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2022-04-15 06:42:04,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#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); {7405#true} is VALID [2022-04-15 06:42:04,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-15 06:42:04,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-15 06:42:04,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret17 := main(); {7405#true} is VALID [2022-04-15 06:42:04,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {7405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7405#true} is VALID [2022-04-15 06:42:04,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {7405#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_155 4294967296)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= v_main_~x~0_155 v_main_~x~0_154)) (.cse3 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_148 (+ v_main_~x~0_155 v_main_~y~0_149 (* v_main_~x~0_154 (- 1)))) (< v_main_~x~0_154 v_main_~x~0_155) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_155 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_154 v_it_14 1) v_main_~x~0_155))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_155, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_154, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7405#true} is VALID [2022-04-15 06:42:04,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {7405#true} [123] 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[] {7405#true} is VALID [2022-04-15 06:42:04,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {7405#true} ~z~0 := ~y~0; {7443#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:04,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {7443#(= 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; {7447#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 06:42:04,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {7447#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {7451#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:04,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {7451#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod 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; {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:04,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:04,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {7455#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7462#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-15 06:42:04,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {7462#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7466#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:42:04,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {7466#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:42:04,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:42:04,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {7470#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:04,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:04,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {7406#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {7406#false} assume !(~y~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L272 TraceCheckUtils]: 22: Hoare triple {7406#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2022-04-15 06:42:04,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:42:04,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:04,803 INFO L290 TraceCheckUtils]: 25: Hoare triple {7406#false} assume !false; {7406#false} is VALID [2022-04-15 06:42:04,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {7406#false} assume 0 == ~cond; {7406#false} is VALID [2022-04-15 06:42:04,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {7406#false} ~cond := #in~cond; {7406#false} is VALID [2022-04-15 06:42:04,804 INFO L272 TraceCheckUtils]: 22: Hoare triple {7406#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {7406#false} is VALID [2022-04-15 06:42:04,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {7406#false} assume !(~y~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {7406#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {7406#false} is VALID [2022-04-15 06:42:04,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7406#false} is VALID [2022-04-15 06:42:04,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:04,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:04,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:04,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {7532#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7477#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:04,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {7536#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7532#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:04,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7536#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:04,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:42:04,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {7536#(< 0 (mod (+ main_~z~0 2) 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; {7540#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:42:04,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {7532#(< 0 (mod (+ main_~z~0 1) 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; {7536#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:04,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {7405#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7532#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:04,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {7405#true} ~z~0 := ~y~0; {7405#true} is VALID [2022-04-15 06:42:04,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {7405#true} [123] 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[] {7405#true} is VALID [2022-04-15 06:42:04,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {7405#true} [124] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_155 4294967296)) (.cse1 (= v_main_~y~0_149 v_main_~y~0_148)) (.cse2 (= v_main_~x~0_155 v_main_~x~0_154)) (.cse3 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse4 (= |v_main_#t~post5_65| |v_main_#t~post5_64|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= v_main_~y~0_148 (+ v_main_~x~0_155 v_main_~y~0_149 (* v_main_~x~0_154 (- 1)))) (< v_main_~x~0_154 v_main_~x~0_155) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_155 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_154 v_it_14 1) v_main_~x~0_155))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_155, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_148, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_154, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {7405#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {7405#true} call #t~ret17 := main(); {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7405#true} {7405#true} #94#return; {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {7405#true} assume true; {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {7405#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); {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {7405#true} call ULTIMATE.init(); {7405#true} is VALID [2022-04-15 06:42:04,812 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:42:04,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312766350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:04,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:04,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 6] total 19 [2022-04-15 06:42:04,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:04,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985782464] [2022-04-15 06:42:04,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985782464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:04,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:04,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:42:04,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277251733] [2022-04-15 06:42:04,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 27 [2022-04-15 06:42:04,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:04,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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:42:04,916 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:42:04,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:42:04,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:04,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:42:04,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:42:04,917 INFO L87 Difference]: Start difference. First operand 71 states and 99 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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:42:06,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:06,583 INFO L93 Difference]: Finished difference Result 195 states and 282 transitions. [2022-04-15 06:42:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:42:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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 27 [2022-04-15 06:42:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:06,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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:42:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-04-15 06:42:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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:42:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 113 transitions. [2022-04-15 06:42:06,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 113 transitions. [2022-04-15 06:42:06,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:06,716 INFO L225 Difference]: With dead ends: 195 [2022-04-15 06:42:06,716 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 06:42:06,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=743, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:42:06,717 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:06,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 50 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 06:42:07,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 84. [2022-04-15 06:42:07,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:07,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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:07,049 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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:07,049 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:07,051 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2022-04-15 06:42:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 236 transitions. [2022-04-15 06:42:07,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:07,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:07,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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 167 states. [2022-04-15 06:42:07,052 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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 167 states. [2022-04-15 06:42:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:07,054 INFO L93 Difference]: Finished difference Result 167 states and 236 transitions. [2022-04-15 06:42:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 236 transitions. [2022-04-15 06:42:07,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:07,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:07,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:07,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:07,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.4050632911392404) internal successors, (111), 79 states have internal predecessors, (111), 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:07,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2022-04-15 06:42:07,059 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 27 [2022-04-15 06:42:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:07,059 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2022-04-15 06:42:07,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 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:42:07,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 115 transitions. [2022-04-15 06:42:09,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 114 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:09,743 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2022-04-15 06:42:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:42:09,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:09,744 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:09,761 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:42:09,949 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,SelfDestructingSolverStorable17 [2022-04-15 06:42:09,950 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1072099492, now seen corresponding path program 4 times [2022-04-15 06:42:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:09,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693122972] [2022-04-15 06:42:10,111 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:10,113 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 558354566, now seen corresponding path program 1 times [2022-04-15 06:42:10,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:10,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345150371] [2022-04-15 06:42:10,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:10,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:10,126 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:42:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,145 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {8504#(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); {8494#true} is VALID [2022-04-15 06:42:10,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-15 06:42:10,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {8494#true} call ULTIMATE.init(); {8504#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:10,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {8504#(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); {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {8494#true} call #t~ret17 := main(); {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {8494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {8494#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_166 v_main_~y~0_165)) (.cse1 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse3 (mod v_main_~x~0_168 4294967296)) (.cse2 (= v_main_~x~0_168 v_main_~x~0_167))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (= (+ v_main_~x~0_168 v_main_~y~0_166 (* v_main_~x~0_167 (- 1))) v_main_~y~0_165) (< v_main_~x~0_167 v_main_~x~0_168) (< 0 .cse3) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_167 v_it_15 1) v_main_~x~0_168)) (< 0 (mod (+ v_main_~x~0_168 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15))))) (and (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse0 .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_168, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_165, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_167, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {8494#true} [125] 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[] {8494#true} is VALID [2022-04-15 06:42:10,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {8494#true} ~z~0 := ~y~0; {8494#true} is VALID [2022-04-15 06:42:10,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {8494#true} assume !!(~z~0 % 4294967296 > 0);#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#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:10,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {8499#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {8494#true} is VALID [2022-04-15 06:42:10,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {8494#true} assume !(~z~0 % 4294967296 > 0); {8500#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-15 06:42:10,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {8500#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8501#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:42:10,233 INFO L290 TraceCheckUtils]: 13: Hoare triple {8501#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8502#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} is VALID [2022-04-15 06:42:10,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {8502#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:10,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:10,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:10,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:10,235 INFO L290 TraceCheckUtils]: 18: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {8503#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {8495#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {8495#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#false} assume !(~y~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L272 TraceCheckUtils]: 23: Hoare triple {8495#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {8495#false} ~cond := #in~cond; {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {8495#false} assume 0 == ~cond; {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {8495#false} assume !false; {8495#false} is VALID [2022-04-15 06:42:10,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:42:10,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:10,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345150371] [2022-04-15 06:42:10,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345150371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574731552] [2022-04-15 06:42:10,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:10,238 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:42:10,239 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:42:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:42:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:10,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:10,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {8494#true} call ULTIMATE.init(); {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {8494#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); {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {8494#true} call #t~ret17 := main(); {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {8494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {8494#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_166 v_main_~y~0_165)) (.cse1 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse3 (mod v_main_~x~0_168 4294967296)) (.cse2 (= v_main_~x~0_168 v_main_~x~0_167))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (= (+ v_main_~x~0_168 v_main_~y~0_166 (* v_main_~x~0_167 (- 1))) v_main_~y~0_165) (< v_main_~x~0_167 v_main_~x~0_168) (< 0 .cse3) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_167 v_it_15 1) v_main_~x~0_168)) (< 0 (mod (+ v_main_~x~0_168 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15))))) (and (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse0 .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_168, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_165, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_167, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8494#true} is VALID [2022-04-15 06:42:10,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {8494#true} [125] 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[] {8494#true} is VALID [2022-04-15 06:42:10,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {8494#true} ~z~0 := ~y~0; {8532#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:10,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {8532#(= 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; {8536#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:10,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {8536#(= 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; {8540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:42:10,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {8540#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8544#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:42:10,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {8544#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:10,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:42:10,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:42:10,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:10,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:10,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-15 06:42:10,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#false} assume !(~y~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-15 06:42:10,457 INFO L272 TraceCheckUtils]: 23: Hoare triple {8495#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8495#false} is VALID [2022-04-15 06:42:10,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {8495#false} ~cond := #in~cond; {8495#false} is VALID [2022-04-15 06:42:10,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {8495#false} assume 0 == ~cond; {8495#false} is VALID [2022-04-15 06:42:10,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {8495#false} assume !false; {8495#false} is VALID [2022-04-15 06:42:10,458 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:10,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:10,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {8495#false} assume !false; {8495#false} is VALID [2022-04-15 06:42:10,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {8495#false} assume 0 == ~cond; {8495#false} is VALID [2022-04-15 06:42:10,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {8495#false} ~cond := #in~cond; {8495#false} is VALID [2022-04-15 06:42:10,600 INFO L272 TraceCheckUtils]: 23: Hoare triple {8495#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {8495#false} is VALID [2022-04-15 06:42:10,600 INFO L290 TraceCheckUtils]: 22: Hoare triple {8495#false} assume !(~y~0 % 4294967296 > 0); {8495#false} is VALID [2022-04-15 06:42:10,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8495#false} is VALID [2022-04-15 06:42:10,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:10,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:10,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:42:10,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {8552#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8556#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:42:10,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8552#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:42:10,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {8544#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8548#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {8638#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8544#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:42:10,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {8642#(or (not (< 0 (mod (+ main_~y~0 4294967294) 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; {8638#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:42:10,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {8646#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~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; {8642#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:42:10,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {8494#true} ~z~0 := ~y~0; {8646#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:42:10,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {8494#true} [125] 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[] {8494#true} is VALID [2022-04-15 06:42:10,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {8494#true} [126] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_166 v_main_~y~0_165)) (.cse1 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse3 (mod v_main_~x~0_168 4294967296)) (.cse2 (= v_main_~x~0_168 v_main_~x~0_167))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (= (+ v_main_~x~0_168 v_main_~y~0_166 (* v_main_~x~0_167 (- 1))) v_main_~y~0_165) (< v_main_~x~0_167 v_main_~x~0_168) (< 0 .cse3) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_167 v_it_15 1) v_main_~x~0_168)) (< 0 (mod (+ v_main_~x~0_168 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15))))) (and (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse0 .cse1 (<= .cse3 0) .cse2))) InVars {main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_168, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_165, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_167, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8494#true} is VALID [2022-04-15 06:42:10,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {8494#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8494#true} is VALID [2022-04-15 06:42:10,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {8494#true} call #t~ret17 := main(); {8494#true} is VALID [2022-04-15 06:42:10,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8494#true} {8494#true} #94#return; {8494#true} is VALID [2022-04-15 06:42:10,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {8494#true} assume true; {8494#true} is VALID [2022-04-15 06:42:10,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {8494#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); {8494#true} is VALID [2022-04-15 06:42:10,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {8494#true} call ULTIMATE.init(); {8494#true} is VALID [2022-04-15 06:42:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:42:10,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574731552] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:10,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:10,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-04-15 06:42:10,674 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:10,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693122972] [2022-04-15 06:42:10,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693122972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:10,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:10,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:42:10,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377815000] [2022-04-15 06:42:10,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:10,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 28 [2022-04-15 06:42:10,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:10,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:42:10,706 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:42:10,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:42:10,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:10,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:42:10,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:42:10,707 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:42:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:12,136 INFO L93 Difference]: Finished difference Result 153 states and 217 transitions. [2022-04-15 06:42:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:42:12,136 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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 28 [2022-04-15 06:42:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:42:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 81 transitions. [2022-04-15 06:42:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:42:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 81 transitions. [2022-04-15 06:42:12,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 81 transitions. [2022-04-15 06:42:12,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:12,227 INFO L225 Difference]: With dead ends: 153 [2022-04-15 06:42:12,227 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 06:42:12,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1165, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:42:12,228 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 69 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:12,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 53 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 06:42:12,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2022-04-15 06:42:12,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:12,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 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:12,655 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 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:12,655 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 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:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:12,657 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2022-04-15 06:42:12,657 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 189 transitions. [2022-04-15 06:42:12,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:12,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:12,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 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 139 states. [2022-04-15 06:42:12,657 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 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 139 states. [2022-04-15 06:42:12,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:12,659 INFO L93 Difference]: Finished difference Result 139 states and 189 transitions. [2022-04-15 06:42:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 189 transitions. [2022-04-15 06:42:12,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:12,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:12,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:12,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.4074074074074074) internal successors, (152), 108 states have internal predecessors, (152), 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:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 156 transitions. [2022-04-15 06:42:12,661 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 156 transitions. Word has length 28 [2022-04-15 06:42:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:12,661 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 156 transitions. [2022-04-15 06:42:12,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 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:42:12,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 156 transitions. [2022-04-15 06:42:14,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 156 transitions. [2022-04-15 06:42:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:42:14,564 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:14,564 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:14,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 06:42:14,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:14,765 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash 939274105, now seen corresponding path program 3 times [2022-04-15 06:42:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:14,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [84463380] [2022-04-15 06:42:17,026 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:17,028 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:17,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1460360169, now seen corresponding path program 1 times [2022-04-15 06:42:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:17,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791282660] [2022-04-15 06:42:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:17,038 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:42:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:17,050 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:42:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:17,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {9536#(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); {9526#true} is VALID [2022-04-15 06:42:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:42:17,123 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-15 06:42:17,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {9536#(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); {9526#true} is VALID [2022-04-15 06:42:17,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:42:17,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-15 06:42:17,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret17 := main(); {9526#true} is VALID [2022-04-15 06:42:17,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9526#true} is VALID [2022-04-15 06:42:17,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {9526#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_182 v_main_~x~0_181)) (.cse3 (= |v_main_#t~post5_75| |v_main_#t~post5_74|)) (.cse4 (= |v_main_#t~post6_75| |v_main_#t~post6_74|)) (.cse0 (mod v_main_~x~0_182 4294967296))) (or (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_182 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_187 v_it_16 1) v_main_~y~0_186)))) (= v_main_~x~0_181 (+ v_main_~x~0_182 v_main_~y~0_187 (* (- 1) v_main_~y~0_186))) (< 0 .cse0) (< v_main_~y~0_187 v_main_~y~0_186)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_187, main_#t~post5=|v_main_#t~post5_75|, main_~x~0=v_main_~x~0_182, main_#t~post6=|v_main_#t~post6_75|} OutVars{main_~y~0=v_main_~y~0_186, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_181, main_#t~post6=|v_main_#t~post6_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9526#true} is VALID [2022-04-15 06:42:17,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {9526#true} [127] 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[] {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {9531#(<= 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; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {9532#(<= 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; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,130 INFO L290 TraceCheckUtils]: 17: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,131 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,134 INFO L272 TraceCheckUtils]: 24: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:42:17,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {9534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:42:17,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {9535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {9527#false} is VALID [2022-04-15 06:42:17,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-15 06:42:17,135 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:17,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:17,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791282660] [2022-04-15 06:42:17,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791282660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:17,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992843837] [2022-04-15 06:42:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:17,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:17,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:17,137 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:42:17,138 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:42:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:17,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:42:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:17,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:17,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9526#true} is VALID [2022-04-15 06:42:17,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#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); {9526#true} is VALID [2022-04-15 06:42:17,391 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:42:17,391 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-15 06:42:17,391 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret17 := main(); {9526#true} is VALID [2022-04-15 06:42:17,391 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9526#true} is VALID [2022-04-15 06:42:17,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {9526#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_182 v_main_~x~0_181)) (.cse3 (= |v_main_#t~post5_75| |v_main_#t~post5_74|)) (.cse4 (= |v_main_#t~post6_75| |v_main_#t~post6_74|)) (.cse0 (mod v_main_~x~0_182 4294967296))) (or (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_182 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_187 v_it_16 1) v_main_~y~0_186)))) (= v_main_~x~0_181 (+ v_main_~x~0_182 v_main_~y~0_187 (* (- 1) v_main_~y~0_186))) (< 0 .cse0) (< v_main_~y~0_187 v_main_~y~0_186)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_187, main_#t~post5=|v_main_#t~post5_75|, main_~x~0=v_main_~x~0_182, main_#t~post6=|v_main_#t~post6_75|} OutVars{main_~y~0=v_main_~y~0_186, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_181, main_#t~post6=|v_main_#t~post6_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {9526#true} [127] 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[] {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {9526#true} ~z~0 := ~y~0; {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#true} assume !(~z~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {9526#true} assume !(~y~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-15 06:42:17,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-15 06:42:17,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {9526#true} assume !(~x~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,404 INFO L272 TraceCheckUtils]: 24: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:42:17,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:42:17,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {9616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9527#false} is VALID [2022-04-15 06:42:17,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-15 06:42:17,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:17,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:17,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {9527#false} assume !false; {9527#false} is VALID [2022-04-15 06:42:17,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {9616#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9527#false} is VALID [2022-04-15 06:42:17,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9616#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:42:17,636 INFO L272 TraceCheckUtils]: 24: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {9612#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:42:17,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9533#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:17,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9532#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {9526#true} assume !(~x~0 % 4294967296 > 0); {9531#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 15: Hoare triple {9526#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {9526#true} assume !(~y~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {9526#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#true} assume !(~z~0 % 4294967296 > 0); {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {9526#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {9526#true} ~z~0 := ~y~0; {9526#true} is VALID [2022-04-15 06:42:17,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {9526#true} [127] 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[] {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {9526#true} [128] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_187 v_main_~y~0_186)) (.cse2 (= v_main_~x~0_182 v_main_~x~0_181)) (.cse3 (= |v_main_#t~post5_75| |v_main_#t~post5_74|)) (.cse4 (= |v_main_#t~post6_75| |v_main_#t~post6_74|)) (.cse0 (mod v_main_~x~0_182 4294967296))) (or (and (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_182 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_187 v_it_16 1) v_main_~y~0_186)))) (= v_main_~x~0_181 (+ v_main_~x~0_182 v_main_~y~0_187 (* (- 1) v_main_~y~0_186))) (< 0 .cse0) (< v_main_~y~0_187 v_main_~y~0_186)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_187, main_#t~post5=|v_main_#t~post5_75|, main_~x~0=v_main_~x~0_182, main_#t~post6=|v_main_#t~post6_75|} OutVars{main_~y~0=v_main_~y~0_186, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_181, main_#t~post6=|v_main_#t~post6_74|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#true} call #t~ret17 := main(); {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#true} {9526#true} #94#return; {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#true} assume true; {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {9526#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); {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {9526#true} call ULTIMATE.init(); {9526#true} is VALID [2022-04-15 06:42:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:17,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992843837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:17,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:17,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2022-04-15 06:42:17,721 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:17,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [84463380] [2022-04-15 06:42:17,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [84463380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:17,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:17,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:42:17,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118749262] [2022-04-15 06:42:17,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:17,722 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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 29 [2022-04-15 06:42:17,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:17,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:42:17,748 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:42:17,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:42:17,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:17,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:42:17,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:42:17,749 INFO L87 Difference]: Start difference. First operand 113 states and 156 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:42:19,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:19,039 INFO L93 Difference]: Finished difference Result 169 states and 238 transitions. [2022-04-15 06:42:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 06:42:19,039 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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 29 [2022-04-15 06:42:19,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:19,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:42:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-15 06:42:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:42:19,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2022-04-15 06:42:19,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2022-04-15 06:42:19,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:19,118 INFO L225 Difference]: With dead ends: 169 [2022-04-15 06:42:19,118 INFO L226 Difference]: Without dead ends: 164 [2022-04-15 06:42:19,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 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:42:19,118 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 62 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:19,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 49 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:42:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-15 06:42:19,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 119. [2022-04-15 06:42:19,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:19,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 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,600 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 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,600 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 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,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:19,603 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2022-04-15 06:42:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-15 06:42:19,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:19,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:19,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 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 164 states. [2022-04-15 06:42:19,603 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 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 164 states. [2022-04-15 06:42:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:19,605 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2022-04-15 06:42:19,605 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-15 06:42:19,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:19,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:19,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:19,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.4298245614035088) internal successors, (163), 114 states have internal predecessors, (163), 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,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 167 transitions. [2022-04-15 06:42:19,607 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 167 transitions. Word has length 29 [2022-04-15 06:42:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:19,607 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 167 transitions. [2022-04-15 06:42:19,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 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:42:19,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 167 transitions. [2022-04-15 06:42:22,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 167 transitions. [2022-04-15 06:42:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:42:22,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:22,448 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:22,464 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:42:22,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:22,649 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1591798503, now seen corresponding path program 4 times [2022-04-15 06:42:22,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:22,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [566346681] [2022-04-15 06:42:24,754 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:24,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:42:24,834 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:24,836 INFO L85 PathProgramCache]: Analyzing trace with hash 945091063, now seen corresponding path program 1 times [2022-04-15 06:42:24,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:24,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482921991] [2022-04-15 06:42:24,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:24,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:24,844 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:42:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:24,854 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:42:24,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:24,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {10637#(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); {10626#true} is VALID [2022-04-15 06:42:24,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-15 06:42:24,930 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:24,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {10637#(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); {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret17 := main(); {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_197 v_main_~y~0_196)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197)) (.cse2 (= |v_main_#t~post6_80| |v_main_#t~post6_79|)) (.cse3 (mod v_main_~x~0_198 4294967296))) (or (and (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse0 .cse1 .cse2) (and (<= .cse3 0) (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse0 .cse1 .cse2) (and (< v_main_~y~0_197 v_main_~y~0_196) (< 0 .cse3) (= v_main_~x~0_197 (+ v_main_~x~0_198 v_main_~y~0_197 (* (- 1) v_main_~y~0_196))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_198 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_197 v_it_17 1) v_main_~y~0_196)) (not (<= 1 v_it_17))))))) InVars {main_~y~0=v_main_~y~0_197, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_198, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_197, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10626#true} is VALID [2022-04-15 06:42:24,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} [129] 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[] {10626#true} is VALID [2022-04-15 06:42:24,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} ~z~0 := ~y~0; {10631#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:42:24,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {10631#(= (+ 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; {10632#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:24,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {10632#(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; {10633#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:24,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {10633#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {10634#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:24,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {10634#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10635#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:24,935 INFO L290 TraceCheckUtils]: 13: Hoare triple {10635#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10636#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {10636#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {10627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {10627#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {10627#false} assume !(~x~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {10627#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {10627#false} assume !(~z~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-15 06:42:24,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-15 06:42:24,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:24,937 INFO L272 TraceCheckUtils]: 24: Hoare triple {10627#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10627#false} is VALID [2022-04-15 06:42:24,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#false} ~cond := #in~cond; {10627#false} is VALID [2022-04-15 06:42:24,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#false} assume 0 == ~cond; {10627#false} is VALID [2022-04-15 06:42:24,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-15 06:42:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:42:24,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:24,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482921991] [2022-04-15 06:42:24,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482921991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:24,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635308422] [2022-04-15 06:42:24,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:24,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:24,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:24,938 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:42:24,939 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:42:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:24,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:42:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:24,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:25,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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); {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret17 := main(); {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_197 v_main_~y~0_196)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197)) (.cse2 (= |v_main_#t~post6_80| |v_main_#t~post6_79|)) (.cse3 (mod v_main_~x~0_198 4294967296))) (or (and (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse0 .cse1 .cse2) (and (<= .cse3 0) (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse0 .cse1 .cse2) (and (< v_main_~y~0_197 v_main_~y~0_196) (< 0 .cse3) (= v_main_~x~0_197 (+ v_main_~x~0_198 v_main_~y~0_197 (* (- 1) v_main_~y~0_196))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_198 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_197 v_it_17 1) v_main_~y~0_196)) (not (<= 1 v_it_17))))))) InVars {main_~y~0=v_main_~y~0_197, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_198, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_197, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10626#true} is VALID [2022-04-15 06:42:25,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} [129] 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[] {10626#true} is VALID [2022-04-15 06:42:25,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} ~z~0 := ~y~0; {10626#true} is VALID [2022-04-15 06:42:25,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:25,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {10668#(< 0 (mod (+ main_~z~0 1) 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; {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:25,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:25,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:25,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:25,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,107 INFO L290 TraceCheckUtils]: 15: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,107 INFO L290 TraceCheckUtils]: 16: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,108 INFO L290 TraceCheckUtils]: 17: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:25,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:25,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L272 TraceCheckUtils]: 24: Hoare triple {10627#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#false} ~cond := #in~cond; {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#false} assume 0 == ~cond; {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-15 06:42:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:25,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:25,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {10627#false} assume !false; {10627#false} is VALID [2022-04-15 06:42:25,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {10627#false} assume 0 == ~cond; {10627#false} is VALID [2022-04-15 06:42:25,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {10627#false} ~cond := #in~cond; {10627#false} is VALID [2022-04-15 06:42:25,186 INFO L272 TraceCheckUtils]: 24: Hoare triple {10627#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {10627#false} is VALID [2022-04-15 06:42:25,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {10627#false} assume !(~y~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:25,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-15 06:42:25,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {10627#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {10627#false} is VALID [2022-04-15 06:42:25,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10627#false} is VALID [2022-04-15 06:42:25,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:25,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {10682#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:25,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:25,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:25,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:25,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {10668#(< 0 (mod (+ main_~z~0 1) 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; {10672#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:25,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {10626#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10668#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:25,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {10626#true} ~z~0 := ~y~0; {10626#true} is VALID [2022-04-15 06:42:25,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {10626#true} [129] 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[] {10626#true} is VALID [2022-04-15 06:42:25,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {10626#true} [130] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_197 v_main_~y~0_196)) (.cse1 (= v_main_~x~0_198 v_main_~x~0_197)) (.cse2 (= |v_main_#t~post6_80| |v_main_#t~post6_79|)) (.cse3 (mod v_main_~x~0_198 4294967296))) (or (and (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse0 .cse1 .cse2) (and (<= .cse3 0) (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse0 .cse1 .cse2) (and (< v_main_~y~0_197 v_main_~y~0_196) (< 0 .cse3) (= v_main_~x~0_197 (+ v_main_~x~0_198 v_main_~y~0_197 (* (- 1) v_main_~y~0_196))) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_198 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~y~0_197 v_it_17 1) v_main_~y~0_196)) (not (<= 1 v_it_17))))))) InVars {main_~y~0=v_main_~y~0_197, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_198, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_197, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {10626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {10626#true} call #t~ret17 := main(); {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10626#true} {10626#true} #94#return; {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {10626#true} assume true; {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {10626#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); {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {10626#true} call ULTIMATE.init(); {10626#true} is VALID [2022-04-15 06:42:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:25,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635308422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:25,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:25,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 13 [2022-04-15 06:42:25,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:25,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [566346681] [2022-04-15 06:42:25,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [566346681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:25,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:25,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:42:25,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040019860] [2022-04-15 06:42:25,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:25,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 29 [2022-04-15 06:42:25,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:25,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:42:25,278 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:42:25,278 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:42:25,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:25,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:42:25,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-04-15 06:42:25,279 INFO L87 Difference]: Start difference. First operand 119 states and 167 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:42:26,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:26,619 INFO L93 Difference]: Finished difference Result 141 states and 195 transitions. [2022-04-15 06:42:26,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:42:26,619 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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 29 [2022-04-15 06:42:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:42:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-15 06:42:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:42:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 71 transitions. [2022-04-15 06:42:26,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 71 transitions. [2022-04-15 06:42:26,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:26,685 INFO L225 Difference]: With dead ends: 141 [2022-04-15 06:42:26,686 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 06:42:26,686 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=640, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:42:26,686 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:26,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 59 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 06:42:27,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2022-04-15 06:42:27,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:27,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 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:27,146 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 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:27,146 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 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:27,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:27,148 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-15 06:42:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-15 06:42:27,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:27,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:27,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 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 118 states. [2022-04-15 06:42:27,148 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 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 118 states. [2022-04-15 06:42:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:27,149 INFO L93 Difference]: Finished difference Result 118 states and 164 transitions. [2022-04-15 06:42:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2022-04-15 06:42:27,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:27,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:27,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:27,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 105 states have internal predecessors, (150), 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:27,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 154 transitions. [2022-04-15 06:42:27,151 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 154 transitions. Word has length 29 [2022-04-15 06:42:27,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:27,151 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 154 transitions. [2022-04-15 06:42:27,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 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:42:27,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 154 transitions. [2022-04-15 06:42:29,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 153 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 154 transitions. [2022-04-15 06:42:29,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:42:29,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:29,922 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:29,944 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:42:30,122 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:30,122 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:30,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:30,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1563256359, now seen corresponding path program 4 times [2022-04-15 06:42:30,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:30,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6438010] [2022-04-15 06:42:30,941 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:30,942 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:30,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1615189751, now seen corresponding path program 1 times [2022-04-15 06:42:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:30,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72532920] [2022-04-15 06:42:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:30,952 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:42:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:30,967 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:42:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {11588#(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); {11577#true} is VALID [2022-04-15 06:42:31,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-15 06:42:31,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-15 06:42:31,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:31,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {11588#(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); {11577#true} is VALID [2022-04-15 06:42:31,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-15 06:42:31,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-15 06:42:31,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret17 := main(); {11577#true} is VALID [2022-04-15 06:42:31,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11577#true} is VALID [2022-04-15 06:42:31,038 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_213 4294967296)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse3 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse4 (= v_main_~y~0_213 v_main_~y~0_212))) (or (and (< v_main_~x~0_212 v_main_~x~0_213) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_212 v_it_18 1) v_main_~x~0_213)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_213 (* 4294967295 v_it_18)) 4294967296)))) (= v_main_~y~0_212 (+ v_main_~x~0_213 v_main_~y~0_213 (* v_main_~x~0_212 (- 1))))) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11577#true} is VALID [2022-04-15 06:42:31,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} [131] 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[] {11577#true} is VALID [2022-04-15 06:42:31,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} ~z~0 := ~y~0; {11582#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:31,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {11582#(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; {11583#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:31,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {11583#(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; {11584#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:31,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {11584#(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; {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:31,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:31,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:31,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:31,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,043 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#false} assume !(~x~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#false} assume !(~z~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#false} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L272 TraceCheckUtils]: 24: Hoare triple {11578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {11578#false} ~cond := #in~cond; {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#false} assume 0 == ~cond; {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-15 06:42:31,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:31,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:31,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72532920] [2022-04-15 06:42:31,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72532920] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:31,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101406867] [2022-04-15 06:42:31,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:31,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:31,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:31,046 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:42:31,047 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:42:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:42:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:31,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:31,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#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); {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret17 := main(); {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_213 4294967296)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse3 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse4 (= v_main_~y~0_213 v_main_~y~0_212))) (or (and (< v_main_~x~0_212 v_main_~x~0_213) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_212 v_it_18 1) v_main_~x~0_213)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_213 (* 4294967295 v_it_18)) 4294967296)))) (= v_main_~y~0_212 (+ v_main_~x~0_213 v_main_~y~0_213 (* v_main_~x~0_212 (- 1))))) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11577#true} is VALID [2022-04-15 06:42:31,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} [131] 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[] {11577#true} is VALID [2022-04-15 06:42:31,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} ~z~0 := ~y~0; {11582#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:31,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {11582#(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; {11583#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:31,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {11583#(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; {11584#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:31,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {11584#(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; {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:31,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:31,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:31,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:31,415 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#false} assume !(~x~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#false} assume !(~z~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#false} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L272 TraceCheckUtils]: 24: Hoare triple {11578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {11578#false} ~cond := #in~cond; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#false} assume 0 == ~cond; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-15 06:42:31,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:31,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:31,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {11578#false} assume !false; {11578#false} is VALID [2022-04-15 06:42:31,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {11578#false} assume 0 == ~cond; {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {11578#false} ~cond := #in~cond; {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L272 TraceCheckUtils]: 24: Hoare triple {11578#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {11578#false} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {11578#false} assume !(~z~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {11578#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {11578#false} assume !(~x~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {11578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11578#false} is VALID [2022-04-15 06:42:31,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {11578#false} is VALID [2022-04-15 06:42:31,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11587#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:42:31,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11586#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:42:31,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:31,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {11721#(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; {11585#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:42:31,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {11725#(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; {11721#(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:42:31,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {11729#(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; {11725#(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:42:31,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {11577#true} ~z~0 := ~y~0; {11729#(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:42:31,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {11577#true} [131] 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[] {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {11577#true} [132] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_213 4294967296)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse3 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse4 (= v_main_~y~0_213 v_main_~y~0_212))) (or (and (< v_main_~x~0_212 v_main_~x~0_213) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~x~0_212 v_it_18 1) v_main_~x~0_213)) (not (<= 1 v_it_18)) (< 0 (mod (+ v_main_~x~0_213 (* 4294967295 v_it_18)) 4294967296)))) (= v_main_~y~0_212 (+ v_main_~x~0_213 v_main_~y~0_213 (* v_main_~x~0_212 (- 1))))) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_213, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {11577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {11577#true} call #t~ret17 := main(); {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11577#true} {11577#true} #94#return; {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {11577#true} assume true; {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {11577#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); {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {11577#true} call ULTIMATE.init(); {11577#true} is VALID [2022-04-15 06:42:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:31,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101406867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:31,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:31,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-15 06:42:31,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:31,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6438010] [2022-04-15 06:42:31,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6438010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:31,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:31,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:42:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609874594] [2022-04-15 06:42:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 29 [2022-04-15 06:42:31,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:31,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:42:31,784 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:42:31,784 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:42:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:42:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:42:31,785 INFO L87 Difference]: Start difference. First operand 110 states and 154 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:42:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,180 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2022-04-15 06:42:33,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 06:42:33,181 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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 29 [2022-04-15 06:42:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:42:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-15 06:42:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:42:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 72 transitions. [2022-04-15 06:42:33,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 72 transitions. [2022-04-15 06:42:33,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:33,297 INFO L225 Difference]: With dead ends: 135 [2022-04-15 06:42:33,297 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 06:42:33,298 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=692, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:42:33,298 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:33,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 59 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:33,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 06:42:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2022-04-15 06:42:33,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:33,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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:33,692 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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:33,692 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,694 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-04-15 06:42:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2022-04-15 06:42:33,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:33,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:33,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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 101 states. [2022-04-15 06:42:33,695 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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 101 states. [2022-04-15 06:42:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:33,696 INFO L93 Difference]: Finished difference Result 101 states and 140 transitions. [2022-04-15 06:42:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 140 transitions. [2022-04-15 06:42:33,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:33,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:33,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:33,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:33,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2022-04-15 06:42:33,698 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 29 [2022-04-15 06:42:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:33,698 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2022-04-15 06:42:33,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 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:42:33,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 129 transitions. [2022-04-15 06:42:35,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2022-04-15 06:42:35,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 06:42:35,191 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:35,191 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:35,207 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:42:35,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 06:42:35,392 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash -34809929, now seen corresponding path program 5 times [2022-04-15 06:42:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:35,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494841171] [2022-04-15 06:42:35,551 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:35,552 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash -509774571, now seen corresponding path program 1 times [2022-04-15 06:42:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:35,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207365754] [2022-04-15 06:42:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:35,571 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:42:35,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:35,588 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:42:35,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:35,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {12464#(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); {12451#true} is VALID [2022-04-15 06:42:35,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-15 06:42:35,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-15 06:42:35,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {12451#true} call ULTIMATE.init(); {12464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:35,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {12464#(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); {12451#true} is VALID [2022-04-15 06:42:35,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-15 06:42:35,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-15 06:42:35,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {12451#true} call #t~ret17 := main(); {12451#true} is VALID [2022-04-15 06:42:35,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {12451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12451#true} is VALID [2022-04-15 06:42:35,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {12451#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_229 v_main_~x~0_228)) (.cse3 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse0 (mod v_main_~x~0_229 4294967296))) (or (and (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_228 v_it_19 1) v_main_~x~0_229)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_229 (* 4294967295 v_it_19)) 4294967296)))) (< v_main_~x~0_228 v_main_~x~0_229) (= v_main_~y~0_227 (+ v_main_~x~0_229 v_main_~y~0_228 (* v_main_~x~0_228 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_90| |v_main_#t~post6_89|)) (and .cse1 .cse2 .cse3 (<= .cse0 0) (= |v_main_#t~post6_89| |v_main_#t~post6_90|)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_229, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12451#true} is VALID [2022-04-15 06:42:35,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#true} [133] 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[] {12451#true} is VALID [2022-04-15 06:42:35,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {12451#true} ~z~0 := ~y~0; {12456#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:35,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {12456#(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; {12457#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:35,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {12457#(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; {12458#(and (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)) (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 2))))} is VALID [2022-04-15 06:42:35,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {12458#(and (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ main_~z~0 2) main_~y~0)) (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= 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; {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:42:35,729 INFO L290 TraceCheckUtils]: 12: Hoare triple {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:42:35,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {12459#(or (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967298) 4294967296) 4294967296) main_~z~0) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12460#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 06:42:35,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {12460#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12461#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {12461#(<= (+ 2 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {12462#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12463#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:42:35,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {12463#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-15 06:42:35,735 INFO L290 TraceCheckUtils]: 23: Hoare triple {12452#false} assume !(~y~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-15 06:42:35,735 INFO L272 TraceCheckUtils]: 24: Hoare triple {12452#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12452#false} is VALID [2022-04-15 06:42:35,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {12452#false} ~cond := #in~cond; {12452#false} is VALID [2022-04-15 06:42:35,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#false} assume 0 == ~cond; {12452#false} is VALID [2022-04-15 06:42:35,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#false} assume !false; {12452#false} is VALID [2022-04-15 06:42:35,736 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:35,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:35,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207365754] [2022-04-15 06:42:35,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207365754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:35,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595313446] [2022-04-15 06:42:35,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:35,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:35,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:35,747 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:42:35,748 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:42:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:35,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:42:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:35,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:36,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {12451#true} call ULTIMATE.init(); {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {12451#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); {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {12451#true} call #t~ret17 := main(); {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {12451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {12451#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_229 v_main_~x~0_228)) (.cse3 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse0 (mod v_main_~x~0_229 4294967296))) (or (and (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_228 v_it_19 1) v_main_~x~0_229)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_229 (* 4294967295 v_it_19)) 4294967296)))) (< v_main_~x~0_228 v_main_~x~0_229) (= v_main_~y~0_227 (+ v_main_~x~0_229 v_main_~y~0_228 (* v_main_~x~0_228 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_90| |v_main_#t~post6_89|)) (and .cse1 .cse2 .cse3 (<= .cse0 0) (= |v_main_#t~post6_89| |v_main_#t~post6_90|)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_229, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12451#true} is VALID [2022-04-15 06:42:36,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#true} [133] 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[] {12451#true} is VALID [2022-04-15 06:42:36,023 INFO L290 TraceCheckUtils]: 8: Hoare triple {12451#true} ~z~0 := ~y~0; {12456#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:42:36,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {12456#(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; {12457#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:36,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {12457#(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; {12498#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:42:36,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {12498#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= 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; {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:36,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:42:36,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {12502#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12509#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:42:36,027 INFO L290 TraceCheckUtils]: 14: Hoare triple {12509#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:36,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:36,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-15 06:42:36,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {12452#false} assume !(~y~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-15 06:42:36,031 INFO L272 TraceCheckUtils]: 24: Hoare triple {12452#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12452#false} is VALID [2022-04-15 06:42:36,031 INFO L290 TraceCheckUtils]: 25: Hoare triple {12452#false} ~cond := #in~cond; {12452#false} is VALID [2022-04-15 06:42:36,031 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#false} assume 0 == ~cond; {12452#false} is VALID [2022-04-15 06:42:36,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#false} assume !false; {12452#false} is VALID [2022-04-15 06:42:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:36,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:36,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {12452#false} assume !false; {12452#false} is VALID [2022-04-15 06:42:36,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {12452#false} assume 0 == ~cond; {12452#false} is VALID [2022-04-15 06:42:36,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {12452#false} ~cond := #in~cond; {12452#false} is VALID [2022-04-15 06:42:36,142 INFO L272 TraceCheckUtils]: 24: Hoare triple {12452#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {12452#false} is VALID [2022-04-15 06:42:36,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {12452#false} assume !(~y~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-15 06:42:36,142 INFO L290 TraceCheckUtils]: 22: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {12452#false} is VALID [2022-04-15 06:42:36,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:36,144 INFO L290 TraceCheckUtils]: 20: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,144 INFO L290 TraceCheckUtils]: 19: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {12513#(< 0 (mod main_~z~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12517#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 06:42:36,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {12593#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12513#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:42:36,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12593#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:36,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:36,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {12593#(< 0 (mod (+ main_~z~0 1) 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; {12597#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {12451#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12593#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {12451#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {12451#true} ~z~0 := ~y~0; {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {12451#true} [133] 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[] {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {12451#true} [134] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_229 v_main_~x~0_228)) (.cse3 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse0 (mod v_main_~x~0_229 4294967296))) (or (and (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_228 v_it_19 1) v_main_~x~0_229)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_229 (* 4294967295 v_it_19)) 4294967296)))) (< v_main_~x~0_228 v_main_~x~0_229) (= v_main_~y~0_227 (+ v_main_~x~0_229 v_main_~y~0_228 (* v_main_~x~0_228 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_90| |v_main_#t~post6_89|)) (and .cse1 .cse2 .cse3 (<= .cse0 0) (= |v_main_#t~post6_89| |v_main_#t~post6_90|)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_229, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_228, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {12451#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {12451#true} call #t~ret17 := main(); {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12451#true} {12451#true} #94#return; {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {12451#true} assume true; {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {12451#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); {12451#true} is VALID [2022-04-15 06:42:36,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {12451#true} call ULTIMATE.init(); {12451#true} is VALID [2022-04-15 06:42:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:42:36,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595313446] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:36,155 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:36,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 6] total 18 [2022-04-15 06:42:36,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:36,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494841171] [2022-04-15 06:42:36,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494841171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:36,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:36,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:42:36,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782095473] [2022-04-15 06:42:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:36,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-15 06:42:36,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:36,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:42:36,259 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:42:36,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:42:36,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:36,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:42:36,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:42:36,260 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:42:39,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:42:40,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:40,291 INFO L93 Difference]: Finished difference Result 140 states and 194 transitions. [2022-04-15 06:42:40,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:42:40,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-15 06:42:40,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:40,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:42:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2022-04-15 06:42:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:42:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2022-04-15 06:42:40,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 72 transitions. [2022-04-15 06:42:40,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:40,578 INFO L225 Difference]: With dead ends: 140 [2022-04-15 06:42:40,579 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 06:42:40,579 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=1190, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:42:40,579 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:40,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 67 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 401 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 06:42:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 06:42:41,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 106. [2022-04-15 06:42:41,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:41,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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:41,080 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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:41,080 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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:41,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,082 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2022-04-15 06:42:41,082 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2022-04-15 06:42:41,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:41,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:41,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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 130 states. [2022-04-15 06:42:41,082 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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 130 states. [2022-04-15 06:42:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:41,084 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2022-04-15 06:42:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2022-04-15 06:42:41,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:41,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:41,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:41,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 101 states have internal predecessors, (143), 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:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 147 transitions. [2022-04-15 06:42:41,085 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 147 transitions. Word has length 29 [2022-04-15 06:42:41,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:41,085 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 147 transitions. [2022-04-15 06:42:41,085 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:42:41,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 147 transitions. [2022-04-15 06:42:44,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 146 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 147 transitions. [2022-04-15 06:42:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 06:42:44,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:44,103 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:44,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 06:42:44,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:44,315 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:44,316 INFO L85 PathProgramCache]: Analyzing trace with hash -912778699, now seen corresponding path program 5 times [2022-04-15 06:42:44,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:44,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430384973] [2022-04-15 06:42:44,532 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:44,534 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -43397033, now seen corresponding path program 1 times [2022-04-15 06:42:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:44,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618752660] [2022-04-15 06:42:44,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:44,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:44,544 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:42:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,556 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:42:44,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {13439#(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); {13431#true} is VALID [2022-04-15 06:42:44,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {13431#true} assume true; {13431#true} is VALID [2022-04-15 06:42:44,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13431#true} {13431#true} #94#return; {13431#true} is VALID [2022-04-15 06:42:44,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {13431#true} call ULTIMATE.init(); {13439#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:44,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {13439#(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); {13431#true} is VALID [2022-04-15 06:42:44,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {13431#true} assume true; {13431#true} is VALID [2022-04-15 06:42:44,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13431#true} {13431#true} #94#return; {13431#true} is VALID [2022-04-15 06:42:44,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {13431#true} call #t~ret17 := main(); {13431#true} is VALID [2022-04-15 06:42:44,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {13431#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13431#true} is VALID [2022-04-15 06:42:44,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {13431#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_243 4294967296)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse2 (= v_main_~x~0_243 v_main_~x~0_242)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse4 (= v_main_~y~0_244 v_main_~y~0_243))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~x~0_242 v_main_~x~0_243) (< 0 .cse1) (forall ((v_it_20 Int)) (or (not (<= (+ v_main_~x~0_242 v_it_20 1) v_main_~x~0_243)) (< 0 (mod (+ v_main_~x~0_243 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)))) (= v_main_~y~0_243 (+ v_main_~x~0_243 v_main_~y~0_244 (* v_main_~x~0_242 (- 1))))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_243, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_243, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_242, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 7: Hoare triple {13431#true} [135] 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[] {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {13431#true} ~z~0 := ~y~0; {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {13431#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {13431#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {13431#true} assume !(~z~0 % 4294967296 > 0); {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {13431#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13431#true} is VALID [2022-04-15 06:42:44,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {13431#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13431#true} is VALID [2022-04-15 06:42:44,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {13431#true} assume !(~y~0 % 4294967296 > 0); {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:44,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:44,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:44,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:44,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13432#false} is VALID [2022-04-15 06:42:44,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {13432#false} assume !(~y~0 % 4294967296 > 0); {13432#false} is VALID [2022-04-15 06:42:44,617 INFO L272 TraceCheckUtils]: 25: Hoare triple {13432#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13432#false} is VALID [2022-04-15 06:42:44,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {13432#false} ~cond := #in~cond; {13432#false} is VALID [2022-04-15 06:42:44,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {13432#false} assume 0 == ~cond; {13432#false} is VALID [2022-04-15 06:42:44,618 INFO L290 TraceCheckUtils]: 28: Hoare triple {13432#false} assume !false; {13432#false} is VALID [2022-04-15 06:42:44,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:44,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:44,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618752660] [2022-04-15 06:42:44,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618752660] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:44,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781268104] [2022-04-15 06:42:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:44,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:44,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:44,619 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:42:44,620 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:42:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:42:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:44,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:44,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {13431#true} call ULTIMATE.init(); {13431#true} is VALID [2022-04-15 06:42:44,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {13431#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); {13431#true} is VALID [2022-04-15 06:42:44,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {13431#true} assume true; {13431#true} is VALID [2022-04-15 06:42:44,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13431#true} {13431#true} #94#return; {13431#true} is VALID [2022-04-15 06:42:44,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {13431#true} call #t~ret17 := main(); {13431#true} is VALID [2022-04-15 06:42:44,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {13431#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13431#true} is VALID [2022-04-15 06:42:44,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {13431#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_243 4294967296)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse2 (= v_main_~x~0_243 v_main_~x~0_242)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse4 (= v_main_~y~0_244 v_main_~y~0_243))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~x~0_242 v_main_~x~0_243) (< 0 .cse1) (forall ((v_it_20 Int)) (or (not (<= (+ v_main_~x~0_242 v_it_20 1) v_main_~x~0_243)) (< 0 (mod (+ v_main_~x~0_243 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)))) (= v_main_~y~0_243 (+ v_main_~x~0_243 v_main_~y~0_244 (* v_main_~x~0_242 (- 1))))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_243, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_243, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_242, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13431#true} is VALID [2022-04-15 06:42:44,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {13431#true} [135] 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[] {13431#true} is VALID [2022-04-15 06:42:44,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {13431#true} ~z~0 := ~y~0; {13467#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:44,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {13467#(= 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; {13471#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:44,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {13471#(= 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; {13475#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:42:44,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {13475#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:44,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:44,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:44,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:44,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:44,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:44,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:44,903 INFO L290 TraceCheckUtils]: 23: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13432#false} is VALID [2022-04-15 06:42:44,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {13432#false} assume !(~y~0 % 4294967296 > 0); {13432#false} is VALID [2022-04-15 06:42:44,904 INFO L272 TraceCheckUtils]: 25: Hoare triple {13432#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13432#false} is VALID [2022-04-15 06:42:44,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {13432#false} ~cond := #in~cond; {13432#false} is VALID [2022-04-15 06:42:44,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {13432#false} assume 0 == ~cond; {13432#false} is VALID [2022-04-15 06:42:44,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {13432#false} assume !false; {13432#false} is VALID [2022-04-15 06:42:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:44,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:45,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {13432#false} assume !false; {13432#false} is VALID [2022-04-15 06:42:45,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {13432#false} assume 0 == ~cond; {13432#false} is VALID [2022-04-15 06:42:45,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {13432#false} ~cond := #in~cond; {13432#false} is VALID [2022-04-15 06:42:45,204 INFO L272 TraceCheckUtils]: 25: Hoare triple {13432#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {13432#false} is VALID [2022-04-15 06:42:45,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {13432#false} assume !(~y~0 % 4294967296 > 0); {13432#false} is VALID [2022-04-15 06:42:45,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13432#false} is VALID [2022-04-15 06:42:45,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:45,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:45,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:45,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:45,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:45,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:45,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:45,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:45,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:45,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13436#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:42:45,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13437#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:42:45,211 INFO L290 TraceCheckUtils]: 11: Hoare triple {13581#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {13438#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:45,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {13585#(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; {13581#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:42:45,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {13589#(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; {13585#(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:42:45,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {13431#true} ~z~0 := ~y~0; {13589#(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:42:45,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {13431#true} [135] 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[] {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {13431#true} [136] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_243 4294967296)) (.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse2 (= v_main_~x~0_243 v_main_~x~0_242)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse4 (= v_main_~y~0_244 v_main_~y~0_243))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~x~0_242 v_main_~x~0_243) (< 0 .cse1) (forall ((v_it_20 Int)) (or (not (<= (+ v_main_~x~0_242 v_it_20 1) v_main_~x~0_243)) (< 0 (mod (+ v_main_~x~0_243 (* 4294967295 v_it_20)) 4294967296)) (not (<= 1 v_it_20)))) (= v_main_~y~0_243 (+ v_main_~x~0_243 v_main_~y~0_244 (* v_main_~x~0_242 (- 1))))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_244, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_243, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_243, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_242, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {13431#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {13431#true} call #t~ret17 := main(); {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13431#true} {13431#true} #94#return; {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {13431#true} assume true; {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {13431#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); {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {13431#true} call ULTIMATE.init(); {13431#true} is VALID [2022-04-15 06:42:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:42:45,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781268104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:45,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:45,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 12 [2022-04-15 06:42:45,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:45,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430384973] [2022-04-15 06:42:45,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430384973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:45,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:45,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:42:45,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406203788] [2022-04-15 06:42:45,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:45,291 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 30 [2022-04-15 06:42:45,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:45,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:42:45,316 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:42:45,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:42:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:45,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:42:45,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:42:45,317 INFO L87 Difference]: Start difference. First operand 106 states and 147 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:42:46,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:46,755 INFO L93 Difference]: Finished difference Result 211 states and 296 transitions. [2022-04-15 06:42:46,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:42:46,755 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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 30 [2022-04-15 06:42:46,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:42:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-04-15 06:42:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:42:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-04-15 06:42:46,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 88 transitions. [2022-04-15 06:42:46,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:46,855 INFO L225 Difference]: With dead ends: 211 [2022-04-15 06:42:46,856 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 06:42:46,856 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:42:46,856 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 46 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:46,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 49 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:42:46,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 06:42:47,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-04-15 06:42:47,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:47,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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:47,338 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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:47,338 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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:47,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:47,346 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-15 06:42:47,346 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-15 06:42:47,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:47,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:47,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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 108 states. [2022-04-15 06:42:47,347 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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 108 states. [2022-04-15 06:42:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:47,355 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-15 06:42:47,355 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 149 transitions. [2022-04-15 06:42:47,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:47,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:47,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:47,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.434782608695652) internal successors, (132), 92 states have internal predecessors, (132), 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:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2022-04-15 06:42:47,357 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 30 [2022-04-15 06:42:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:47,357 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2022-04-15 06:42:47,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 7 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:42:47,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 136 transitions. [2022-04-15 06:42:50,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 135 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2022-04-15 06:42:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:42:50,756 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:50,756 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:50,778 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:42:50,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:50,964 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:42:50,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:42:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1612780265, now seen corresponding path program 6 times [2022-04-15 06:42:50,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962936196] [2022-04-15 06:42:53,155 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:42:53,268 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:53,269 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:42:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash -358986232, now seen corresponding path program 1 times [2022-04-15 06:42:53,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:42:53,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227314094] [2022-04-15 06:42:53,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:42:53,280 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:42:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:53,292 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:42:53,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:42:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:53,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {14491#(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); {14482#true} is VALID [2022-04-15 06:42:53,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-15 06:42:53,358 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14482#true} {14482#true} #94#return; {14482#true} is VALID [2022-04-15 06:42:53,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {14482#true} call ULTIMATE.init(); {14491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:42:53,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {14491#(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); {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14482#true} {14482#true} #94#return; {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {14482#true} call #t~ret17 := main(); {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 5: Hoare triple {14482#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {14482#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_261 4294967296)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse2 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_266 v_it_21 1) v_main_~y~0_265)) (< 0 (mod (+ v_main_~x~0_261 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~y~0_266 v_main_~y~0_265) (< 0 .cse0) (= v_main_~x~0_260 (+ v_main_~x~0_261 (* (- 1) v_main_~y~0_265) v_main_~y~0_266))) (and (= |v_main_#t~post6_100| |v_main_#t~post6_99|) .cse1 .cse2 (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and (<= .cse0 0) .cse1 (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= |v_main_#t~post5_99| |v_main_#t~post5_100|) .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {14482#true} [137] 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[] {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 8: Hoare triple {14482#true} ~z~0 := ~y~0; {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {14482#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14482#true} is VALID [2022-04-15 06:42:53,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {14482#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14482#true} is VALID [2022-04-15 06:42:53,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {14482#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14487#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {14487#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14487#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {14487#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:53,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:42:53,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,364 INFO L290 TraceCheckUtils]: 18: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:42:53,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:53,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14483#false} is VALID [2022-04-15 06:42:53,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {14483#false} assume !(~y~0 % 4294967296 > 0); {14483#false} is VALID [2022-04-15 06:42:53,367 INFO L272 TraceCheckUtils]: 25: Hoare triple {14483#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14483#false} is VALID [2022-04-15 06:42:53,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {14483#false} ~cond := #in~cond; {14483#false} is VALID [2022-04-15 06:42:53,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {14483#false} assume 0 == ~cond; {14483#false} is VALID [2022-04-15 06:42:53,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {14483#false} assume !false; {14483#false} is VALID [2022-04-15 06:42:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:42:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:42:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227314094] [2022-04-15 06:42:53,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227314094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:42:53,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396579878] [2022-04-15 06:42:53,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:42:53,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:42:53,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:42:53,369 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:42:53,377 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:42:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:53,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:42:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:42:53,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:42:53,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {14482#true} call ULTIMATE.init(); {14482#true} is VALID [2022-04-15 06:42:53,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {14482#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); {14482#true} is VALID [2022-04-15 06:42:53,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-15 06:42:53,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14482#true} {14482#true} #94#return; {14482#true} is VALID [2022-04-15 06:42:53,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {14482#true} call #t~ret17 := main(); {14482#true} is VALID [2022-04-15 06:42:53,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {14482#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14482#true} is VALID [2022-04-15 06:42:53,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {14482#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_261 4294967296)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse2 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_266 v_it_21 1) v_main_~y~0_265)) (< 0 (mod (+ v_main_~x~0_261 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~y~0_266 v_main_~y~0_265) (< 0 .cse0) (= v_main_~x~0_260 (+ v_main_~x~0_261 (* (- 1) v_main_~y~0_265) v_main_~y~0_266))) (and (= |v_main_#t~post6_100| |v_main_#t~post6_99|) .cse1 .cse2 (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and (<= .cse0 0) .cse1 (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= |v_main_#t~post5_99| |v_main_#t~post5_100|) .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14482#true} is VALID [2022-04-15 06:42:53,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {14482#true} [137] 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[] {14482#true} is VALID [2022-04-15 06:42:53,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {14482#true} ~z~0 := ~y~0; {14519#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:42:53,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {14519#(= 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; {14523#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:53,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {14523#(= 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; {14527#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:42:53,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {14527#(= 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; {14531#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:42:53,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {14531#(= main_~y~0 (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {14531#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:42:53,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {14531#(= main_~y~0 (+ main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14523#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:42:53,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {14523#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14541#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:42:53,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {14541#(= main_~z~0 (+ main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:53,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:42:53,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:53,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14483#false} is VALID [2022-04-15 06:42:53,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {14483#false} assume !(~y~0 % 4294967296 > 0); {14483#false} is VALID [2022-04-15 06:42:53,688 INFO L272 TraceCheckUtils]: 25: Hoare triple {14483#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14483#false} is VALID [2022-04-15 06:42:53,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {14483#false} ~cond := #in~cond; {14483#false} is VALID [2022-04-15 06:42:53,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {14483#false} assume 0 == ~cond; {14483#false} is VALID [2022-04-15 06:42:53,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {14483#false} assume !false; {14483#false} is VALID [2022-04-15 06:42:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:53,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:42:54,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {14483#false} assume !false; {14483#false} is VALID [2022-04-15 06:42:54,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {14483#false} assume 0 == ~cond; {14483#false} is VALID [2022-04-15 06:42:54,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {14483#false} ~cond := #in~cond; {14483#false} is VALID [2022-04-15 06:42:54,080 INFO L272 TraceCheckUtils]: 25: Hoare triple {14483#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {14483#false} is VALID [2022-04-15 06:42:54,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {14483#false} assume !(~y~0 % 4294967296 > 0); {14483#false} is VALID [2022-04-15 06:42:54,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14483#false} is VALID [2022-04-15 06:42:54,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14488#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:42:54,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14489#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:42:54,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:54,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:54,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:54,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:54,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:54,087 INFO L290 TraceCheckUtils]: 15: Hoare triple {14623#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14490#(<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:42:54,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {14627#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14623#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)))} is VALID [2022-04-15 06:42:54,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {14631#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14627#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 06:42:54,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {14631#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14631#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:54,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {14638#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~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; {14631#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:54,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {14642#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~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; {14638#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:42:54,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {14646#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~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; {14642#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)))} is VALID [2022-04-15 06:42:54,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {14482#true} ~z~0 := ~y~0; {14646#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 06:42:54,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {14482#true} [137] 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[] {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {14482#true} [138] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_261 4294967296)) (.cse1 (= v_main_~x~0_261 v_main_~x~0_260)) (.cse2 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_266 v_it_21 1) v_main_~y~0_265)) (< 0 (mod (+ v_main_~x~0_261 (* 4294967295 v_it_21)) 4294967296)))) (< v_main_~y~0_266 v_main_~y~0_265) (< 0 .cse0) (= v_main_~x~0_260 (+ v_main_~x~0_261 (* (- 1) v_main_~y~0_265) v_main_~y~0_266))) (and (= |v_main_#t~post6_100| |v_main_#t~post6_99|) .cse1 .cse2 (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and (<= .cse0 0) .cse1 (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= |v_main_#t~post5_99| |v_main_#t~post5_100|) .cse2))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_260, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {14482#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {14482#true} call #t~ret17 := main(); {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14482#true} {14482#true} #94#return; {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {14482#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); {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {14482#true} call ULTIMATE.init(); {14482#true} is VALID [2022-04-15 06:42:54,094 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:42:54,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396579878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:42:54,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:42:54,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 18 [2022-04-15 06:42:54,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:42:54,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962936196] [2022-04-15 06:42:54,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962936196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:42:54,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:42:54,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:42:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33751064] [2022-04-15 06:42:54,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:42:54,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 31 [2022-04-15 06:42:54,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:42:54,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:42:54,227 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:42:54,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:42:54,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:42:54,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:42:54,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-04-15 06:42:54,228 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:42:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:56,088 INFO L93 Difference]: Finished difference Result 128 states and 176 transitions. [2022-04-15 06:42:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:42:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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 31 [2022-04-15 06:42:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:42:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:42:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-15 06:42:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:42:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 71 transitions. [2022-04-15 06:42:56,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 71 transitions. [2022-04-15 06:42:56,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:56,186 INFO L225 Difference]: With dead ends: 128 [2022-04-15 06:42:56,186 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 06:42:56,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=260, Invalid=1222, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:42:56,187 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:42:56,187 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 53 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:42:56,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 06:42:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-04-15 06:42:56,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:42:56,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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:56,691 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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:56,691 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:56,692 INFO L93 Difference]: Finished difference Result 117 states and 160 transitions. [2022-04-15 06:42:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2022-04-15 06:42:56,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:56,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:56,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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 117 states. [2022-04-15 06:42:56,693 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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 117 states. [2022-04-15 06:42:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:42:56,694 INFO L93 Difference]: Finished difference Result 117 states and 160 transitions. [2022-04-15 06:42:56,694 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 160 transitions. [2022-04-15 06:42:56,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:42:56,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:42:56,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:42:56,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:42:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 95 states have internal predecessors, (135), 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:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2022-04-15 06:42:56,698 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 31 [2022-04-15 06:42:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:42:56,698 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2022-04-15 06:42:56,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 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:42:56,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 139 transitions. [2022-04-15 06:42:59,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:42:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2022-04-15 06:42:59,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:42:59,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:42:59,828 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:42:59,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 06:43:00,028 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:00,029 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:00,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1153740601, now seen corresponding path program 7 times [2022-04-15 06:43:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:00,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [693437707] [2022-04-15 06:43:00,490 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:00,492 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash -417123418, now seen corresponding path program 1 times [2022-04-15 06:43:00,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:00,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205459518] [2022-04-15 06:43:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:00,505 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:43:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,517 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:43:00,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {15422#(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); {15409#true} is VALID [2022-04-15 06:43:00,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-15 06:43:00,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15409#true} {15409#true} #94#return; {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {15409#true} call ULTIMATE.init(); {15422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:00,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {15422#(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); {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15409#true} {15409#true} #94#return; {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {15409#true} call #t~ret17 := main(); {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {15409#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {15409#true} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_105| |v_main_#t~post6_104|)) (.cse1 (= v_main_~y~0_283 v_main_~y~0_282)) (.cse3 (= v_main_~x~0_278 v_main_~x~0_277)) (.cse4 (= |v_main_#t~post5_105| |v_main_#t~post5_104|)) (.cse2 (mod v_main_~x~0_278 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~y~0_283 v_main_~y~0_282) (= v_main_~x~0_277 (+ v_main_~x~0_278 v_main_~y~0_283 (* (- 1) v_main_~y~0_282))) (< 0 .cse2) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_283 v_it_22 1) v_main_~y~0_282)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_278 (* 4294967295 v_it_22)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_283, main_#t~post5=|v_main_#t~post5_105|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_105|} OutVars{main_~y~0=v_main_~y~0_282, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_104|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15409#true} is VALID [2022-04-15 06:43:00,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {15409#true} [139] 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[] {15409#true} is VALID [2022-04-15 06:43:00,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {15409#true} ~z~0 := ~y~0; {15414#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:00,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {15414#(= (+ 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; {15415#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:00,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {15415#(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; {15416#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:43:00,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#(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; {15417#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:00,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {15417#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {15418#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:43:00,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {15418#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15419#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:00,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {15419#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15420#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:00,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {15420#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15421#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {15421#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {15410#false} assume !(~y~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {15410#false} assume !(~x~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {15410#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {15410#false} assume !(~z~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {15410#false} assume !(~y~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L272 TraceCheckUtils]: 25: Hoare triple {15410#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {15410#false} ~cond := #in~cond; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#false} assume 0 == ~cond; {15410#false} is VALID [2022-04-15 06:43:00,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {15410#false} assume !false; {15410#false} is VALID [2022-04-15 06:43:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:43:00,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205459518] [2022-04-15 06:43:00,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205459518] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467957411] [2022-04-15 06:43:00,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:00,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:00,632 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:43:00,634 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:43:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:43:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:00,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:00,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {15409#true} call ULTIMATE.init(); {15409#true} is VALID [2022-04-15 06:43:00,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#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); {15409#true} is VALID [2022-04-15 06:43:00,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-15 06:43:00,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15409#true} {15409#true} #94#return; {15409#true} is VALID [2022-04-15 06:43:00,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {15409#true} call #t~ret17 := main(); {15409#true} is VALID [2022-04-15 06:43:00,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {15409#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15409#true} is VALID [2022-04-15 06:43:00,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {15409#true} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_105| |v_main_#t~post6_104|)) (.cse1 (= v_main_~y~0_283 v_main_~y~0_282)) (.cse3 (= v_main_~x~0_278 v_main_~x~0_277)) (.cse4 (= |v_main_#t~post5_105| |v_main_#t~post5_104|)) (.cse2 (mod v_main_~x~0_278 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~y~0_283 v_main_~y~0_282) (= v_main_~x~0_277 (+ v_main_~x~0_278 v_main_~y~0_283 (* (- 1) v_main_~y~0_282))) (< 0 .cse2) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_283 v_it_22 1) v_main_~y~0_282)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_278 (* 4294967295 v_it_22)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_283, main_#t~post5=|v_main_#t~post5_105|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_105|} OutVars{main_~y~0=v_main_~y~0_282, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_104|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15409#true} is VALID [2022-04-15 06:43:00,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {15409#true} [139] 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[] {15409#true} is VALID [2022-04-15 06:43:00,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {15409#true} ~z~0 := ~y~0; {15414#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:00,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {15414#(= (+ 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; {15415#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:43:00,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {15415#(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; {15416#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:43:00,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {15416#(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; {15417#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:43:00,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {15417#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {15462#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 06:43:00,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {15462#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15419#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:00,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {15419#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15420#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:00,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {15420#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15421#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:00,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {15421#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15410#false} is VALID [2022-04-15 06:43:00,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {15410#false} assume !(~y~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {15410#false} assume !(~x~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {15410#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {15410#false} assume !(~z~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 24: Hoare triple {15410#false} assume !(~y~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L272 TraceCheckUtils]: 25: Hoare triple {15410#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {15410#false} ~cond := #in~cond; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#false} assume 0 == ~cond; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {15410#false} assume !false; {15410#false} is VALID [2022-04-15 06:43:00,983 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:43:00,984 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {15410#false} assume !false; {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {15410#false} assume 0 == ~cond; {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 26: Hoare triple {15410#false} ~cond := #in~cond; {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L272 TraceCheckUtils]: 25: Hoare triple {15410#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 24: Hoare triple {15410#false} assume !(~y~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {15410#false} assume !(~z~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {15410#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {15410#false} assume !(~x~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 20: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:01,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:01,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {15410#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {15410#false} is VALID [2022-04-15 06:43:01,514 INFO L290 TraceCheckUtils]: 17: Hoare triple {15410#false} assume !(~y~0 % 4294967296 > 0); {15410#false} is VALID [2022-04-15 06:43:01,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {15421#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15410#false} is VALID [2022-04-15 06:43:01,515 INFO L290 TraceCheckUtils]: 15: Hoare triple {15420#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15421#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:43:01,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {15419#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15420#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:43:01,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {15462#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15419#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:01,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {15559#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15462#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-15 06:43:01,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {15563#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {15559#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 06:43:01,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {15567#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {15563#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:01,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {15571#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {15567#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-15 06:43:01,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {15409#true} ~z~0 := ~y~0; {15571#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:01,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {15409#true} [139] 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[] {15409#true} is VALID [2022-04-15 06:43:01,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {15409#true} [140] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_105| |v_main_#t~post6_104|)) (.cse1 (= v_main_~y~0_283 v_main_~y~0_282)) (.cse3 (= v_main_~x~0_278 v_main_~x~0_277)) (.cse4 (= |v_main_#t~post5_105| |v_main_#t~post5_104|)) (.cse2 (mod v_main_~x~0_278 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< v_main_~y~0_283 v_main_~y~0_282) (= v_main_~x~0_277 (+ v_main_~x~0_278 v_main_~y~0_283 (* (- 1) v_main_~y~0_282))) (< 0 .cse2) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~y~0_283 v_it_22 1) v_main_~y~0_282)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_278 (* 4294967295 v_it_22)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_283, main_#t~post5=|v_main_#t~post5_105|, main_~x~0=v_main_~x~0_278, main_#t~post6=|v_main_#t~post6_105|} OutVars{main_~y~0=v_main_~y~0_282, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_104|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15409#true} is VALID [2022-04-15 06:43:01,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {15409#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15409#true} is VALID [2022-04-15 06:43:01,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {15409#true} call #t~ret17 := main(); {15409#true} is VALID [2022-04-15 06:43:01,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15409#true} {15409#true} #94#return; {15409#true} is VALID [2022-04-15 06:43:01,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {15409#true} assume true; {15409#true} is VALID [2022-04-15 06:43:01,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#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); {15409#true} is VALID [2022-04-15 06:43:01,522 INFO L272 TraceCheckUtils]: 0: Hoare triple {15409#true} call ULTIMATE.init(); {15409#true} is VALID [2022-04-15 06:43:01,522 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-15 06:43:01,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467957411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:01,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:01,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-15 06:43:01,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:01,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [693437707] [2022-04-15 06:43:01,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [693437707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:01,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:01,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:43:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236665312] [2022-04-15 06:43:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:01,637 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 31 [2022-04-15 06:43:01,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:01,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:43:01,665 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:43:01,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:43:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:43:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:43:01,666 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:43:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:03,762 INFO L93 Difference]: Finished difference Result 130 states and 179 transitions. [2022-04-15 06:43:03,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:43:03,762 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 31 [2022-04-15 06:43:03,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:43:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-15 06:43:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:43:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 97 transitions. [2022-04-15 06:43:03,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 97 transitions. [2022-04-15 06:43:03,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:03,869 INFO L225 Difference]: With dead ends: 130 [2022-04-15 06:43:03,869 INFO L226 Difference]: Without dead ends: 106 [2022-04-15 06:43:03,870 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:43:03,870 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 61 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:03,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 65 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:43:03,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-15 06:43:04,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 90. [2022-04-15 06:43:04,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:04,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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:04,368 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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:04,368 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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:04,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:04,369 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-15 06:43:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-15 06:43:04,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:04,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:04,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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 106 states. [2022-04-15 06:43:04,369 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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 106 states. [2022-04-15 06:43:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:04,370 INFO L93 Difference]: Finished difference Result 106 states and 146 transitions. [2022-04-15 06:43:04,370 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 146 transitions. [2022-04-15 06:43:04,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:04,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:04,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:04,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:04,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2022-04-15 06:43:04,372 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 31 [2022-04-15 06:43:04,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:04,372 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2022-04-15 06:43:04,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:43:04,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 126 transitions. [2022-04-15 06:43:08,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 125 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:08,278 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2022-04-15 06:43:08,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 06:43:08,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:08,279 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:08,297 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:43:08,479 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,SelfDestructingSolverStorable25 [2022-04-15 06:43:08,479 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:08,480 INFO L85 PathProgramCache]: Analyzing trace with hash -698470425, now seen corresponding path program 5 times [2022-04-15 06:43:08,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:08,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1940034848] [2022-04-15 06:43:08,661 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:08,665 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:08,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1548436858, now seen corresponding path program 1 times [2022-04-15 06:43:08,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:08,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707727840] [2022-04-15 06:43:08,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:08,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:08,675 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:43:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:08,686 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:43:08,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:08,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:08,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {16311#(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); {16300#true} is VALID [2022-04-15 06:43:08,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 06:43:08,751 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16300#true} {16300#true} #94#return; {16300#true} is VALID [2022-04-15 06:43:08,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:08,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {16311#(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); {16300#true} is VALID [2022-04-15 06:43:08,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 06:43:08,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #94#return; {16300#true} is VALID [2022-04-15 06:43:08,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-15 06:43:08,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16300#true} is VALID [2022-04-15 06:43:08,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {16300#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse2 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse1 (mod v_main_~x~0_294 4294967296))) (or (and .cse0 (= |v_main_#t~post6_109| |v_main_#t~post6_110|) (<= .cse1 0) (= |v_main_#t~post5_109| |v_main_#t~post5_110|) .cse2) (and .cse0 (= |v_main_#t~post6_110| |v_main_#t~post6_109|) .cse2 (= |v_main_#t~post5_110| |v_main_#t~post5_109|)) (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_294 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_293 v_it_23 1) v_main_~x~0_294)))) (< v_main_~x~0_293 v_main_~x~0_294) (= v_main_~y~0_302 (+ v_main_~x~0_294 v_main_~y~0_303 (* v_main_~x~0_293 (- 1)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_110|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_110|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_109|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16300#true} is VALID [2022-04-15 06:43:08,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {16300#true} [141] 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[] {16305#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:08,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {16305#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {16305#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:08,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {16305#(<= 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; {16306#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:08,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {16306#(<= 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; {16307#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {16307#(<= 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; {16308#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {16308#(<= 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; {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:08,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {16309#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16310#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {16310#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {16301#false} assume !(~z~0 % 4294967296 > 0); {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {16301#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {16301#false} assume !(~y~0 % 4294967296 > 0); {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L272 TraceCheckUtils]: 25: Hoare triple {16301#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 06:43:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:43:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707727840] [2022-04-15 06:43:08,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707727840] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179241799] [2022-04-15 06:43:08,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:08,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:08,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:08,762 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:43:08,763 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:43:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:08,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:43:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:08,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:09,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-15 06:43:09,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#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); {16300#true} is VALID [2022-04-15 06:43:09,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 06:43:09,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #94#return; {16300#true} is VALID [2022-04-15 06:43:09,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-15 06:43:09,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16300#true} is VALID [2022-04-15 06:43:09,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {16300#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse2 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse1 (mod v_main_~x~0_294 4294967296))) (or (and .cse0 (= |v_main_#t~post6_109| |v_main_#t~post6_110|) (<= .cse1 0) (= |v_main_#t~post5_109| |v_main_#t~post5_110|) .cse2) (and .cse0 (= |v_main_#t~post6_110| |v_main_#t~post6_109|) .cse2 (= |v_main_#t~post5_110| |v_main_#t~post5_109|)) (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_294 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_293 v_it_23 1) v_main_~x~0_294)))) (< v_main_~x~0_293 v_main_~x~0_294) (= v_main_~y~0_302 (+ v_main_~x~0_294 v_main_~y~0_303 (* v_main_~x~0_293 (- 1)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_110|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_110|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_109|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16300#true} is VALID [2022-04-15 06:43:09,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {16300#true} [141] 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[] {16300#true} is VALID [2022-04-15 06:43:09,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {16300#true} ~z~0 := ~y~0; {16339#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:09,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {16339#(= 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; {16343#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:09,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {16343#(= 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; {16347#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:43:09,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {16347#(= (+ main_~z~0 1) (+ (- 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; {16351#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:43:09,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {16351#(= (+ (- 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; {16355#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:43:09,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {16355#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {16359#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:43:09,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {16359#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16363#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:09,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {16363#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16367#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:43:09,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {16367#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16371#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:09,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {16371#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:43:09,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:43:09,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16301#false} is VALID [2022-04-15 06:43:09,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {16301#false} assume !(~y~0 % 4294967296 > 0); {16301#false} is VALID [2022-04-15 06:43:09,040 INFO L272 TraceCheckUtils]: 25: Hoare triple {16301#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16301#false} is VALID [2022-04-15 06:43:09,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 06:43:09,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 06:43:09,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 06:43:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:09,040 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:09,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {16301#false} assume !false; {16301#false} is VALID [2022-04-15 06:43:09,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {16301#false} assume 0 == ~cond; {16301#false} is VALID [2022-04-15 06:43:09,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {16301#false} ~cond := #in~cond; {16301#false} is VALID [2022-04-15 06:43:09,274 INFO L272 TraceCheckUtils]: 25: Hoare triple {16301#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {16301#false} is VALID [2022-04-15 06:43:09,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {16301#false} assume !(~y~0 % 4294967296 > 0); {16301#false} is VALID [2022-04-15 06:43:09,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {16301#false} is VALID [2022-04-15 06:43:09,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:43:09,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {16375#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16379#(not (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:43:09,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {16371#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16375#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:09,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {16367#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16371#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:09,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {16363#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16367#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:43:09,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {16359#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16363#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:43:09,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {16455#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {16359#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:43:09,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {16459#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 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; {16455#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:09,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {16463#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 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; {16459#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:09,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {16467#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 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; {16463#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:09,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {16471#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 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; {16467#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:09,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {16300#true} ~z~0 := ~y~0; {16471#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:43:09,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {16300#true} [141] 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[] {16300#true} is VALID [2022-04-15 06:43:09,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {16300#true} [142] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_303 v_main_~y~0_302)) (.cse2 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse1 (mod v_main_~x~0_294 4294967296))) (or (and .cse0 (= |v_main_#t~post6_109| |v_main_#t~post6_110|) (<= .cse1 0) (= |v_main_#t~post5_109| |v_main_#t~post5_110|) .cse2) (and .cse0 (= |v_main_#t~post6_110| |v_main_#t~post6_109|) .cse2 (= |v_main_#t~post5_110| |v_main_#t~post5_109|)) (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_294 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_293 v_it_23 1) v_main_~x~0_294)))) (< v_main_~x~0_293 v_main_~x~0_294) (= v_main_~y~0_302 (+ v_main_~x~0_294 v_main_~y~0_303 (* v_main_~x~0_293 (- 1)))) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_303, main_#t~post5=|v_main_#t~post5_110|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_110|} OutVars{main_~y~0=v_main_~y~0_302, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_109|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16300#true} is VALID [2022-04-15 06:43:09,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {16300#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16300#true} is VALID [2022-04-15 06:43:09,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {16300#true} call #t~ret17 := main(); {16300#true} is VALID [2022-04-15 06:43:09,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16300#true} {16300#true} #94#return; {16300#true} is VALID [2022-04-15 06:43:09,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {16300#true} assume true; {16300#true} is VALID [2022-04-15 06:43:09,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {16300#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); {16300#true} is VALID [2022-04-15 06:43:09,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {16300#true} call ULTIMATE.init(); {16300#true} is VALID [2022-04-15 06:43:09,284 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:43:09,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179241799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:09,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:09,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 25 [2022-04-15 06:43:09,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:09,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1940034848] [2022-04-15 06:43:09,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1940034848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:09,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:09,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:43:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14421076] [2022-04-15 06:43:09,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 31 [2022-04-15 06:43:09,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:09,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:43:09,452 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:43:09,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:43:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:43:09,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:43:09,453 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:43:12,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:12,200 INFO L93 Difference]: Finished difference Result 272 states and 403 transitions. [2022-04-15 06:43:12,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:43:12,200 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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 31 [2022-04-15 06:43:12,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:12,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:43:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2022-04-15 06:43:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:43:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 138 transitions. [2022-04-15 06:43:12,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 138 transitions. [2022-04-15 06:43:12,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:12,355 INFO L225 Difference]: With dead ends: 272 [2022-04-15 06:43:12,356 INFO L226 Difference]: Without dead ends: 233 [2022-04-15 06:43:12,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=1365, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:43:12,356 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 151 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:12,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 49 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:43:12,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-15 06:43:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 109. [2022-04-15 06:43:12,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:12,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 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:12,938 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 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:12,938 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 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:12,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:12,941 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2022-04-15 06:43:12,941 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-04-15 06:43:12,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:12,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:12,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 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 233 states. [2022-04-15 06:43:12,942 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 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 233 states. [2022-04-15 06:43:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:12,944 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2022-04-15 06:43:12,944 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-04-15 06:43:12,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:12,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:12,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:12,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.4038461538461537) internal successors, (146), 104 states have internal predecessors, (146), 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:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 150 transitions. [2022-04-15 06:43:12,946 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 150 transitions. Word has length 31 [2022-04-15 06:43:12,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:12,946 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 150 transitions. [2022-04-15 06:43:12,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:43:12,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 150 transitions. [2022-04-15 06:43:18,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 148 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:18,719 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2022-04-15 06:43:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:43:18,719 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:18,719 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:18,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 06:43:18,920 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,SelfDestructingSolverStorable26 [2022-04-15 06:43:18,920 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:18,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash -106095820, now seen corresponding path program 8 times [2022-04-15 06:43:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:18,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1040796021] [2022-04-15 06:43:21,140 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:21,141 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1670263989, now seen corresponding path program 1 times [2022-04-15 06:43:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:21,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111367055] [2022-04-15 06:43:21,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:21,159 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:43:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,173 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:43:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {17768#(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); {17756#true} is VALID [2022-04-15 06:43:21,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-15 06:43:21,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17756#true} {17756#true} #94#return; {17756#true} is VALID [2022-04-15 06:43:21,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {17756#true} call ULTIMATE.init(); {17768#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:21,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {17768#(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); {17756#true} is VALID [2022-04-15 06:43:21,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-15 06:43:21,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17756#true} {17756#true} #94#return; {17756#true} is VALID [2022-04-15 06:43:21,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {17756#true} call #t~ret17 := main(); {17756#true} is VALID [2022-04-15 06:43:21,278 INFO L290 TraceCheckUtils]: 5: Hoare triple {17756#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17756#true} is VALID [2022-04-15 06:43:21,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {17756#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse2 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse3 (= v_main_~x~0_309 v_main_~x~0_308)) (.cse4 (mod v_main_~x~0_309 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~y~0_325 v_main_~y~0_324) (= v_main_~x~0_308 (+ v_main_~x~0_309 v_main_~y~0_325 (* (- 1) v_main_~y~0_324))) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)) (not (<= (+ v_main_~y~0_325 v_it_24 1) v_main_~y~0_324))))))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17756#true} is VALID [2022-04-15 06:43:21,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {17756#true} [143] 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[] {17756#true} is VALID [2022-04-15 06:43:21,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {17756#true} ~z~0 := ~y~0; {17761#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:21,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {17761#(= (+ 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; {17762#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:43:21,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {17762#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~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; {17763#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:43:21,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {17763#(and (<= (+ main_~z~0 2) main_~y~0) (<= main_~y~0 (+ 4294967295 (* (div main_~z~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; {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17765#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {17765#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17766#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-15 06:43:21,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {17766#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17767#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {17767#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17767#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {17767#(<= main_~y~0 (+ 4294967292 (* (div main_~y~0 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17766#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} is VALID [2022-04-15 06:43:21,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {17766#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17765#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {17765#(<= main_~y~0 (+ 4294967294 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:21,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {17764#(<= main_~y~0 (+ 4294967295 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17757#false} is VALID [2022-04-15 06:43:21,290 INFO L272 TraceCheckUtils]: 26: Hoare triple {17757#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17757#false} is VALID [2022-04-15 06:43:21,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {17757#false} ~cond := #in~cond; {17757#false} is VALID [2022-04-15 06:43:21,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {17757#false} assume 0 == ~cond; {17757#false} is VALID [2022-04-15 06:43:21,291 INFO L290 TraceCheckUtils]: 29: Hoare triple {17757#false} assume !false; {17757#false} is VALID [2022-04-15 06:43:21,291 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:43:21,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111367055] [2022-04-15 06:43:21,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111367055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187304031] [2022-04-15 06:43:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:21,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:21,295 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:43:21,296 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:43:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:43:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:21,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:21,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {17756#true} call ULTIMATE.init(); {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {17756#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); {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17756#true} {17756#true} #94#return; {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {17756#true} call #t~ret17 := main(); {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {17756#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {17756#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse2 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse3 (= v_main_~x~0_309 v_main_~x~0_308)) (.cse4 (mod v_main_~x~0_309 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~y~0_325 v_main_~y~0_324) (= v_main_~x~0_308 (+ v_main_~x~0_309 v_main_~y~0_325 (* (- 1) v_main_~y~0_324))) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)) (not (<= (+ v_main_~y~0_325 v_it_24 1) v_main_~y~0_324))))))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17756#true} is VALID [2022-04-15 06:43:21,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {17756#true} [143] 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[] {17756#true} is VALID [2022-04-15 06:43:21,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {17756#true} ~z~0 := ~y~0; {17761#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:21,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {17761#(= (+ 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; {17799#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:21,503 INFO L290 TraceCheckUtils]: 10: Hoare triple {17799#(= 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; {17803#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:43:21,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {17803#(= 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; {17807#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:43:21,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {17807#(= main_~y~0 (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {17807#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:43:21,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {17807#(= main_~y~0 (+ main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17799#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:21,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {17799#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17817#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:43:21,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {17817#(= main_~z~0 (+ main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17821#(= main_~z~0 (+ main_~y~0 3))} is VALID [2022-04-15 06:43:21,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {17821#(= main_~z~0 (+ main_~y~0 3))} assume !(~y~0 % 4294967296 > 0); {17821#(= main_~z~0 (+ main_~y~0 3))} is VALID [2022-04-15 06:43:21,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {17821#(= main_~z~0 (+ main_~y~0 3))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17828#(= (+ main_~y~0 2) main_~z~0)} is VALID [2022-04-15 06:43:21,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {17828#(= (+ main_~y~0 2) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17817#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:43:21,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {17817#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17761#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:21,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {17761#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~x~0 % 4294967296 > 0); {17761#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:43:21,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {17761#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17757#false} is VALID [2022-04-15 06:43:21,516 INFO L272 TraceCheckUtils]: 26: Hoare triple {17757#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17757#false} is VALID [2022-04-15 06:43:21,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {17757#false} ~cond := #in~cond; {17757#false} is VALID [2022-04-15 06:43:21,516 INFO L290 TraceCheckUtils]: 28: Hoare triple {17757#false} assume 0 == ~cond; {17757#false} is VALID [2022-04-15 06:43:21,516 INFO L290 TraceCheckUtils]: 29: Hoare triple {17757#false} assume !false; {17757#false} is VALID [2022-04-15 06:43:21,516 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:43:21,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:21,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {17757#false} assume !false; {17757#false} is VALID [2022-04-15 06:43:21,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {17757#false} assume 0 == ~cond; {17757#false} is VALID [2022-04-15 06:43:21,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {17757#false} ~cond := #in~cond; {17757#false} is VALID [2022-04-15 06:43:21,869 INFO L272 TraceCheckUtils]: 26: Hoare triple {17757#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {17757#false} is VALID [2022-04-15 06:43:21,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {17757#false} is VALID [2022-04-15 06:43:21,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {17841#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {17890#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:43:21,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {17890#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {17890#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {17897#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17890#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {17901#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17897#(or (< 0 (mod (+ main_~y~0 1) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:43:21,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {17905#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {17901#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 06:43:21,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {17905#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17905#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-15 06:43:21,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {17912#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17905#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-15 06:43:21,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {17916#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17912#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 06:43:21,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {17920#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17916#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:43:21,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {17920#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17920#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {17927#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod 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; {17920#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {17931#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod 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; {17927#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {17890#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod 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; {17931#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {17756#true} ~z~0 := ~y~0; {17890#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:21,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {17756#true} [143] 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[] {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {17756#true} [144] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_325 v_main_~y~0_324)) (.cse1 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse2 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse3 (= v_main_~x~0_309 v_main_~x~0_308)) (.cse4 (mod v_main_~x~0_309 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~y~0_325 v_main_~y~0_324) (= v_main_~x~0_308 (+ v_main_~x~0_309 v_main_~y~0_325 (* (- 1) v_main_~y~0_324))) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_309 (* 4294967295 v_it_24)) 4294967296)) (not (<= 1 v_it_24)) (not (<= (+ v_main_~y~0_325 v_it_24 1) v_main_~y~0_324))))))) InVars {main_~y~0=v_main_~y~0_325, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_309, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_308, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {17756#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {17756#true} call #t~ret17 := main(); {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17756#true} {17756#true} #94#return; {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {17756#true} assume true; {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {17756#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); {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {17756#true} call ULTIMATE.init(); {17756#true} is VALID [2022-04-15 06:43:21,884 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:43:21,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187304031] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:21,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:21,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 26 [2022-04-15 06:43:22,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:22,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1040796021] [2022-04-15 06:43:22,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1040796021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:22,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:22,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:43:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726482210] [2022-04-15 06:43:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:22,041 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 32 [2022-04-15 06:43:22,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:22,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:43:22,066 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:43:22,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:43:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:22,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:43:22,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:43:22,067 INFO L87 Difference]: Start difference. First operand 109 states and 150 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:43:25,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:25,078 INFO L93 Difference]: Finished difference Result 160 states and 219 transitions. [2022-04-15 06:43:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:43:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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 32 [2022-04-15 06:43:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:43:25,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 111 transitions. [2022-04-15 06:43:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:43:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 111 transitions. [2022-04-15 06:43:25,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 111 transitions. [2022-04-15 06:43:25,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:25,224 INFO L225 Difference]: With dead ends: 160 [2022-04-15 06:43:25,224 INFO L226 Difference]: Without dead ends: 155 [2022-04-15 06:43:25,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=470, Invalid=2500, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 06:43:25,225 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:25,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 67 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:43:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-15 06:43:25,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2022-04-15 06:43:25,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:25,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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:25,940 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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:25,940 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:25,942 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2022-04-15 06:43:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-04-15 06:43:25,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:25,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:25,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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 155 states. [2022-04-15 06:43:25,942 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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 155 states. [2022-04-15 06:43:25,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:25,944 INFO L93 Difference]: Finished difference Result 155 states and 209 transitions. [2022-04-15 06:43:25,944 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2022-04-15 06:43:25,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:25,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:25,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:25,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.393162393162393) internal successors, (163), 117 states have internal predecessors, (163), 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:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 167 transitions. [2022-04-15 06:43:25,945 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 167 transitions. Word has length 32 [2022-04-15 06:43:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:25,945 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 167 transitions. [2022-04-15 06:43:25,945 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 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:43:25,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 167 transitions. [2022-04-15 06:43:34,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 164 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 167 transitions. [2022-04-15 06:43:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 06:43:34,307 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:34,307 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:34,322 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:43:34,507 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,SelfDestructingSolverStorable27 [2022-04-15 06:43:34,508 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:34,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:34,508 INFO L85 PathProgramCache]: Analyzing trace with hash -392481723, now seen corresponding path program 6 times [2022-04-15 06:43:34,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:34,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [450059115] [2022-04-15 06:43:34,672 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:34,673 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash -555573754, now seen corresponding path program 1 times [2022-04-15 06:43:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:34,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023463162] [2022-04-15 06:43:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:34,692 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:43:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:34,701 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:43:34,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:34,782 INFO L290 TraceCheckUtils]: 0: Hoare triple {18908#(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); {18896#true} is VALID [2022-04-15 06:43:34,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {18896#true} assume true; {18896#true} is VALID [2022-04-15 06:43:34,782 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18896#true} {18896#true} #94#return; {18896#true} is VALID [2022-04-15 06:43:34,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {18896#true} call ULTIMATE.init(); {18908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:34,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {18908#(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); {18896#true} is VALID [2022-04-15 06:43:34,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {18896#true} assume true; {18896#true} is VALID [2022-04-15 06:43:34,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18896#true} {18896#true} #94#return; {18896#true} is VALID [2022-04-15 06:43:34,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {18896#true} call #t~ret17 := main(); {18896#true} is VALID [2022-04-15 06:43:34,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {18896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18896#true} is VALID [2022-04-15 06:43:34,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {18896#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_327 4294967296)) (.cse1 (= v_main_~x~0_327 v_main_~x~0_326))) (or (and (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse1 (= v_main_~y~0_345 v_main_~y~0_346) (= |v_main_#t~post5_119| |v_main_#t~post5_120|)) (and (= v_main_~x~0_326 (+ v_main_~x~0_327 (* (- 1) v_main_~y~0_345) v_main_~y~0_346)) (forall ((v_it_25 Int)) (or (not (<= 1 v_it_25)) (not (<= (+ v_main_~y~0_346 v_it_25 1) v_main_~y~0_345)) (< 0 (mod (+ v_main_~x~0_327 (* 4294967295 v_it_25)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_346 v_main_~y~0_345)) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) (= |v_main_#t~post6_120| |v_main_#t~post6_119|) (= v_main_~y~0_346 v_main_~y~0_345) .cse1))) InVars {main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_327, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_345, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18896#true} is VALID [2022-04-15 06:43:34,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {18896#true} [145] 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[] {18901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:34,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {18901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {18901#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:34,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {18901#(<= 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; {18902#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:34,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {18902#(<= 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; {18903#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:34,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {18903#(<= 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; {18904#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:34,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {18904#(<= 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; {18905#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:34,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {18905#(<= 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; {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:34,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {18906#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18907#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {18907#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {18897#false} assume !(~z~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {18897#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {18897#false} assume !(~y~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L272 TraceCheckUtils]: 26: Hoare triple {18897#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {18897#false} ~cond := #in~cond; {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {18897#false} assume 0 == ~cond; {18897#false} is VALID [2022-04-15 06:43:34,792 INFO L290 TraceCheckUtils]: 29: Hoare triple {18897#false} assume !false; {18897#false} is VALID [2022-04-15 06:43:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:43:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:34,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023463162] [2022-04-15 06:43:34,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023463162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:34,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717595575] [2022-04-15 06:43:34,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:34,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:34,794 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:43:34,795 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:43:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:34,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:43:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:34,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:34,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {18896#true} call ULTIMATE.init(); {18896#true} is VALID [2022-04-15 06:43:34,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {18896#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); {18896#true} is VALID [2022-04-15 06:43:34,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {18896#true} assume true; {18896#true} is VALID [2022-04-15 06:43:34,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18896#true} {18896#true} #94#return; {18896#true} is VALID [2022-04-15 06:43:34,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {18896#true} call #t~ret17 := main(); {18896#true} is VALID [2022-04-15 06:43:34,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {18896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18896#true} is VALID [2022-04-15 06:43:34,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {18896#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_327 4294967296)) (.cse1 (= v_main_~x~0_327 v_main_~x~0_326))) (or (and (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse1 (= v_main_~y~0_345 v_main_~y~0_346) (= |v_main_#t~post5_119| |v_main_#t~post5_120|)) (and (= v_main_~x~0_326 (+ v_main_~x~0_327 (* (- 1) v_main_~y~0_345) v_main_~y~0_346)) (forall ((v_it_25 Int)) (or (not (<= 1 v_it_25)) (not (<= (+ v_main_~y~0_346 v_it_25 1) v_main_~y~0_345)) (< 0 (mod (+ v_main_~x~0_327 (* 4294967295 v_it_25)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_346 v_main_~y~0_345)) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) (= |v_main_#t~post6_120| |v_main_#t~post6_119|) (= v_main_~y~0_346 v_main_~y~0_345) .cse1))) InVars {main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_327, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_345, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18896#true} is VALID [2022-04-15 06:43:34,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {18896#true} [145] 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[] {18896#true} is VALID [2022-04-15 06:43:34,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {18896#true} ~z~0 := ~y~0; {18896#true} is VALID [2022-04-15 06:43:34,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {18896#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18939#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:34,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {18939#(< 0 (mod (+ main_~z~0 1) 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; {18943#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:34,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {18943#(< 0 (mod (+ main_~z~0 2) 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; {18947#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:34,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {18947#(< 0 (mod (+ main_~z~0 3) 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; {18951#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:43:34,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {18951#(< 0 (mod (+ main_~z~0 4) 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; {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:43:34,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:43:34,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18951#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:43:34,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {18951#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18947#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:34,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {18947#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18943#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:34,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {18943#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18939#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:34,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {18939#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:34,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:34,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {18897#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {18897#false} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {18897#false} assume !(~y~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:34,998 INFO L272 TraceCheckUtils]: 26: Hoare triple {18897#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18897#false} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {18897#false} ~cond := #in~cond; {18897#false} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {18897#false} assume 0 == ~cond; {18897#false} is VALID [2022-04-15 06:43:34,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {18897#false} assume !false; {18897#false} is VALID [2022-04-15 06:43:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:43:34,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:35,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {18897#false} assume !false; {18897#false} is VALID [2022-04-15 06:43:35,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {18897#false} assume 0 == ~cond; {18897#false} is VALID [2022-04-15 06:43:35,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {18897#false} ~cond := #in~cond; {18897#false} is VALID [2022-04-15 06:43:35,087 INFO L272 TraceCheckUtils]: 26: Hoare triple {18897#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {18897#false} is VALID [2022-04-15 06:43:35,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {18897#false} assume !(~y~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:35,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {18897#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {18897#false} is VALID [2022-04-15 06:43:35,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18897#false} is VALID [2022-04-15 06:43:35,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:35,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:35,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {18974#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:35,089 INFO L290 TraceCheckUtils]: 19: Hoare triple {18939#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18974#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:35,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {18943#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18939#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:35,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {18947#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18943#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:35,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {18951#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18947#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:35,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18951#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:43:35,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:43:35,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {18951#(< 0 (mod (+ main_~z~0 4) 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; {18955#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:43:35,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {18947#(< 0 (mod (+ main_~z~0 3) 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; {18951#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:43:35,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {18943#(< 0 (mod (+ main_~z~0 2) 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; {18947#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:35,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {18939#(< 0 (mod (+ main_~z~0 1) 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; {18943#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:35,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {18896#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18939#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:35,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {18896#true} ~z~0 := ~y~0; {18896#true} is VALID [2022-04-15 06:43:35,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {18896#true} [145] 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[] {18896#true} is VALID [2022-04-15 06:43:35,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {18896#true} [146] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_327 4294967296)) (.cse1 (= v_main_~x~0_327 v_main_~x~0_326))) (or (and (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse1 (= v_main_~y~0_345 v_main_~y~0_346) (= |v_main_#t~post5_119| |v_main_#t~post5_120|)) (and (= v_main_~x~0_326 (+ v_main_~x~0_327 (* (- 1) v_main_~y~0_345) v_main_~y~0_346)) (forall ((v_it_25 Int)) (or (not (<= 1 v_it_25)) (not (<= (+ v_main_~y~0_346 v_it_25 1) v_main_~y~0_345)) (< 0 (mod (+ v_main_~x~0_327 (* 4294967295 v_it_25)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_346 v_main_~y~0_345)) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) (= |v_main_#t~post6_120| |v_main_#t~post6_119|) (= v_main_~y~0_346 v_main_~y~0_345) .cse1))) InVars {main_~y~0=v_main_~y~0_346, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_327, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_345, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_326, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18896#true} is VALID [2022-04-15 06:43:35,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {18896#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18896#true} is VALID [2022-04-15 06:43:35,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {18896#true} call #t~ret17 := main(); {18896#true} is VALID [2022-04-15 06:43:35,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18896#true} {18896#true} #94#return; {18896#true} is VALID [2022-04-15 06:43:35,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {18896#true} assume true; {18896#true} is VALID [2022-04-15 06:43:35,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {18896#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); {18896#true} is VALID [2022-04-15 06:43:35,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {18896#true} call ULTIMATE.init(); {18896#true} is VALID [2022-04-15 06:43:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:43:35,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717595575] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:35,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:35,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-15 06:43:35,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:35,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [450059115] [2022-04-15 06:43:35,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [450059115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:35,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:35,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:43:35,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194015192] [2022-04-15 06:43:35,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:35,224 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 32 [2022-04-15 06:43:35,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:35,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:43:35,244 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:43:35,244 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:43:35,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:35,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:43:35,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-04-15 06:43:35,245 INFO L87 Difference]: Start difference. First operand 122 states and 167 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:43:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:39,094 INFO L93 Difference]: Finished difference Result 357 states and 512 transitions. [2022-04-15 06:43:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 06:43:39,095 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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 32 [2022-04-15 06:43:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:39,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:43:39,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2022-04-15 06:43:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:43:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 148 transitions. [2022-04-15 06:43:39,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 148 transitions. [2022-04-15 06:43:39,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:39,268 INFO L225 Difference]: With dead ends: 357 [2022-04-15 06:43:39,268 INFO L226 Difference]: Without dead ends: 312 [2022-04-15 06:43:39,268 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=812, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:43:39,268 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 146 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:39,269 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 72 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:43:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2022-04-15 06:43:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 132. [2022-04-15 06:43:40,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:40,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 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:40,081 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 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:40,081 INFO L87 Difference]: Start difference. First operand 312 states. Second operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 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:40,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:40,085 INFO L93 Difference]: Finished difference Result 312 states and 433 transitions. [2022-04-15 06:43:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 433 transitions. [2022-04-15 06:43:40,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:40,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:40,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 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 312 states. [2022-04-15 06:43:40,086 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 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 312 states. [2022-04-15 06:43:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:40,090 INFO L93 Difference]: Finished difference Result 312 states and 433 transitions. [2022-04-15 06:43:40,090 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 433 transitions. [2022-04-15 06:43:40,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:40,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:40,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:40,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:40,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3937007874015748) internal successors, (177), 127 states have internal predecessors, (177), 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:40,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 181 transitions. [2022-04-15 06:43:40,092 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 181 transitions. Word has length 32 [2022-04-15 06:43:40,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:40,092 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 181 transitions. [2022-04-15 06:43:40,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:43:40,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 181 transitions. [2022-04-15 06:43:44,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 181 transitions. [2022-04-15 06:43:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:43:44,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:44,864 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:44,880 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:43:45,064 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:45,065 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:45,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:45,065 INFO L85 PathProgramCache]: Analyzing trace with hash 425178919, now seen corresponding path program 9 times [2022-04-15 06:43:45,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:45,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [227661543] [2022-04-15 06:43:45,267 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:45,268 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash -329171642, now seen corresponding path program 1 times [2022-04-15 06:43:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:45,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846746353] [2022-04-15 06:43:45,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:45,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:45,280 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:43:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:45,302 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:43:45,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:45,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {20739#(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); {20725#true} is VALID [2022-04-15 06:43:45,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {20725#true} assume true; {20725#true} is VALID [2022-04-15 06:43:45,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20725#true} {20725#true} #94#return; {20725#true} is VALID [2022-04-15 06:43:45,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {20725#true} call ULTIMATE.init(); {20739#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:45,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {20739#(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); {20725#true} is VALID [2022-04-15 06:43:45,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {20725#true} assume true; {20725#true} is VALID [2022-04-15 06:43:45,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20725#true} {20725#true} #94#return; {20725#true} is VALID [2022-04-15 06:43:45,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {20725#true} call #t~ret17 := main(); {20725#true} is VALID [2022-04-15 06:43:45,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {20725#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20725#true} is VALID [2022-04-15 06:43:45,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {20725#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~y~0_362 v_main_~y~0_361)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|)) (.cse3 (= v_main_~x~0_343 v_main_~x~0_342)) (.cse4 (mod v_main_~x~0_343 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_361 (+ v_main_~x~0_343 (* v_main_~x~0_342 (- 1)) v_main_~y~0_362)) (< 0 .cse4) (< v_main_~x~0_342 v_main_~x~0_343) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_342 v_it_26 1) v_main_~x~0_343)) (< 0 (mod (+ v_main_~x~0_343 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26))))))) InVars {main_~y~0=v_main_~y~0_362, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_343, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_361, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20725#true} is VALID [2022-04-15 06:43:45,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {20725#true} [147] 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[] {20725#true} is VALID [2022-04-15 06:43:45,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {20725#true} ~z~0 := ~y~0; {20725#true} is VALID [2022-04-15 06:43:45,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {20725#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {20731#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:43:45,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {20731#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 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; {20732#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {20732#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {20733#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {20733#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20733#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {20733#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20734#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {20734#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20735#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-15 06:43:45,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {20735#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20736#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {20736#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~y~0 % 4294967296 > 0); {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,421 INFO L290 TraceCheckUtils]: 19: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~x~0 % 4294967296 > 0); {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-15 06:43:45,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {20737#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20738#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:43:45,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {20738#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {20726#false} is VALID [2022-04-15 06:43:45,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {20726#false} assume !(~y~0 % 4294967296 > 0); {20726#false} is VALID [2022-04-15 06:43:45,424 INFO L272 TraceCheckUtils]: 27: Hoare triple {20726#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20726#false} is VALID [2022-04-15 06:43:45,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {20726#false} ~cond := #in~cond; {20726#false} is VALID [2022-04-15 06:43:45,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {20726#false} assume 0 == ~cond; {20726#false} is VALID [2022-04-15 06:43:45,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {20726#false} assume !false; {20726#false} is VALID [2022-04-15 06:43:45,424 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:43:45,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:45,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846746353] [2022-04-15 06:43:45,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846746353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:45,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061652642] [2022-04-15 06:43:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:45,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:45,426 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:43:45,427 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:43:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:45,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:43:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:45,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:45,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {20725#true} call ULTIMATE.init(); {20725#true} is VALID [2022-04-15 06:43:45,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {20725#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); {20725#true} is VALID [2022-04-15 06:43:45,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {20725#true} assume true; {20725#true} is VALID [2022-04-15 06:43:45,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20725#true} {20725#true} #94#return; {20725#true} is VALID [2022-04-15 06:43:45,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {20725#true} call #t~ret17 := main(); {20725#true} is VALID [2022-04-15 06:43:45,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {20725#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20725#true} is VALID [2022-04-15 06:43:45,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {20725#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~y~0_362 v_main_~y~0_361)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|)) (.cse3 (= v_main_~x~0_343 v_main_~x~0_342)) (.cse4 (mod v_main_~x~0_343 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_361 (+ v_main_~x~0_343 (* v_main_~x~0_342 (- 1)) v_main_~y~0_362)) (< 0 .cse4) (< v_main_~x~0_342 v_main_~x~0_343) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_342 v_it_26 1) v_main_~x~0_343)) (< 0 (mod (+ v_main_~x~0_343 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26))))))) InVars {main_~y~0=v_main_~y~0_362, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_343, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_361, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20725#true} is VALID [2022-04-15 06:43:45,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {20725#true} [147] 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[] {20725#true} is VALID [2022-04-15 06:43:45,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {20725#true} ~z~0 := ~y~0; {20767#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:45,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {20767#(= 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; {20771#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:45,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {20771#(= 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; {20775#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 06:43:45,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {20775#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {20779#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:45,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {20779#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~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; {20783#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-15 06:43:45,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {20783#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {20783#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-15 06:43:45,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {20783#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20790#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 3) (+ main_~y~0 1)))} is VALID [2022-04-15 06:43:45,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {20790#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 3) (+ main_~y~0 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,830 INFO L290 TraceCheckUtils]: 19: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20726#false} is VALID [2022-04-15 06:43:45,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {20726#false} assume !(~y~0 % 4294967296 > 0); {20726#false} is VALID [2022-04-15 06:43:45,845 INFO L272 TraceCheckUtils]: 27: Hoare triple {20726#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20726#false} is VALID [2022-04-15 06:43:45,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {20726#false} ~cond := #in~cond; {20726#false} is VALID [2022-04-15 06:43:45,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {20726#false} assume 0 == ~cond; {20726#false} is VALID [2022-04-15 06:43:45,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {20726#false} assume !false; {20726#false} is VALID [2022-04-15 06:43:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:43:45,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:45,989 INFO L290 TraceCheckUtils]: 30: Hoare triple {20726#false} assume !false; {20726#false} is VALID [2022-04-15 06:43:45,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {20726#false} assume 0 == ~cond; {20726#false} is VALID [2022-04-15 06:43:45,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {20726#false} ~cond := #in~cond; {20726#false} is VALID [2022-04-15 06:43:45,989 INFO L272 TraceCheckUtils]: 27: Hoare triple {20726#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {20726#false} is VALID [2022-04-15 06:43:45,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {20726#false} assume !(~y~0 % 4294967296 > 0); {20726#false} is VALID [2022-04-15 06:43:45,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20726#false} is VALID [2022-04-15 06:43:45,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20801#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-15 06:43:45,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20797#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:43:45,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {20886#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {20890#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20886#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:43:45,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {20890#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20890#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {20886#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 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; {20890#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:45,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {20886#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:43:45,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {20725#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20730#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {20725#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {20725#true} ~z~0 := ~y~0; {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {20725#true} [147] 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[] {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {20725#true} [148] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse1 (= v_main_~y~0_362 v_main_~y~0_361)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|)) (.cse3 (= v_main_~x~0_343 v_main_~x~0_342)) (.cse4 (mod v_main_~x~0_343 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_361 (+ v_main_~x~0_343 (* v_main_~x~0_342 (- 1)) v_main_~y~0_362)) (< 0 .cse4) (< v_main_~x~0_342 v_main_~x~0_343) (forall ((v_it_26 Int)) (or (not (<= (+ v_main_~x~0_342 v_it_26 1) v_main_~x~0_343)) (< 0 (mod (+ v_main_~x~0_343 (* 4294967295 v_it_26)) 4294967296)) (not (<= 1 v_it_26))))))) InVars {main_~y~0=v_main_~y~0_362, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_343, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_361, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {20725#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {20725#true} call #t~ret17 := main(); {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20725#true} {20725#true} #94#return; {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {20725#true} assume true; {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {20725#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); {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {20725#true} call ULTIMATE.init(); {20725#true} is VALID [2022-04-15 06:43:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 06:43:46,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061652642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:46,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:46,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 7] total 22 [2022-04-15 06:43:46,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:46,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [227661543] [2022-04-15 06:43:46,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [227661543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:46,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:46,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:43:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711084973] [2022-04-15 06:43:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:46,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 33 [2022-04-15 06:43:46,099 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:46,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:43:46,127 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:43:46,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:43:46,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:46,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:43:46,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:43:46,130 INFO L87 Difference]: Start difference. First operand 132 states and 181 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:43:48,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:48,814 INFO L93 Difference]: Finished difference Result 200 states and 276 transitions. [2022-04-15 06:43:48,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:43:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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 33 [2022-04-15 06:43:48,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:43:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:43:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 91 transitions. [2022-04-15 06:43:48,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:43:48,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 91 transitions. [2022-04-15 06:43:48,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 91 transitions. [2022-04-15 06:43:48,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:48,925 INFO L225 Difference]: With dead ends: 200 [2022-04-15 06:43:48,925 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 06:43:48,926 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=353, Invalid=1903, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 06:43:48,927 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 72 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:43:48,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 53 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:43:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 06:43:49,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 135. [2022-04-15 06:43:49,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:43:49,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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:49,859 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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:49,859 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:49,861 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2022-04-15 06:43:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2022-04-15 06:43:49,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:49,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:49,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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 186 states. [2022-04-15 06:43:49,862 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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 186 states. [2022-04-15 06:43:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:43:49,864 INFO L93 Difference]: Finished difference Result 186 states and 247 transitions. [2022-04-15 06:43:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 247 transitions. [2022-04-15 06:43:49,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:43:49,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:43:49,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:43:49,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:43:49,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 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:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 184 transitions. [2022-04-15 06:43:49,866 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 184 transitions. Word has length 33 [2022-04-15 06:43:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:43:49,866 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 184 transitions. [2022-04-15 06:43:49,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 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:43:49,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 184 transitions. [2022-04-15 06:43:55,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 183 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:43:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 184 transitions. [2022-04-15 06:43:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:43:55,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:43:55,748 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:43:55,764 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:55,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:55,948 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:43:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:43:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 503233447, now seen corresponding path program 7 times [2022-04-15 06:43:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:55,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [312885907] [2022-04-15 06:43:56,140 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:56,141 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:43:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash -244582010, now seen corresponding path program 1 times [2022-04-15 06:43:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:43:56,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011146155] [2022-04-15 06:43:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:43:56,152 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:43:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:56,165 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:43:56,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:43:56,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:56,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {22040#(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); {22027#true} is VALID [2022-04-15 06:43:56,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {22027#true} assume true; {22027#true} is VALID [2022-04-15 06:43:56,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22027#true} {22027#true} #94#return; {22027#true} is VALID [2022-04-15 06:43:56,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {22027#true} call ULTIMATE.init(); {22040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:43:56,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {22040#(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); {22027#true} is VALID [2022-04-15 06:43:56,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {22027#true} assume true; {22027#true} is VALID [2022-04-15 06:43:56,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22027#true} {22027#true} #94#return; {22027#true} is VALID [2022-04-15 06:43:56,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {22027#true} call #t~ret17 := main(); {22027#true} is VALID [2022-04-15 06:43:56,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {22027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22027#true} is VALID [2022-04-15 06:43:56,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {22027#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_381 v_main_~y~0_380)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse0 (mod v_main_~x~0_360 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (= v_main_~y~0_380 (+ v_main_~x~0_360 v_main_~y~0_381 (* v_main_~x~0_359 (- 1)))) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_360 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_359 v_it_27 1) v_main_~x~0_360)))) (< 0 .cse0) (< v_main_~x~0_359 v_main_~x~0_360)) (and .cse1 .cse2 (= v_main_~x~0_360 v_main_~x~0_359) .cse3) (and (= v_main_~x~0_359 v_main_~x~0_360) .cse1 .cse2 (<= .cse0 0) .cse3))) InVars {main_~y~0=v_main_~y~0_381, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_360, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_380, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_359, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22027#true} is VALID [2022-04-15 06:43:56,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {22027#true} [149] 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[] {22032#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:56,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {22032#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {22032#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:43:56,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {22032#(<= 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; {22033#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:43:56,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {22033#(<= 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; {22034#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {22034#(<= 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; {22035#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {22035#(<= 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; {22036#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {22036#(<= 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; {22037#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:43:56,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {22037#(<= 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; {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:43:56,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {22038#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22039#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {22039#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {22028#false} assume !(~z~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 25: Hoare triple {22028#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 26: Hoare triple {22028#false} assume !(~y~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L272 TraceCheckUtils]: 27: Hoare triple {22028#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {22028#false} ~cond := #in~cond; {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {22028#false} assume 0 == ~cond; {22028#false} is VALID [2022-04-15 06:43:56,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {22028#false} assume !false; {22028#false} is VALID [2022-04-15 06:43:56,275 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:43:56,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:43:56,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011146155] [2022-04-15 06:43:56,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011146155] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:43:56,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872913043] [2022-04-15 06:43:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:43:56,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:43:56,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:43:56,276 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:56,277 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:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:56,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:43:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:43:56,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:43:56,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {22027#true} call ULTIMATE.init(); {22027#true} is VALID [2022-04-15 06:43:56,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {22027#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); {22027#true} is VALID [2022-04-15 06:43:56,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {22027#true} assume true; {22027#true} is VALID [2022-04-15 06:43:56,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22027#true} {22027#true} #94#return; {22027#true} is VALID [2022-04-15 06:43:56,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {22027#true} call #t~ret17 := main(); {22027#true} is VALID [2022-04-15 06:43:56,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {22027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22027#true} is VALID [2022-04-15 06:43:56,648 INFO L290 TraceCheckUtils]: 6: Hoare triple {22027#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_381 v_main_~y~0_380)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse0 (mod v_main_~x~0_360 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (= v_main_~y~0_380 (+ v_main_~x~0_360 v_main_~y~0_381 (* v_main_~x~0_359 (- 1)))) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_360 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_359 v_it_27 1) v_main_~x~0_360)))) (< 0 .cse0) (< v_main_~x~0_359 v_main_~x~0_360)) (and .cse1 .cse2 (= v_main_~x~0_360 v_main_~x~0_359) .cse3) (and (= v_main_~x~0_359 v_main_~x~0_360) .cse1 .cse2 (<= .cse0 0) .cse3))) InVars {main_~y~0=v_main_~y~0_381, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_360, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_380, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_359, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22027#true} is VALID [2022-04-15 06:43:56,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {22027#true} [149] 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[] {22027#true} is VALID [2022-04-15 06:43:56,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {22027#true} ~z~0 := ~y~0; {22068#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:43:56,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {22068#(= 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; {22072#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:43:56,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {22072#(= 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; {22076#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-15 06:43:56,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {22076#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {22080#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:56,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {22080#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~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; {22084#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-15 06:43:56,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {22084#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ (- 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; {22088#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:56,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {22088#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~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; {22092#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:56,653 INFO L290 TraceCheckUtils]: 15: Hoare triple {22092#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22092#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:43:56,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {22092#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22099#(and (= (+ main_~y~0 (- 4)) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:43:56,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {22099#(and (= (+ main_~y~0 (- 4)) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22103#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:56,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {22103#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22107#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:56,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {22107#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22111#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:56,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {22111#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {22028#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22028#false} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 26: Hoare triple {22028#false} assume !(~y~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,658 INFO L272 TraceCheckUtils]: 27: Hoare triple {22028#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22028#false} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {22028#false} ~cond := #in~cond; {22028#false} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 29: Hoare triple {22028#false} assume 0 == ~cond; {22028#false} is VALID [2022-04-15 06:43:56,658 INFO L290 TraceCheckUtils]: 30: Hoare triple {22028#false} assume !false; {22028#false} is VALID [2022-04-15 06:43:56,659 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:43:56,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:43:56,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {22028#false} assume !false; {22028#false} is VALID [2022-04-15 06:43:56,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {22028#false} assume 0 == ~cond; {22028#false} is VALID [2022-04-15 06:43:56,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {22028#false} ~cond := #in~cond; {22028#false} is VALID [2022-04-15 06:43:56,789 INFO L272 TraceCheckUtils]: 27: Hoare triple {22028#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {22028#false} is VALID [2022-04-15 06:43:56,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {22028#false} assume !(~y~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {22028#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {22028#false} is VALID [2022-04-15 06:43:56,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {22028#false} is VALID [2022-04-15 06:43:56,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {22115#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {22111#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22115#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:43:56,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {22107#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22111#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:56,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {22103#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22107#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:56,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {22185#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22103#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:56,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {22189#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22185#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:43:56,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {22189#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22189#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:43:56,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {22185#(< 0 (mod (+ main_~z~0 4) 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; {22189#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:43:56,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {22103#(< 0 (mod (+ main_~z~0 3) 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; {22185#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:43:56,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {22107#(< 0 (mod (+ main_~z~0 2) 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; {22103#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:43:56,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {22111#(< 0 (mod (+ main_~z~0 1) 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; {22107#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:43:56,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {22027#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22111#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:43:56,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {22027#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22027#true} is VALID [2022-04-15 06:43:56,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {22027#true} ~z~0 := ~y~0; {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {22027#true} [149] 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[] {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {22027#true} [150] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_381 v_main_~y~0_380)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse0 (mod v_main_~x~0_360 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (= v_main_~y~0_380 (+ v_main_~x~0_360 v_main_~y~0_381 (* v_main_~x~0_359 (- 1)))) (forall ((v_it_27 Int)) (or (< 0 (mod (+ v_main_~x~0_360 (* 4294967295 v_it_27)) 4294967296)) (not (<= 1 v_it_27)) (not (<= (+ v_main_~x~0_359 v_it_27 1) v_main_~x~0_360)))) (< 0 .cse0) (< v_main_~x~0_359 v_main_~x~0_360)) (and .cse1 .cse2 (= v_main_~x~0_360 v_main_~x~0_359) .cse3) (and (= v_main_~x~0_359 v_main_~x~0_360) .cse1 .cse2 (<= .cse0 0) .cse3))) InVars {main_~y~0=v_main_~y~0_381, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_360, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_380, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_359, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {22027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {22027#true} call #t~ret17 := main(); {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22027#true} {22027#true} #94#return; {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {22027#true} assume true; {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {22027#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); {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {22027#true} call ULTIMATE.init(); {22027#true} is VALID [2022-04-15 06:43:56,798 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:43:56,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872913043] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:43:56,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:43:56,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 8] total 25 [2022-04-15 06:43:56,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:43:56,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [312885907] [2022-04-15 06:43:56,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [312885907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:43:56,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:43:56,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:43:56,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064378970] [2022-04-15 06:43:56,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:43:56,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 33 [2022-04-15 06:43:56,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:43:56,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:43:56,946 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:43:56,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:43:56,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:43:56,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:43:56,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2022-04-15 06:43:56,947 INFO L87 Difference]: Start difference. First operand 135 states and 184 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:02,115 INFO L93 Difference]: Finished difference Result 402 states and 570 transitions. [2022-04-15 06:44:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 06:44:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 33 [2022-04-15 06:44:02,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:02,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-04-15 06:44:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 159 transitions. [2022-04-15 06:44:02,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 159 transitions. [2022-04-15 06:44:02,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:02,302 INFO L225 Difference]: With dead ends: 402 [2022-04-15 06:44:02,302 INFO L226 Difference]: Without dead ends: 354 [2022-04-15 06:44:02,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=217, Invalid=1505, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:44:02,303 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 187 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:02,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 63 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:44:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-15 06:44:03,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 145. [2022-04-15 06:44:03,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:03,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 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:03,398 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 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:03,398 INFO L87 Difference]: Start difference. First operand 354 states. Second operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 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:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:03,403 INFO L93 Difference]: Finished difference Result 354 states and 485 transitions. [2022-04-15 06:44:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2022-04-15 06:44:03,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:03,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:03,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 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 354 states. [2022-04-15 06:44:03,403 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 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 354 states. [2022-04-15 06:44:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:03,408 INFO L93 Difference]: Finished difference Result 354 states and 485 transitions. [2022-04-15 06:44:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 485 transitions. [2022-04-15 06:44:03,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:03,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:03,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:03,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 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:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 198 transitions. [2022-04-15 06:44:03,410 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 198 transitions. Word has length 33 [2022-04-15 06:44:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:03,410 INFO L478 AbstractCegarLoop]: Abstraction has 145 states and 198 transitions. [2022-04-15 06:44:03,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:03,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 198 transitions. [2022-04-15 06:44:09,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 197 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:09,631 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 198 transitions. [2022-04-15 06:44:09,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:44:09,632 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:09,632 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:09,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 06:44:09,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-15 06:44:09,836 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:09,836 INFO L85 PathProgramCache]: Analyzing trace with hash -893507562, now seen corresponding path program 10 times [2022-04-15 06:44:09,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:09,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [423649520] [2022-04-15 06:44:10,034 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:10,036 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1896605271, now seen corresponding path program 1 times [2022-04-15 06:44:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305018109] [2022-04-15 06:44:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:10,047 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:44:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:10,070 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:44:10,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:10,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {24086#(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); {24073#true} is VALID [2022-04-15 06:44:10,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {24073#true} assume true; {24073#true} is VALID [2022-04-15 06:44:10,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24073#true} {24073#true} #94#return; {24073#true} is VALID [2022-04-15 06:44:10,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {24073#true} call ULTIMATE.init(); {24086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:10,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {24086#(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); {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {24073#true} assume true; {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24073#true} {24073#true} #94#return; {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {24073#true} call #t~ret17 := main(); {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {24073#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {24073#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse1 (= v_main_~y~0_399 v_main_~y~0_398)) (.cse2 (= v_main_~x~0_376 v_main_~x~0_375)) (.cse3 (= |v_main_#t~post6_135| |v_main_#t~post6_134|)) (.cse4 (mod v_main_~x~0_376 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_375 v_main_~x~0_376) (= v_main_~y~0_398 (+ v_main_~x~0_376 (* v_main_~x~0_375 (- 1)) v_main_~y~0_399)) (< 0 .cse4) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_376 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_375 v_it_28 1) v_main_~x~0_376)) (not (<= 1 v_it_28))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_399, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_376, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_375, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {24073#true} [151] 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[] {24073#true} is VALID [2022-04-15 06:44:10,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {24073#true} ~z~0 := ~y~0; {24078#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:44:10,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {24078#(= (+ 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; {24079#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:10,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {24079#(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; {24080#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:10,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {24080#(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; {24081#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:10,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {24081#(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; {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:10,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:10,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24083#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:44:10,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {24083#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24084#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:10,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {24084#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24085#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:44:10,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {24085#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {24074#false} assume !(~x~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {24074#false} assume !(~z~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {24074#false} assume !(~y~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,177 INFO L272 TraceCheckUtils]: 28: Hoare triple {24074#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24074#false} is VALID [2022-04-15 06:44:10,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {24074#false} ~cond := #in~cond; {24074#false} is VALID [2022-04-15 06:44:10,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {24074#false} assume 0 == ~cond; {24074#false} is VALID [2022-04-15 06:44:10,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {24074#false} assume !false; {24074#false} is VALID [2022-04-15 06:44:10,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:44:10,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:10,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305018109] [2022-04-15 06:44:10,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305018109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:10,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028490126] [2022-04-15 06:44:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:10,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:10,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:10,179 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:10,180 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:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:10,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:44:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:10,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:10,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {24073#true} call ULTIMATE.init(); {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {24073#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); {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {24073#true} assume true; {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24073#true} {24073#true} #94#return; {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {24073#true} call #t~ret17 := main(); {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {24073#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {24073#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse1 (= v_main_~y~0_399 v_main_~y~0_398)) (.cse2 (= v_main_~x~0_376 v_main_~x~0_375)) (.cse3 (= |v_main_#t~post6_135| |v_main_#t~post6_134|)) (.cse4 (mod v_main_~x~0_376 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_375 v_main_~x~0_376) (= v_main_~y~0_398 (+ v_main_~x~0_376 (* v_main_~x~0_375 (- 1)) v_main_~y~0_399)) (< 0 .cse4) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_376 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_375 v_it_28 1) v_main_~x~0_376)) (not (<= 1 v_it_28))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_399, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_376, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_375, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24073#true} is VALID [2022-04-15 06:44:10,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {24073#true} [151] 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[] {24073#true} is VALID [2022-04-15 06:44:10,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {24073#true} ~z~0 := ~y~0; {24078#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:44:10,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {24078#(= (+ 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; {24079#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:10,521 INFO L290 TraceCheckUtils]: 10: Hoare triple {24079#(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; {24080#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:10,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {24080#(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; {24081#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:10,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {24081#(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; {24126#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:10,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {24126#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {24126#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:10,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {24126#(and (<= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (+ main_~z~0 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24133#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:10,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {24133#(and (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24137#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:10,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {24137#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24141#(and (<= main_~z~0 (+ main_~y~0 2)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {24141#(and (<= main_~z~0 (+ main_~y~0 2)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (+ main_~y~0 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {24074#false} assume !(~x~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {24074#false} assume !(~z~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {24074#false} assume !(~y~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L272 TraceCheckUtils]: 28: Hoare triple {24074#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {24074#false} ~cond := #in~cond; {24074#false} is VALID [2022-04-15 06:44:10,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {24074#false} assume 0 == ~cond; {24074#false} is VALID [2022-04-15 06:44:10,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {24074#false} assume !false; {24074#false} is VALID [2022-04-15 06:44:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:44:10,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:10,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {24074#false} assume !false; {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {24074#false} assume 0 == ~cond; {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {24074#false} ~cond := #in~cond; {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L272 TraceCheckUtils]: 28: Hoare triple {24074#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {24074#false} assume !(~y~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {24074#false} assume !(~z~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 25: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 23: Hoare triple {24074#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {24074#false} assume !(~x~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {24074#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {24074#false} is VALID [2022-04-15 06:44:10,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {24085#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {24074#false} is VALID [2022-04-15 06:44:10,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {24084#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24085#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:44:10,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {24083#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24084#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-15 06:44:10,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {24083#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-15 06:44:10,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:10,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {24244#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod main_~z~0 4294967296) 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; {24082#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-15 06:44:10,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {24248#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= 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; {24244#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 06:44:10,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {24252#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= 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; {24248#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:44:10,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {24256#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 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; {24252#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-15 06:44:10,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {24073#true} ~z~0 := ~y~0; {24256#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:44:10,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {24073#true} [151] 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[] {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {24073#true} [152] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse1 (= v_main_~y~0_399 v_main_~y~0_398)) (.cse2 (= v_main_~x~0_376 v_main_~x~0_375)) (.cse3 (= |v_main_#t~post6_135| |v_main_#t~post6_134|)) (.cse4 (mod v_main_~x~0_376 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_375 v_main_~x~0_376) (= v_main_~y~0_398 (+ v_main_~x~0_376 (* v_main_~x~0_375 (- 1)) v_main_~y~0_399)) (< 0 .cse4) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_376 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_375 v_it_28 1) v_main_~x~0_376)) (not (<= 1 v_it_28))))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_399, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_376, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_398, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_375, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {24073#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {24073#true} call #t~ret17 := main(); {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24073#true} {24073#true} #94#return; {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {24073#true} assume true; {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {24073#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); {24073#true} is VALID [2022-04-15 06:44:10,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {24073#true} call ULTIMATE.init(); {24073#true} is VALID [2022-04-15 06:44:10,897 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:44:10,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028490126] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:10,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:10,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-15 06:44:11,001 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:11,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [423649520] [2022-04-15 06:44:11,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [423649520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:11,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:11,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:44:11,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148371] [2022-04-15 06:44:11,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:11,002 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 34 [2022-04-15 06:44:11,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:11,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:11,033 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:44:11,033 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:44:11,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:11,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:44:11,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:44:11,034 INFO L87 Difference]: Start difference. First operand 145 states and 198 transitions. Second operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:14,993 INFO L93 Difference]: Finished difference Result 217 states and 282 transitions. [2022-04-15 06:44:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:44:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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 34 [2022-04-15 06:44:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:14,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2022-04-15 06:44:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 100 transitions. [2022-04-15 06:44:15,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 100 transitions. [2022-04-15 06:44:15,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:15,171 INFO L225 Difference]: With dead ends: 217 [2022-04-15 06:44:15,171 INFO L226 Difference]: Without dead ends: 172 [2022-04-15 06:44:15,172 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=1947, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 06:44:15,172 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 65 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:15,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 75 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:44:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-15 06:44:16,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 132. [2022-04-15 06:44:16,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:16,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 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:16,180 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 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:16,180 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 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:16,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:16,182 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2022-04-15 06:44:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2022-04-15 06:44:16,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:16,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:16,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 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 172 states. [2022-04-15 06:44:16,182 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 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 172 states. [2022-04-15 06:44:16,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:16,184 INFO L93 Difference]: Finished difference Result 172 states and 222 transitions. [2022-04-15 06:44:16,184 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2022-04-15 06:44:16,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:16,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:16,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:16,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 127 states have internal predecessors, (171), 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:16,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 175 transitions. [2022-04-15 06:44:16,191 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 175 transitions. Word has length 34 [2022-04-15 06:44:16,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:16,191 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 175 transitions. [2022-04-15 06:44:16,191 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7857142857142858) internal successors, (25), 13 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:44:16,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 175 transitions. [2022-04-15 06:44:25,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 172 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:25,334 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 175 transitions. [2022-04-15 06:44:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 06:44:25,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:25,334 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:25,351 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:25,534 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,SelfDestructingSolverStorable31 [2022-04-15 06:44:25,535 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:25,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:25,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1663345241, now seen corresponding path program 8 times [2022-04-15 06:44:25,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:25,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627403685] [2022-04-15 06:44:25,897 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:25,898 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1329355816, now seen corresponding path program 1 times [2022-04-15 06:44:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:25,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666306272] [2022-04-15 06:44:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:25,911 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:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:25,925 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:26,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:26,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {25402#(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); {25387#true} is VALID [2022-04-15 06:44:26,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {25387#true} assume true; {25387#true} is VALID [2022-04-15 06:44:26,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25387#true} {25387#true} #94#return; {25387#true} is VALID [2022-04-15 06:44:26,076 INFO L272 TraceCheckUtils]: 0: Hoare triple {25387#true} call ULTIMATE.init(); {25402#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:26,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {25402#(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); {25387#true} is VALID [2022-04-15 06:44:26,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {25387#true} assume true; {25387#true} is VALID [2022-04-15 06:44:26,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25387#true} {25387#true} #94#return; {25387#true} is VALID [2022-04-15 06:44:26,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {25387#true} call #t~ret17 := main(); {25387#true} is VALID [2022-04-15 06:44:26,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {25387#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25387#true} is VALID [2022-04-15 06:44:26,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {25387#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_396 4294967296)) (.cse0 (= v_main_~y~0_418 v_main_~y~0_417)) (.cse2 (= v_main_~x~0_396 v_main_~x~0_395))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) .cse0 (<= .cse1 0) .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (forall ((v_it_29 Int)) (or (< 0 (mod (+ v_main_~x~0_396 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)) (not (<= (+ v_main_~y~0_418 v_it_29 1) v_main_~y~0_417)))) (< v_main_~y~0_418 v_main_~y~0_417) (= v_main_~x~0_395 (+ v_main_~x~0_396 v_main_~y~0_418 (* (- 1) v_main_~y~0_417))) (< 0 .cse1)) (and .cse0 (= |v_main_#t~post5_140| |v_main_#t~post5_139|) (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_417, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_395, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25387#true} is VALID [2022-04-15 06:44:26,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {25387#true} [153] 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[] {25387#true} is VALID [2022-04-15 06:44:26,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {25387#true} ~z~0 := ~y~0; {25392#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:44:26,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {25392#(= (+ 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; {25393#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:26,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {25393#(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; {25394#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:26,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {25394#(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; {25395#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:26,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {25395#(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; {25396#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:26,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {25396#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {25397#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:44:26,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {25397#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25398#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:26,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {25398#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25399#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:26,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {25399#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25400#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:26,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25401#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25388#false} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {25388#false} assume !(~y~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {25388#false} assume !(~x~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {25388#false} assume !(~z~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {25388#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {25388#false} assume !(~y~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L272 TraceCheckUtils]: 28: Hoare triple {25388#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {25388#false} ~cond := #in~cond; {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {25388#false} assume 0 == ~cond; {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {25388#false} assume !false; {25388#false} is VALID [2022-04-15 06:44:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 06:44:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:26,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666306272] [2022-04-15 06:44:26,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666306272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:26,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846692996] [2022-04-15 06:44:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:26,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:26,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:26,090 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:26,095 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:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:26,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:44:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:26,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:26,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {25387#true} call ULTIMATE.init(); {25387#true} is VALID [2022-04-15 06:44:26,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {25387#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); {25387#true} is VALID [2022-04-15 06:44:26,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {25387#true} assume true; {25387#true} is VALID [2022-04-15 06:44:26,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25387#true} {25387#true} #94#return; {25387#true} is VALID [2022-04-15 06:44:26,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {25387#true} call #t~ret17 := main(); {25387#true} is VALID [2022-04-15 06:44:26,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {25387#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25387#true} is VALID [2022-04-15 06:44:26,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {25387#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_396 4294967296)) (.cse0 (= v_main_~y~0_418 v_main_~y~0_417)) (.cse2 (= v_main_~x~0_396 v_main_~x~0_395))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) .cse0 (<= .cse1 0) .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (forall ((v_it_29 Int)) (or (< 0 (mod (+ v_main_~x~0_396 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)) (not (<= (+ v_main_~y~0_418 v_it_29 1) v_main_~y~0_417)))) (< v_main_~y~0_418 v_main_~y~0_417) (= v_main_~x~0_395 (+ v_main_~x~0_396 v_main_~y~0_418 (* (- 1) v_main_~y~0_417))) (< 0 .cse1)) (and .cse0 (= |v_main_#t~post5_140| |v_main_#t~post5_139|) (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_417, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_395, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25387#true} is VALID [2022-04-15 06:44:26,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {25387#true} [153] 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[] {25387#true} is VALID [2022-04-15 06:44:26,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {25387#true} ~z~0 := ~y~0; {25392#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-15 06:44:26,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {25392#(= (+ 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; {25393#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:44:26,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {25393#(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; {25394#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:44:26,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {25394#(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; {25395#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:44:26,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {25395#(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; {25396#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:44:26,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {25396#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {25445#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-15 06:44:26,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {25445#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25398#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:26,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {25398#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25399#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:26,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {25399#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25400#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:26,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25401#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {25388#false} assume !(~y~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 20: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 21: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {25388#false} assume !(~x~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {25388#false} assume !(~z~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {25388#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {25388#false} assume !(~y~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:26,561 INFO L272 TraceCheckUtils]: 28: Hoare triple {25388#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25388#false} is VALID [2022-04-15 06:44:26,562 INFO L290 TraceCheckUtils]: 29: Hoare triple {25388#false} ~cond := #in~cond; {25388#false} is VALID [2022-04-15 06:44:26,562 INFO L290 TraceCheckUtils]: 30: Hoare triple {25388#false} assume 0 == ~cond; {25388#false} is VALID [2022-04-15 06:44:26,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {25388#false} assume !false; {25388#false} is VALID [2022-04-15 06:44:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 06:44:26,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {25388#false} assume !false; {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {25388#false} assume 0 == ~cond; {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {25388#false} ~cond := #in~cond; {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L272 TraceCheckUtils]: 28: Hoare triple {25388#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {25388#false} assume !(~y~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {25388#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {25388#false} assume !(~z~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:27,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {25388#false} assume !(~x~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:27,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:27,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:27,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:27,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {25388#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {25388#false} is VALID [2022-04-15 06:44:27,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {25388#false} assume !(~y~0 % 4294967296 > 0); {25388#false} is VALID [2022-04-15 06:44:27,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {25401#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25388#false} is VALID [2022-04-15 06:44:27,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {25400#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25401#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:44:27,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {25399#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25400#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:44:27,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {25398#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25399#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:27,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {25445#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25398#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:27,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {25554#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {25445#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-15 06:44:27,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {25558#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {25554#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:44:27,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {25562#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {25558#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:44:27,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {25566#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {25562#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:44:27,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {25570#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 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; {25566#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:44:27,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {25387#true} ~z~0 := ~y~0; {25570#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:44:27,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {25387#true} [153] 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[] {25387#true} is VALID [2022-04-15 06:44:27,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {25387#true} [154] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_396 4294967296)) (.cse0 (= v_main_~y~0_418 v_main_~y~0_417)) (.cse2 (= v_main_~x~0_396 v_main_~x~0_395))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) .cse0 (<= .cse1 0) .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (forall ((v_it_29 Int)) (or (< 0 (mod (+ v_main_~x~0_396 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)) (not (<= (+ v_main_~y~0_418 v_it_29 1) v_main_~y~0_417)))) (< v_main_~y~0_418 v_main_~y~0_417) (= v_main_~x~0_395 (+ v_main_~x~0_396 v_main_~y~0_418 (* (- 1) v_main_~y~0_417))) (< 0 .cse1)) (and .cse0 (= |v_main_#t~post5_140| |v_main_#t~post5_139|) (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_418, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_396, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_417, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_395, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {25387#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {25387#true} call #t~ret17 := main(); {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25387#true} {25387#true} #94#return; {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {25387#true} assume true; {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {25387#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); {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {25387#true} call ULTIMATE.init(); {25387#true} is VALID [2022-04-15 06:44:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-15 06:44:27,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846692996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:27,193 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:27,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2022-04-15 06:44:27,315 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:27,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627403685] [2022-04-15 06:44:27,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627403685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:27,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:27,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:44:27,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255905219] [2022-04-15 06:44:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:27,316 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 34 [2022-04-15 06:44:27,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:27,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:44:27,345 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:44:27,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:44:27,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:27,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:44:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:44:27,346 INFO L87 Difference]: Start difference. First operand 132 states and 175 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:44:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:31,475 INFO L93 Difference]: Finished difference Result 285 states and 378 transitions. [2022-04-15 06:44:31,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:44:31,475 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 34 [2022-04-15 06:44:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:31,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:44:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 127 transitions. [2022-04-15 06:44:31,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:44:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 127 transitions. [2022-04-15 06:44:31,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 127 transitions. [2022-04-15 06:44:31,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:31,638 INFO L225 Difference]: With dead ends: 285 [2022-04-15 06:44:31,638 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 06:44:31,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=2506, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:44:31,639 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:31,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 85 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:44:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 06:44:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 136. [2022-04-15 06:44:32,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:32,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 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:32,675 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 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:32,675 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 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:32,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:32,676 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2022-04-15 06:44:32,676 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2022-04-15 06:44:32,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:32,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:32,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 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 176 states. [2022-04-15 06:44:32,677 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 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 176 states. [2022-04-15 06:44:32,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:32,679 INFO L93 Difference]: Finished difference Result 176 states and 225 transitions. [2022-04-15 06:44:32,679 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2022-04-15 06:44:32,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:32,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:32,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:32,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.3282442748091603) internal successors, (174), 131 states have internal predecessors, (174), 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:32,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 178 transitions. [2022-04-15 06:44:32,681 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 178 transitions. Word has length 34 [2022-04-15 06:44:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:32,681 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 178 transitions. [2022-04-15 06:44:32,681 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:44:32,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 178 transitions. [2022-04-15 06:44:40,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 176 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:40,148 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 178 transitions. [2022-04-15 06:44:40,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:44:40,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:40,149 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:40,184 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:44:40,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:40,349 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 289270042, now seen corresponding path program 6 times [2022-04-15 06:44:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:40,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1265586191] [2022-04-15 06:44:40,536 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:40,537 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:40,539 INFO L85 PathProgramCache]: Analyzing trace with hash 558989945, now seen corresponding path program 1 times [2022-04-15 06:44:40,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:40,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17938944] [2022-04-15 06:44:40,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:40,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:40,549 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:40,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:40,562 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:40,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:40,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {26875#(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); {26864#true} is VALID [2022-04-15 06:44:40,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-15 06:44:40,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26864#true} {26864#true} #94#return; {26864#true} is VALID [2022-04-15 06:44:40,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {26864#true} call ULTIMATE.init(); {26875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:40,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {26875#(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); {26864#true} is VALID [2022-04-15 06:44:40,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-15 06:44:40,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26864#true} {26864#true} #94#return; {26864#true} is VALID [2022-04-15 06:44:40,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {26864#true} call #t~ret17 := main(); {26864#true} is VALID [2022-04-15 06:44:40,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {26864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26864#true} is VALID [2022-04-15 06:44:40,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {26864#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_414 4294967296)) (.cse0 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse1 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse2 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse3 (= v_main_~y~0_442 v_main_~y~0_441))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_414 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~y~0_442 v_it_30 1) v_main_~y~0_441)))) (< v_main_~y~0_442 v_main_~y~0_441) (= v_main_~x~0_413 (+ v_main_~x~0_414 v_main_~y~0_442 (* (- 1) v_main_~y~0_441))) (< 0 .cse4)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_414, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_441, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26864#true} is VALID [2022-04-15 06:44:40,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {26864#true} [155] 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[] {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {26869#(<= 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; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:40,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {26870#(<= 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; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,670 INFO L290 TraceCheckUtils]: 11: Hoare triple {26871#(<= 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; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:40,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:40,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,679 INFO L290 TraceCheckUtils]: 25: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:40,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,682 INFO L272 TraceCheckUtils]: 29: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26873#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:44:40,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {26873#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26874#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:44:40,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {26874#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26865#false} is VALID [2022-04-15 06:44:40,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {26865#false} assume !false; {26865#false} is VALID [2022-04-15 06:44:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:44:40,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:40,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17938944] [2022-04-15 06:44:40,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17938944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:40,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481249317] [2022-04-15 06:44:40,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:40,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:40,686 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:44:40,687 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:44:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:40,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:44:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:40,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:40,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {26864#true} call ULTIMATE.init(); {26864#true} is VALID [2022-04-15 06:44:40,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {26864#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); {26864#true} is VALID [2022-04-15 06:44:40,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26864#true} {26864#true} #94#return; {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {26864#true} call #t~ret17 := main(); {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {26864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {26864#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_414 4294967296)) (.cse0 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse1 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse2 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse3 (= v_main_~y~0_442 v_main_~y~0_441))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_414 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~y~0_442 v_it_30 1) v_main_~y~0_441)))) (< v_main_~y~0_442 v_main_~y~0_441) (= v_main_~x~0_413 (+ v_main_~x~0_414 v_main_~y~0_442 (* (- 1) v_main_~y~0_441))) (< 0 .cse4)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_414, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_441, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {26864#true} [155] 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[] {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {26864#true} ~z~0 := ~y~0; {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {26864#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {26864#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26864#true} is VALID [2022-04-15 06:44:40,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {26864#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {26864#true} assume !(~z~0 % 4294967296 > 0); {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {26864#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {26864#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {26864#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {26864#true} assume !(~y~0 % 4294967296 > 0); {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {26864#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {26864#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26864#true} is VALID [2022-04-15 06:44:40,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {26864#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26864#true} is VALID [2022-04-15 06:44:40,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {26864#true} assume !(~x~0 % 4294967296 > 0); {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:40,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:40,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:40,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,957 INFO L290 TraceCheckUtils]: 28: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:40,957 INFO L272 TraceCheckUtils]: 29: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:44:40,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {26966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:44:40,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {26970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26865#false} is VALID [2022-04-15 06:44:40,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {26865#false} assume !false; {26865#false} is VALID [2022-04-15 06:44:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 06:44:40,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:41,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {26865#false} assume !false; {26865#false} is VALID [2022-04-15 06:44:41,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {26970#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {26865#false} is VALID [2022-04-15 06:44:41,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {26966#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {26970#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:44:41,207 INFO L272 TraceCheckUtils]: 29: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {26966#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:44:41,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:41,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:41,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:41,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:41,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:41,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26872#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:41,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26871#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:41,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26870#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:41,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {26864#true} assume !(~x~0 % 4294967296 > 0); {26869#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:41,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {26864#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26864#true} is VALID [2022-04-15 06:44:41,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {26864#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26864#true} is VALID [2022-04-15 06:44:41,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {26864#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {26864#true} is VALID [2022-04-15 06:44:41,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {26864#true} assume !(~y~0 % 4294967296 > 0); {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {26864#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {26864#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {26864#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {26864#true} assume !(~z~0 % 4294967296 > 0); {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {26864#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {26864#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {26864#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {26864#true} ~z~0 := ~y~0; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {26864#true} [155] 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[] {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {26864#true} [156] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_414 4294967296)) (.cse0 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse1 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse2 (= v_main_~x~0_414 v_main_~x~0_413)) (.cse3 (= v_main_~y~0_442 v_main_~y~0_441))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_414 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~y~0_442 v_it_30 1) v_main_~y~0_441)))) (< v_main_~y~0_442 v_main_~y~0_441) (= v_main_~x~0_413 (+ v_main_~x~0_414 v_main_~y~0_442 (* (- 1) v_main_~y~0_441))) (< 0 .cse4)) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_442, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_414, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_441, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {26864#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {26864#true} call #t~ret17 := main(); {26864#true} is VALID [2022-04-15 06:44:41,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26864#true} {26864#true} #94#return; {26864#true} is VALID [2022-04-15 06:44:41,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {26864#true} assume true; {26864#true} is VALID [2022-04-15 06:44:41,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {26864#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); {26864#true} is VALID [2022-04-15 06:44:41,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {26864#true} call ULTIMATE.init(); {26864#true} is VALID [2022-04-15 06:44:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 06:44:41,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481249317] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:41,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:41,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 11 [2022-04-15 06:44:41,283 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:41,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1265586191] [2022-04-15 06:44:41,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1265586191] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:41,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:41,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:44:41,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441178192] [2022-04-15 06:44:41,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:41,284 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 35 [2022-04-15 06:44:41,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:41,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:44:41,315 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:44:41,315 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:44:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:41,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:44:41,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:44:41,315 INFO L87 Difference]: Start difference. First operand 136 states and 178 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:44:44,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:44,097 INFO L93 Difference]: Finished difference Result 214 states and 288 transitions. [2022-04-15 06:44:44,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:44:44,097 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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 35 [2022-04-15 06:44:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:44:44,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:44:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-15 06:44:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:44:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 93 transitions. [2022-04-15 06:44:44,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 93 transitions. [2022-04-15 06:44:44,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:44,199 INFO L225 Difference]: With dead ends: 214 [2022-04-15 06:44:44,199 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 06:44:44,199 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 74 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:44:44,200 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:44:44,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 42 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:44:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 06:44:45,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 141. [2022-04-15 06:44:45,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:44:45,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 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:45,337 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 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:45,338 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 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:45,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:45,340 INFO L93 Difference]: Finished difference Result 205 states and 278 transitions. [2022-04-15 06:44:45,340 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2022-04-15 06:44:45,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:45,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:45,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 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 205 states. [2022-04-15 06:44:45,340 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 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 205 states. [2022-04-15 06:44:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:44:45,342 INFO L93 Difference]: Finished difference Result 205 states and 278 transitions. [2022-04-15 06:44:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 278 transitions. [2022-04-15 06:44:45,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:44:45,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:44:45,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:44:45,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:44:45,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.3529411764705883) internal successors, (184), 136 states have internal predecessors, (184), 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:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 188 transitions. [2022-04-15 06:44:45,344 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 188 transitions. Word has length 35 [2022-04-15 06:44:45,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:44:45,345 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 188 transitions. [2022-04-15 06:44:45,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 10 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:44:45,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 188 transitions. [2022-04-15 06:44:52,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 187 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:44:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 188 transitions. [2022-04-15 06:44:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 06:44:52,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:44:52,460 INFO L499 BasicCegarLoop]: trace histogram [7, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:44:52,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 06:44:52,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:52,672 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:44:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:44:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash 237906376, now seen corresponding path program 9 times [2022-04-15 06:44:52,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:52,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519272168] [2022-04-15 06:44:52,902 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:52,903 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:44:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1603510150, now seen corresponding path program 1 times [2022-04-15 06:44:52,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:44:52,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145034773] [2022-04-15 06:44:52,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:52,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:44:52,915 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:44:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:52,925 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:44:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:44:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:53,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {28230#(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); {28216#true} is VALID [2022-04-15 06:44:53,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {28216#true} assume true; {28216#true} is VALID [2022-04-15 06:44:53,048 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28216#true} {28216#true} #94#return; {28216#true} is VALID [2022-04-15 06:44:53,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {28216#true} call ULTIMATE.init(); {28230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:44:53,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {28230#(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); {28216#true} is VALID [2022-04-15 06:44:53,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {28216#true} assume true; {28216#true} is VALID [2022-04-15 06:44:53,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28216#true} {28216#true} #94#return; {28216#true} is VALID [2022-04-15 06:44:53,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {28216#true} call #t~ret17 := main(); {28216#true} is VALID [2022-04-15 06:44:53,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {28216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28216#true} is VALID [2022-04-15 06:44:53,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {28216#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_435 v_main_~x~0_434)) (.cse2 (= |v_main_#t~post6_150| |v_main_#t~post6_149|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= |v_main_#t~post5_150| |v_main_#t~post5_149|)) (.cse1 (mod v_main_~x~0_435 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~y~0_454 v_main_~y~0_453) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_454 v_it_31 1) v_main_~y~0_453)) (< 0 (mod (+ v_main_~x~0_435 (* 4294967295 v_it_31)) 4294967296)))) (< 0 .cse1) (= v_main_~x~0_434 (+ v_main_~x~0_435 v_main_~y~0_454 (* (- 1) v_main_~y~0_453)))))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_435, main_#t~post6=|v_main_#t~post6_150|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_149|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28216#true} is VALID [2022-04-15 06:44:53,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {28216#true} [157] 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[] {28221#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:53,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {28221#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {28221#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:44:53,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {28221#(<= 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; {28222#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:44:53,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {28222#(<= 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; {28223#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {28223#(<= 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; {28224#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {28224#(<= 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; {28225#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {28225#(<= 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; {28226#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:44:53,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {28226#(<= 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; {28227#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {28227#(<= 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; {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {28228#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28229#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {28229#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {28217#false} assume !(~z~0 % 4294967296 > 0); {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {28217#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {28217#false} assume !(~y~0 % 4294967296 > 0); {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L272 TraceCheckUtils]: 28: Hoare triple {28217#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {28217#false} ~cond := #in~cond; {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {28217#false} assume 0 == ~cond; {28217#false} is VALID [2022-04-15 06:44:53,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {28217#false} assume !false; {28217#false} is VALID [2022-04-15 06:44:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:44:53,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:44:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145034773] [2022-04-15 06:44:53,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145034773] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:44:53,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986518719] [2022-04-15 06:44:53,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:44:53,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:44:53,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:44:53,061 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:44:53,062 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:44:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:53,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:44:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:44:53,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:44:53,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {28216#true} call ULTIMATE.init(); {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {28216#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); {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {28216#true} assume true; {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28216#true} {28216#true} #94#return; {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {28216#true} call #t~ret17 := main(); {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {28216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {28216#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_435 v_main_~x~0_434)) (.cse2 (= |v_main_#t~post6_150| |v_main_#t~post6_149|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= |v_main_#t~post5_150| |v_main_#t~post5_149|)) (.cse1 (mod v_main_~x~0_435 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~y~0_454 v_main_~y~0_453) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_454 v_it_31 1) v_main_~y~0_453)) (< 0 (mod (+ v_main_~x~0_435 (* 4294967295 v_it_31)) 4294967296)))) (< 0 .cse1) (= v_main_~x~0_434 (+ v_main_~x~0_435 v_main_~y~0_454 (* (- 1) v_main_~y~0_453)))))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_435, main_#t~post6=|v_main_#t~post6_150|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_149|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {28216#true} [157] 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[] {28216#true} is VALID [2022-04-15 06:44:53,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {28216#true} ~z~0 := ~y~0; {28258#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:44:53,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {28258#(= 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; {28262#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:44:53,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {28262#(= 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; {28266#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:44:53,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {28266#(= (+ main_~z~0 1) (+ (- 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; {28270#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:44:53,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {28270#(= (+ main_~z~0 2) (+ (- 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; {28274#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:44:53,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {28274#(= (+ main_~z~0 3) (+ (- 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; {28278#(= (+ (- 1) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-15 06:44:53,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {28278#(= (+ (- 1) 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; {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {28282#(< 0 (mod (+ 4294967291 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; {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {28292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:44:53,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {28296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:44:53,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {28300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:44:53,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {28308#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:44:53,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {28308#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {28308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:44:53,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {28308#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28217#false} is VALID [2022-04-15 06:44:53,395 INFO L272 TraceCheckUtils]: 28: Hoare triple {28217#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {28217#false} is VALID [2022-04-15 06:44:53,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {28217#false} ~cond := #in~cond; {28217#false} is VALID [2022-04-15 06:44:53,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {28217#false} assume 0 == ~cond; {28217#false} is VALID [2022-04-15 06:44:53,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {28217#false} assume !false; {28217#false} is VALID [2022-04-15 06:44:53,395 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:44:53,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:44:53,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {28217#false} assume !false; {28217#false} is VALID [2022-04-15 06:44:53,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {28217#false} assume 0 == ~cond; {28217#false} is VALID [2022-04-15 06:44:53,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {28217#false} ~cond := #in~cond; {28217#false} is VALID [2022-04-15 06:44:53,699 INFO L272 TraceCheckUtils]: 28: Hoare triple {28217#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {28217#false} is VALID [2022-04-15 06:44:53,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {28308#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28217#false} is VALID [2022-04-15 06:44:53,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {28308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:44:53,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {28308#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {28308#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {28308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:44:53,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28308#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:44:53,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {28300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28304#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:44:53,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {28296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28300#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:44:53,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {28292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28296#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:44:53,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28292#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {28282#(< 0 (mod (+ 4294967291 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; {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {28390#(or (< 0 (mod (+ 4294967291 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; {28282#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:44:53,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {28394#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 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; {28390#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:44:53,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {28398#(or (< 0 (mod (+ 4294967291 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; {28394#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:44:53,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {28402#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 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; {28398#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:44:53,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {28406#(or (< 0 (mod (+ 4294967291 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; {28402#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:44:53,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {28410#(or (< 0 (mod (+ 4294967291 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; {28406#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:44:53,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {28216#true} ~z~0 := ~y~0; {28410#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:44:53,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {28216#true} [157] 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[] {28216#true} is VALID [2022-04-15 06:44:53,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {28216#true} [158] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_435 v_main_~x~0_434)) (.cse2 (= |v_main_#t~post6_150| |v_main_#t~post6_149|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= |v_main_#t~post5_150| |v_main_#t~post5_149|)) (.cse1 (mod v_main_~x~0_435 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (< v_main_~y~0_454 v_main_~y~0_453) (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_454 v_it_31 1) v_main_~y~0_453)) (< 0 (mod (+ v_main_~x~0_435 (* 4294967295 v_it_31)) 4294967296)))) (< 0 .cse1) (= v_main_~x~0_434 (+ v_main_~x~0_435 v_main_~y~0_454 (* (- 1) v_main_~y~0_453)))))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_435, main_#t~post6=|v_main_#t~post6_150|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_149|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {28216#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {28216#true} call #t~ret17 := main(); {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28216#true} {28216#true} #94#return; {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {28216#true} assume true; {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {28216#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); {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {28216#true} call ULTIMATE.init(); {28216#true} is VALID [2022-04-15 06:44:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:44:53,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986518719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:44:53,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:44:53,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 30 [2022-04-15 06:44:54,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:44:54,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519272168] [2022-04-15 06:44:54,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519272168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:44:54,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:44:54,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 06:44:54,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633290844] [2022-04-15 06:44:54,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:44:54,026 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 35 [2022-04-15 06:44:54,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:44:54,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:44:54,068 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:44:54,068 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 06:44:54,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:44:54,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 06:44:54,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:44:54,069 INFO L87 Difference]: Start difference. First operand 141 states and 188 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:45:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:00,474 INFO L93 Difference]: Finished difference Result 408 states and 585 transitions. [2022-04-15 06:45:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 06:45:00,474 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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 35 [2022-04-15 06:45:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:45:00,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2022-04-15 06:45:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:45:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 188 transitions. [2022-04-15 06:45:00,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 188 transitions. [2022-04-15 06:45:00,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:00,716 INFO L225 Difference]: With dead ends: 408 [2022-04-15 06:45:00,716 INFO L226 Difference]: Without dead ends: 357 [2022-04-15 06:45:00,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 06:45:00,717 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 221 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:00,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 79 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:45:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-04-15 06:45:01,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 151. [2022-04-15 06:45:01,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:01,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 357 states. Second operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 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:45:01,954 INFO L74 IsIncluded]: Start isIncluded. First operand 357 states. Second operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 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:45:01,955 INFO L87 Difference]: Start difference. First operand 357 states. Second operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 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:45:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:01,959 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2022-04-15 06:45:01,959 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2022-04-15 06:45:01,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:01,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:01,960 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 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 357 states. [2022-04-15 06:45:01,960 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 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 357 states. [2022-04-15 06:45:01,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:01,965 INFO L93 Difference]: Finished difference Result 357 states and 496 transitions. [2022-04-15 06:45:01,965 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 496 transitions. [2022-04-15 06:45:01,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:01,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:01,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:01,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.356164383561644) internal successors, (198), 146 states have internal predecessors, (198), 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:45:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 202 transitions. [2022-04-15 06:45:01,967 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 202 transitions. Word has length 35 [2022-04-15 06:45:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:01,967 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 202 transitions. [2022-04-15 06:45:01,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 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:45:01,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 202 transitions. [2022-04-15 06:45:08,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 201 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 202 transitions. [2022-04-15 06:45:08,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:45:08,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:08,838 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:08,854 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:45:09,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:09,039 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:09,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:09,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2040976357, now seen corresponding path program 7 times [2022-04-15 06:45:09,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:09,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505106852] [2022-04-15 06:45:09,216 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:45:09,218 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:09,219 INFO L85 PathProgramCache]: Analyzing trace with hash 344901350, now seen corresponding path program 1 times [2022-04-15 06:45:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573238149] [2022-04-15 06:45:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:09,228 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:45:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:09,242 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_32.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:45:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:09,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {30319#(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); {30310#true} is VALID [2022-04-15 06:45:09,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {30310#true} assume true; {30310#true} is VALID [2022-04-15 06:45:09,309 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30310#true} {30310#true} #94#return; {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {30310#true} call ULTIMATE.init(); {30319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:45:09,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {30319#(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); {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {30310#true} assume true; {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30310#true} {30310#true} #94#return; {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {30310#true} call #t~ret17 := main(); {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {30310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {30310#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_478 v_main_~y~0_477)) (.cse2 (= v_main_~x~0_454 v_main_~x~0_453)) (.cse3 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse4 (= |v_main_#t~post6_155| |v_main_#t~post6_154|)) (.cse1 (mod v_main_~x~0_454 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_478 v_it_32 1) v_main_~y~0_477)) (< 0 (mod (+ v_main_~x~0_454 (* 4294967295 v_it_32)) 4294967296)))) (< 0 .cse1) (< v_main_~y~0_478 v_main_~y~0_477) (= v_main_~x~0_453 (+ v_main_~x~0_454 v_main_~y~0_478 (* (- 1) v_main_~y~0_477)))))) InVars {main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_477, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_453, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {30310#true} [159] 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[] {30310#true} is VALID [2022-04-15 06:45:09,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {30310#true} ~z~0 := ~y~0; {30310#true} is VALID [2022-04-15 06:45:09,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {30310#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30310#true} is VALID [2022-04-15 06:45:09,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {30310#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30310#true} is VALID [2022-04-15 06:45:09,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {30310#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30310#true} is VALID [2022-04-15 06:45:09,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {30310#true} assume !(~z~0 % 4294967296 > 0); {30315#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:09,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {30315#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30316#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:45:09,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {30316#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30317#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:45:09,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {30317#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:09,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:09,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:09,315 INFO L290 TraceCheckUtils]: 18: Hoare triple {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:09,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:09,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:09,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {30318#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30317#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:45:09,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {30317#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30316#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:45:09,318 INFO L290 TraceCheckUtils]: 23: Hoare triple {30316#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30315#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {30315#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {30311#false} assume !(~z~0 % 4294967296 > 0); {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {30311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {30311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {30311#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {30311#false} assume !(~y~0 % 4294967296 > 0); {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L272 TraceCheckUtils]: 30: Hoare triple {30311#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {30311#false} ~cond := #in~cond; {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {30311#false} assume 0 == ~cond; {30311#false} is VALID [2022-04-15 06:45:09,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {30311#false} assume !false; {30311#false} is VALID [2022-04-15 06:45:09,320 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 06:45:09,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:09,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573238149] [2022-04-15 06:45:09,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573238149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:09,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436007549] [2022-04-15 06:45:09,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:09,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:09,327 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:45:09,328 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:45:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:09,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:45:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:09,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:09,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {30310#true} call ULTIMATE.init(); {30310#true} is VALID [2022-04-15 06:45:09,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {30310#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); {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {30310#true} assume true; {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30310#true} {30310#true} #94#return; {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {30310#true} call #t~ret17 := main(); {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {30310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {30310#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_478 v_main_~y~0_477)) (.cse2 (= v_main_~x~0_454 v_main_~x~0_453)) (.cse3 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse4 (= |v_main_#t~post6_155| |v_main_#t~post6_154|)) (.cse1 (mod v_main_~x~0_454 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_478 v_it_32 1) v_main_~y~0_477)) (< 0 (mod (+ v_main_~x~0_454 (* 4294967295 v_it_32)) 4294967296)))) (< 0 .cse1) (< v_main_~y~0_478 v_main_~y~0_477) (= v_main_~x~0_453 (+ v_main_~x~0_454 v_main_~y~0_478 (* (- 1) v_main_~y~0_477)))))) InVars {main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_477, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_453, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {30310#true} [159] 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[] {30310#true} is VALID [2022-04-15 06:45:09,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {30310#true} ~z~0 := ~y~0; {30347#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:09,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {30347#(= 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; {30351#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:45:09,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {30351#(= 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; {30355#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:45:09,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {30355#(= (+ main_~z~0 1) (+ (- 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; {30359#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:09,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {30359#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {30359#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:09,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {30359#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30351#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:45:09,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {30351#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30369#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:45:09,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {30369#(= main_~z~0 (+ main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30373#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-15 06:45:09,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {30373#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {30373#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-15 06:45:09,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {30373#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30380#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:45:09,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {30380#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30369#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:45:09,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {30369#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30347#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:09,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {30347#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {30347#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:09,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {30347#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30351#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:45:09,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {30351#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30355#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:45:09,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {30355#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30359#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:09,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {30359#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:45:09,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:45:09,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30409#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:45:09,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {30409#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30413#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:45:09,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {30413#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30417#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:09,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {30417#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30311#false} is VALID [2022-04-15 06:45:09,612 INFO L272 TraceCheckUtils]: 30: Hoare triple {30311#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30311#false} is VALID [2022-04-15 06:45:09,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {30311#false} ~cond := #in~cond; {30311#false} is VALID [2022-04-15 06:45:09,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {30311#false} assume 0 == ~cond; {30311#false} is VALID [2022-04-15 06:45:09,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {30311#false} assume !false; {30311#false} is VALID [2022-04-15 06:45:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:45:09,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:10,016 INFO L290 TraceCheckUtils]: 33: Hoare triple {30311#false} assume !false; {30311#false} is VALID [2022-04-15 06:45:10,016 INFO L290 TraceCheckUtils]: 32: Hoare triple {30311#false} assume 0 == ~cond; {30311#false} is VALID [2022-04-15 06:45:10,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {30311#false} ~cond := #in~cond; {30311#false} is VALID [2022-04-15 06:45:10,016 INFO L272 TraceCheckUtils]: 30: Hoare triple {30311#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {30311#false} is VALID [2022-04-15 06:45:10,017 INFO L290 TraceCheckUtils]: 29: Hoare triple {30417#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {30311#false} is VALID [2022-04-15 06:45:10,018 INFO L290 TraceCheckUtils]: 28: Hoare triple {30413#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30417#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:10,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {30409#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30413#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:45:10,019 INFO L290 TraceCheckUtils]: 26: Hoare triple {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {30409#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:45:10,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:45:10,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {30460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30402#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:45:10,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {30464#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {30468#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30464#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {30472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {30468#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {30472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {30472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {30479#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,025 INFO L290 TraceCheckUtils]: 18: Hoare triple {30483#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30479#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-15 06:45:10,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {30487#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {30483#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:45:10,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {30487#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {30487#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:45:10,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {30494#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30487#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:45:10,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {30498#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30494#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:45:10,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {30460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30498#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:45:10,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {30460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {30460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {30464#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {30460#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {30468#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~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; {30464#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {30472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~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; {30468#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {30310#true} ~z~0 := ~y~0; {30472#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:10,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {30310#true} [159] 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[] {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {30310#true} [160] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_478 v_main_~y~0_477)) (.cse2 (= v_main_~x~0_454 v_main_~x~0_453)) (.cse3 (= |v_main_#t~post5_155| |v_main_#t~post5_154|)) (.cse4 (= |v_main_#t~post6_155| |v_main_#t~post6_154|)) (.cse1 (mod v_main_~x~0_454 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (forall ((v_it_32 Int)) (or (not (<= 1 v_it_32)) (not (<= (+ v_main_~y~0_478 v_it_32 1) v_main_~y~0_477)) (< 0 (mod (+ v_main_~x~0_454 (* 4294967295 v_it_32)) 4294967296)))) (< 0 .cse1) (< v_main_~y~0_478 v_main_~y~0_477) (= v_main_~x~0_453 (+ v_main_~x~0_454 v_main_~y~0_478 (* (- 1) v_main_~y~0_477)))))) InVars {main_~y~0=v_main_~y~0_478, main_#t~post5=|v_main_#t~post5_155|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_155|} OutVars{main_~y~0=v_main_~y~0_477, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_453, main_#t~post6=|v_main_#t~post6_154|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {30310#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {30310#true} call #t~ret17 := main(); {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30310#true} {30310#true} #94#return; {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {30310#true} assume true; {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {30310#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); {30310#true} is VALID [2022-04-15 06:45:10,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {30310#true} call ULTIMATE.init(); {30310#true} is VALID [2022-04-15 06:45:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:45:10,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436007549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:10,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:10,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 13, 15] total 27 [2022-04-15 06:45:10,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:10,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505106852] [2022-04-15 06:45:10,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505106852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:10,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:10,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:45:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139358125] [2022-04-15 06:45:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:10,195 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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 36 [2022-04-15 06:45:10,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:10,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:45:10,225 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:45:10,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:45:10,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:10,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:45:10,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=783, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:45:10,226 INFO L87 Difference]: Start difference. First operand 151 states and 202 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:45:13,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:13,049 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2022-04-15 06:45:13,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:45:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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 36 [2022-04-15 06:45:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:45:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2022-04-15 06:45:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:45:13,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 69 transitions. [2022-04-15 06:45:13,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 69 transitions. [2022-04-15 06:45:13,128 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:45:13,130 INFO L225 Difference]: With dead ends: 200 [2022-04-15 06:45:13,130 INFO L226 Difference]: Without dead ends: 173 [2022-04-15 06:45:13,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 06:45:13,131 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:13,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 51 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:45:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-15 06:45:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 138. [2022-04-15 06:45:14,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:14,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 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:45:14,265 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 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:45:14,266 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 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:45:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:14,267 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2022-04-15 06:45:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2022-04-15 06:45:14,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:14,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:14,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 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 173 states. [2022-04-15 06:45:14,268 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 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 173 states. [2022-04-15 06:45:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:14,269 INFO L93 Difference]: Finished difference Result 173 states and 227 transitions. [2022-04-15 06:45:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 227 transitions. [2022-04-15 06:45:14,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:14,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:14,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:14,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.3759398496240602) internal successors, (183), 133 states have internal predecessors, (183), 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:45:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 187 transitions. [2022-04-15 06:45:14,271 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 187 transitions. Word has length 36 [2022-04-15 06:45:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:14,271 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 187 transitions. [2022-04-15 06:45:14,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 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:45:14,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 187 transitions. [2022-04-15 06:45:24,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 185 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:24,787 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 187 transitions. [2022-04-15 06:45:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 06:45:24,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:24,788 INFO L499 BasicCegarLoop]: trace histogram [8, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:24,811 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:45:24,988 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,SelfDestructingSolverStorable35 [2022-04-15 06:45:24,988 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:24,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:24,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1429571964, now seen corresponding path program 10 times [2022-04-15 06:45:24,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:24,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [744385731] [2022-04-15 06:45:25,187 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:45:25,189 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:25,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1925007366, now seen corresponding path program 1 times [2022-04-15 06:45:25,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:25,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473475099] [2022-04-15 06:45:25,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:25,201 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:45:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:25,212 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:45:25,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:25,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {31616#(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); {31601#true} is VALID [2022-04-15 06:45:25,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {31601#true} assume true; {31601#true} is VALID [2022-04-15 06:45:25,350 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31601#true} {31601#true} #94#return; {31601#true} is VALID [2022-04-15 06:45:25,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {31601#true} call ULTIMATE.init(); {31616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {31616#(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); {31601#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {31601#true} assume true; {31601#true} is VALID [2022-04-15 06:45:25,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31601#true} {31601#true} #94#return; {31601#true} is VALID [2022-04-15 06:45:25,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {31601#true} call #t~ret17 := main(); {31601#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {31601#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31601#true} is VALID [2022-04-15 06:45:25,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {31601#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_505 v_main_~y~0_504)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476)) (.cse2 (mod v_main_~x~0_477 4294967296))) (or (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_159|) (= |v_main_#t~post6_160| |v_main_#t~post6_159|) .cse1) (and .cse0 (= |v_main_#t~post5_159| |v_main_#t~post5_160|) .cse1 (= |v_main_#t~post6_159| |v_main_#t~post6_160|) (<= .cse2 0)) (and (< v_main_~y~0_505 v_main_~y~0_504) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_505 v_it_33 1) v_main_~y~0_504)) (< 0 (mod (+ v_main_~x~0_477 (* 4294967295 v_it_33)) 4294967296)))) (= v_main_~x~0_476 (+ v_main_~x~0_477 v_main_~y~0_505 (* (- 1) v_main_~y~0_504))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_505, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_477, main_#t~post6=|v_main_#t~post6_160|} OutVars{main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_159|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31601#true} is VALID [2022-04-15 06:45:25,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {31601#true} [161] 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[] {31606#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:45:25,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {31606#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {31606#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:45:25,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {31606#(<= 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; {31607#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:45:25,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {31607#(<= 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; {31608#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {31608#(<= 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; {31609#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {31609#(<= 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; {31610#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {31610#(<= 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; {31611#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:45:25,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {31611#(<= 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; {31612#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {31612#(<= 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; {31613#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,364 INFO L290 TraceCheckUtils]: 16: Hoare triple {31613#(<= 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; {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,366 INFO L290 TraceCheckUtils]: 20: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:25,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {31614#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {31615#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {31615#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {31602#false} assume !(~z~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 27: Hoare triple {31602#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 28: Hoare triple {31602#false} assume !(~y~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L272 TraceCheckUtils]: 29: Hoare triple {31602#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {31602#false} ~cond := #in~cond; {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {31602#false} assume 0 == ~cond; {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {31602#false} assume !false; {31602#false} is VALID [2022-04-15 06:45:25,369 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:45:25,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:25,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473475099] [2022-04-15 06:45:25,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473475099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:25,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831794923] [2022-04-15 06:45:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:25,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:25,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:25,371 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:45:25,372 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:45:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:25,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:45:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:25,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:25,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {31601#true} call ULTIMATE.init(); {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {31601#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); {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {31601#true} assume true; {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31601#true} {31601#true} #94#return; {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {31601#true} call #t~ret17 := main(); {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {31601#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {31601#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_505 v_main_~y~0_504)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476)) (.cse2 (mod v_main_~x~0_477 4294967296))) (or (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_159|) (= |v_main_#t~post6_160| |v_main_#t~post6_159|) .cse1) (and .cse0 (= |v_main_#t~post5_159| |v_main_#t~post5_160|) .cse1 (= |v_main_#t~post6_159| |v_main_#t~post6_160|) (<= .cse2 0)) (and (< v_main_~y~0_505 v_main_~y~0_504) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_505 v_it_33 1) v_main_~y~0_504)) (< 0 (mod (+ v_main_~x~0_477 (* 4294967295 v_it_33)) 4294967296)))) (= v_main_~x~0_476 (+ v_main_~x~0_477 v_main_~y~0_505 (* (- 1) v_main_~y~0_504))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_505, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_477, main_#t~post6=|v_main_#t~post6_160|} OutVars{main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_159|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {31601#true} [161] 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[] {31601#true} is VALID [2022-04-15 06:45:25,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {31601#true} ~z~0 := ~y~0; {31644#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:25,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {31644#(= 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; {31648#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {31648#(= 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; {31652#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:45:25,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {31652#(= 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; {31656#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {31656#(= (+ (- 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; {31660#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:45:25,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {31660#(= (+ (- 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; {31664#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-15 06:45:25,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {31664#(= (+ (- 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; {31668#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {31668#(= (+ main_~y~0 (- 5)) (+ 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; {31672#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {31672#(= (+ main_~y~0 (- 6)) (+ 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; {31676#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:45:25,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {31676#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !(~z~0 % 4294967296 > 0); {31676#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-15 06:45:25,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {31676#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31668#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:45:25,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {31668#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31660#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-15 06:45:25,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {31660#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31652#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:45:25,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {31652#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31692#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 06:45:25,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {31692#(and (= main_~z~0 main_~y~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31696#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:45:25,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {31696#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {31696#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-15 06:45:25,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {31696#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {31703#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:45:25,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {31703#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !(~x~0 % 4294967296 > 0); {31703#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 06:45:25,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {31703#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} assume !(~z~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:25,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {31602#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {31602#false} is VALID [2022-04-15 06:45:25,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {31602#false} assume !(~y~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:25,771 INFO L272 TraceCheckUtils]: 29: Hoare triple {31602#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31602#false} is VALID [2022-04-15 06:45:25,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {31602#false} ~cond := #in~cond; {31602#false} is VALID [2022-04-15 06:45:25,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {31602#false} assume 0 == ~cond; {31602#false} is VALID [2022-04-15 06:45:25,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {31602#false} assume !false; {31602#false} is VALID [2022-04-15 06:45:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:45:25,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:26,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {31602#false} assume !false; {31602#false} is VALID [2022-04-15 06:45:26,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {31602#false} assume 0 == ~cond; {31602#false} is VALID [2022-04-15 06:45:26,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {31602#false} ~cond := #in~cond; {31602#false} is VALID [2022-04-15 06:45:26,401 INFO L272 TraceCheckUtils]: 29: Hoare triple {31602#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {31602#false} is VALID [2022-04-15 06:45:26,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {31602#false} assume !(~y~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:26,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {31602#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {31602#false} is VALID [2022-04-15 06:45:26,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {31746#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31602#false} is VALID [2022-04-15 06:45:26,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {31746#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {31746#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:45:26,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {31746#(< 0 (mod main_~z~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {31746#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:45:26,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {31746#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31746#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:45:26,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {31759#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31746#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:45:26,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {31763#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31759#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:45:26,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {31767#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31763#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-15 06:45:26,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {31771#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31767#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:45:26,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {31775#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31771#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:45:26,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {31775#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {31775#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:45:26,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {31782#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 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; {31775#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:45:26,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {31786#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 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; {31782#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:45:26,425 INFO L290 TraceCheckUtils]: 14: Hoare triple {31790#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 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; {31786#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:45:26,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {31794#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 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; {31790#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:45:26,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {31798#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31794#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-15 06:45:26,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {31802#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31798#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:45:26,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {31806#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31802#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:45:26,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {31810#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {31806#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-15 06:45:26,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {31601#true} ~z~0 := ~y~0; {31810#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:45:26,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {31601#true} [161] 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[] {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {31601#true} [162] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_505 v_main_~y~0_504)) (.cse1 (= v_main_~x~0_477 v_main_~x~0_476)) (.cse2 (mod v_main_~x~0_477 4294967296))) (or (and .cse0 (= |v_main_#t~post5_160| |v_main_#t~post5_159|) (= |v_main_#t~post6_160| |v_main_#t~post6_159|) .cse1) (and .cse0 (= |v_main_#t~post5_159| |v_main_#t~post5_160|) .cse1 (= |v_main_#t~post6_159| |v_main_#t~post6_160|) (<= .cse2 0)) (and (< v_main_~y~0_505 v_main_~y~0_504) (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~y~0_505 v_it_33 1) v_main_~y~0_504)) (< 0 (mod (+ v_main_~x~0_477 (* 4294967295 v_it_33)) 4294967296)))) (= v_main_~x~0_476 (+ v_main_~x~0_477 v_main_~y~0_505 (* (- 1) v_main_~y~0_504))) (< 0 .cse2)))) InVars {main_~y~0=v_main_~y~0_505, main_#t~post5=|v_main_#t~post5_160|, main_~x~0=v_main_~x~0_477, main_#t~post6=|v_main_#t~post6_160|} OutVars{main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_476, main_#t~post6=|v_main_#t~post6_159|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {31601#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {31601#true} call #t~ret17 := main(); {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31601#true} {31601#true} #94#return; {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {31601#true} assume true; {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {31601#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); {31601#true} is VALID [2022-04-15 06:45:26,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {31601#true} call ULTIMATE.init(); {31601#true} is VALID [2022-04-15 06:45:26,432 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:45:26,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831794923] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:26,432 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:26,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 16] total 39 [2022-04-15 06:45:26,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:26,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [744385731] [2022-04-15 06:45:26,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [744385731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:26,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:26,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:45:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208300253] [2022-04-15 06:45:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:26,737 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) 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 36 [2022-04-15 06:45:26,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:26,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.6470588235294117) 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:45:26,768 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:45:26,768 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:45:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:45:26,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1657, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:45:26,769 INFO L87 Difference]: Start difference. First operand 138 states and 187 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) 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:45:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:34,252 INFO L93 Difference]: Finished difference Result 417 states and 601 transitions. [2022-04-15 06:45:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:45:34,252 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) 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 36 [2022-04-15 06:45:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) 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:45:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2022-04-15 06:45:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.6470588235294117) 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:45:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 194 transitions. [2022-04-15 06:45:34,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 194 transitions. [2022-04-15 06:45:34,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:34,516 INFO L225 Difference]: With dead ends: 417 [2022-04-15 06:45:34,517 INFO L226 Difference]: Without dead ends: 366 [2022-04-15 06:45:34,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=347, Invalid=3313, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:45:34,518 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 213 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:34,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 87 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:45:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-15 06:45:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 147. [2022-04-15 06:45:35,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:35,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 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:45:35,793 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 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:45:35,793 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 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:45:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:35,798 INFO L93 Difference]: Finished difference Result 366 states and 512 transitions. [2022-04-15 06:45:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 512 transitions. [2022-04-15 06:45:35,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:35,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:35,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 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 366 states. [2022-04-15 06:45:35,799 INFO L87 Difference]: Start difference. First operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 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 366 states. [2022-04-15 06:45:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:35,804 INFO L93 Difference]: Finished difference Result 366 states and 512 transitions. [2022-04-15 06:45:35,804 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 512 transitions. [2022-04-15 06:45:35,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:35,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:35,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:35,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 142 states have internal predecessors, (195), 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:45:35,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 199 transitions. [2022-04-15 06:45:35,806 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 199 transitions. Word has length 36 [2022-04-15 06:45:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:35,807 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 199 transitions. [2022-04-15 06:45:35,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) 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:45:35,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 199 transitions. [2022-04-15 06:45:45,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 197 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:45,961 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 199 transitions. [2022-04-15 06:45:45,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:45:45,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:45:45,962 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:45:45,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 06:45:46,162 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 06:45:46,162 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:45:46,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:45:46,163 INFO L85 PathProgramCache]: Analyzing trace with hash 784665945, now seen corresponding path program 11 times [2022-04-15 06:45:46,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:46,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556627913] [2022-04-15 06:45:46,345 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:45:46,347 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:45:46,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1183802281, now seen corresponding path program 1 times [2022-04-15 06:45:46,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:45:46,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972622715] [2022-04-15 06:45:46,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:45:46,358 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:45:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:46,372 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:45:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:45:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:46,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {33752#(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); {33740#true} is VALID [2022-04-15 06:45:46,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {33740#true} assume true; {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33740#true} {33740#true} #94#return; {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {33740#true} call ULTIMATE.init(); {33752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:45:46,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {33752#(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); {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {33740#true} assume true; {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33740#true} {33740#true} #94#return; {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {33740#true} call #t~ret17 := main(); {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {33740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33740#true} is VALID [2022-04-15 06:45:46,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {33740#true} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_497 4294967296)) (.cse1 (= v_main_~x~0_497 v_main_~x~0_496)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_497 v_main_~y~0_528 (* v_main_~x~0_496 (- 1))) v_main_~y~0_527) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~x~0_496 v_it_34 1) v_main_~x~0_497)))) (< 0 .cse0) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {33740#true} [163] 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[] {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {33740#true} ~z~0 := ~y~0; {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {33740#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {33740#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {33740#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {33740#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {33740#true} assume !(~z~0 % 4294967296 > 0); {33740#true} is VALID [2022-04-15 06:45:46,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {33740#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33740#true} is VALID [2022-04-15 06:45:46,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {33740#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:45:46,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33746#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:45:46,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {33746#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33740#true} is VALID [2022-04-15 06:45:46,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {33740#true} assume !(~y~0 % 4294967296 > 0); {33747#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-15 06:45:46,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {33747#(<= (* (div (+ main_~y~0 4294967295) 4294967296) 4294967296) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33748#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:45:46,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {33748#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33749#(<= (+ 2 (* (div (+ main_~y~0 4294967293) 4294967296) 4294967296)) main_~y~0)} is VALID [2022-04-15 06:45:46,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {33749#(<= (+ 2 (* (div (+ main_~y~0 4294967293) 4294967296) 4294967296)) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33750#(<= (+ (* (div (+ 4294967292 main_~y~0) 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-15 06:45:46,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {33750#(<= (+ (* (div (+ 4294967292 main_~y~0) 4294967296) 4294967296) 3) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~x~0 % 4294967296 > 0); {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,486 INFO L290 TraceCheckUtils]: 24: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,486 INFO L290 TraceCheckUtils]: 25: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} is VALID [2022-04-15 06:45:46,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {33751#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {33741#false} is VALID [2022-04-15 06:45:46,488 INFO L272 TraceCheckUtils]: 30: Hoare triple {33741#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33741#false} is VALID [2022-04-15 06:45:46,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {33741#false} ~cond := #in~cond; {33741#false} is VALID [2022-04-15 06:45:46,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {33741#false} assume 0 == ~cond; {33741#false} is VALID [2022-04-15 06:45:46,488 INFO L290 TraceCheckUtils]: 33: Hoare triple {33741#false} assume !false; {33741#false} is VALID [2022-04-15 06:45:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-15 06:45:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:45:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972622715] [2022-04-15 06:45:46,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972622715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:45:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516614503] [2022-04-15 06:45:46,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:45:46,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:45:46,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:45:46,489 INFO L229 MonitoredProcess]: Starting monitored process 33 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:45:46,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 06:45:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:46,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:45:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:45:46,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:45:46,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {33740#true} call ULTIMATE.init(); {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {33740#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); {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {33740#true} assume true; {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33740#true} {33740#true} #94#return; {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {33740#true} call #t~ret17 := main(); {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {33740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {33740#true} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_497 4294967296)) (.cse1 (= v_main_~x~0_497 v_main_~x~0_496)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_497 v_main_~y~0_528 (* v_main_~x~0_496 (- 1))) v_main_~y~0_527) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~x~0_496 v_it_34 1) v_main_~x~0_497)))) (< 0 .cse0) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33740#true} is VALID [2022-04-15 06:45:46,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {33740#true} [163] 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[] {33740#true} is VALID [2022-04-15 06:45:46,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {33740#true} ~z~0 := ~y~0; {33780#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:45:46,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {33780#(= 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {33784#(< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {33784#(< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {33784#(< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:45:46,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:45:46,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:45:46,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:45:46,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {33741#false} is VALID [2022-04-15 06:45:46,732 INFO L272 TraceCheckUtils]: 30: Hoare triple {33741#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33741#false} is VALID [2022-04-15 06:45:46,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {33741#false} ~cond := #in~cond; {33741#false} is VALID [2022-04-15 06:45:46,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {33741#false} assume 0 == ~cond; {33741#false} is VALID [2022-04-15 06:45:46,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {33741#false} assume !false; {33741#false} is VALID [2022-04-15 06:45:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:45:46,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:45:46,873 INFO L290 TraceCheckUtils]: 33: Hoare triple {33741#false} assume !false; {33741#false} is VALID [2022-04-15 06:45:46,873 INFO L290 TraceCheckUtils]: 32: Hoare triple {33741#false} assume 0 == ~cond; {33741#false} is VALID [2022-04-15 06:45:46,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {33741#false} ~cond := #in~cond; {33741#false} is VALID [2022-04-15 06:45:46,873 INFO L272 TraceCheckUtils]: 30: Hoare triple {33741#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {33741#false} is VALID [2022-04-15 06:45:46,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {33741#false} is VALID [2022-04-15 06:45:46,874 INFO L290 TraceCheckUtils]: 28: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:45:46,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:45:46,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33811#(<= main_~y~0 (+ 4294967291 (* (div (+ main_~y~0 3) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33807#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:45:46,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33803#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:45:46,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33745#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:45:46,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {33784#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {33784#(< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {33784#(< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {33784#(< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {33932#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod 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; {33784#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:45:46,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {33740#true} ~z~0 := ~y~0; {33932#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:45:46,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {33740#true} [163] 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[] {33740#true} is VALID [2022-04-15 06:45:46,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {33740#true} [164] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_497 4294967296)) (.cse1 (= v_main_~x~0_497 v_main_~x~0_496)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_497 v_main_~y~0_528 (* v_main_~x~0_496 (- 1))) v_main_~y~0_527) (forall ((v_it_34 Int)) (or (not (<= 1 v_it_34)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_34)) 4294967296)) (not (<= (+ v_main_~x~0_496 v_it_34 1) v_main_~x~0_497)))) (< 0 .cse0) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {33740#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {33740#true} call #t~ret17 := main(); {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33740#true} {33740#true} #94#return; {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {33740#true} assume true; {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {33740#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); {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {33740#true} call ULTIMATE.init(); {33740#true} is VALID [2022-04-15 06:45:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:45:46,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516614503] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:45:46,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:45:46,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 16 [2022-04-15 06:45:47,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:45:47,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556627913] [2022-04-15 06:45:47,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556627913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:45:47,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:45:47,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:45:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923874315] [2022-04-15 06:45:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:45:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 37 [2022-04-15 06:45:47,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:45:47,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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:45:47,047 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:45:47,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:45:47,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:45:47,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:45:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:45:47,048 INFO L87 Difference]: Start difference. First operand 147 states and 199 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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:45:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:53,773 INFO L93 Difference]: Finished difference Result 356 states and 488 transitions. [2022-04-15 06:45:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 06:45:53,774 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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 37 [2022-04-15 06:45:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:45:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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:45:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 212 transitions. [2022-04-15 06:45:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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:45:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 212 transitions. [2022-04-15 06:45:53,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 212 transitions. [2022-04-15 06:45:54,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:45:54,178 INFO L225 Difference]: With dead ends: 356 [2022-04-15 06:45:54,178 INFO L226 Difference]: Without dead ends: 351 [2022-04-15 06:45:54,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=744, Invalid=2916, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:45:54,179 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 225 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:45:54,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 53 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:45:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-15 06:45:55,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 179. [2022-04-15 06:45:55,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:45:55,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 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:45:55,864 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 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:45:55,864 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 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:45:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:55,868 INFO L93 Difference]: Finished difference Result 351 states and 472 transitions. [2022-04-15 06:45:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 472 transitions. [2022-04-15 06:45:55,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:55,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:55,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 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 351 states. [2022-04-15 06:45:55,869 INFO L87 Difference]: Start difference. First operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 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 351 states. [2022-04-15 06:45:55,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:45:55,874 INFO L93 Difference]: Finished difference Result 351 states and 472 transitions. [2022-04-15 06:45:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 472 transitions. [2022-04-15 06:45:55,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:45:55,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:45:55,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:45:55,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:45:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 174 states have (on average 1.367816091954023) internal successors, (238), 174 states have internal predecessors, (238), 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:45:55,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 242 transitions. [2022-04-15 06:45:55,877 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 242 transitions. Word has length 37 [2022-04-15 06:45:55,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:45:55,877 INFO L478 AbstractCegarLoop]: Abstraction has 179 states and 242 transitions. [2022-04-15 06:45:55,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 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:45:55,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 242 transitions. [2022-04-15 06:46:10,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 239 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 242 transitions. [2022-04-15 06:46:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 06:46:10,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:10,120 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:10,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 06:46:10,320 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 06:46:10,320 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:10,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:10,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1529476664, now seen corresponding path program 11 times [2022-04-15 06:46:10,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:10,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85545444] [2022-04-15 06:46:10,485 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:10,487 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:10,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2084189946, now seen corresponding path program 1 times [2022-04-15 06:46:10,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:10,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063137748] [2022-04-15 06:46:10,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:10,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:10,505 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:10,519 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_35.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:10,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:10,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {35857#(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); {35842#true} is VALID [2022-04-15 06:46:10,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {35842#true} assume true; {35842#true} is VALID [2022-04-15 06:46:10,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35842#true} {35842#true} #94#return; {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {35842#true} call ULTIMATE.init(); {35857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:10,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {35857#(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); {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {35842#true} assume true; {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35842#true} {35842#true} #94#return; {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {35842#true} call #t~ret17 := main(); {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {35842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {35842#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_170| |v_main_#t~post6_169|)) (.cse1 (= |v_main_#t~post5_170| |v_main_#t~post5_169|)) (.cse3 (= v_main_~x~0_519 v_main_~x~0_518)) (.cse4 (= v_main_~y~0_554 v_main_~y~0_553)) (.cse2 (mod v_main_~x~0_519 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_518 v_it_35 1) v_main_~x~0_519)) (< 0 (mod (+ v_main_~x~0_519 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (= v_main_~y~0_553 (+ v_main_~x~0_519 v_main_~y~0_554 (* v_main_~x~0_518 (- 1)))) (< 0 .cse2) (< v_main_~x~0_518 v_main_~x~0_519)))) InVars {main_~y~0=v_main_~y~0_554, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_519, main_#t~post6=|v_main_#t~post6_170|} OutVars{main_~y~0=v_main_~y~0_553, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_518, main_#t~post6=|v_main_#t~post6_169|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {35842#true} [165] 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[] {35842#true} is VALID [2022-04-15 06:46:10,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {35842#true} ~z~0 := ~y~0; {35842#true} is VALID [2022-04-15 06:46:10,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {35842#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35847#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:10,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {35847#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {35848#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:10,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {35848#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 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; {35849#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:10,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {35849#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {35850#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:10,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {35850#(<= main_~z~0 (+ 4294967291 (* (div main_~z~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; {35851#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:10,649 INFO L290 TraceCheckUtils]: 14: Hoare triple {35851#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35851#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:10,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {35851#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35852#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:46:10,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {35852#(<= main_~z~0 (+ 4294967291 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35853#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:46:10,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {35853#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35854#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:10,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {35854#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35855#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:46:10,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {35855#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:46:10,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {35856#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {35843#false} is VALID [2022-04-15 06:46:10,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {35843#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35843#false} is VALID [2022-04-15 06:46:10,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {35843#false} assume !(~y~0 % 4294967296 > 0); {35843#false} is VALID [2022-04-15 06:46:10,657 INFO L272 TraceCheckUtils]: 30: Hoare triple {35843#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35843#false} is VALID [2022-04-15 06:46:10,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {35843#false} ~cond := #in~cond; {35843#false} is VALID [2022-04-15 06:46:10,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {35843#false} assume 0 == ~cond; {35843#false} is VALID [2022-04-15 06:46:10,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {35843#false} assume !false; {35843#false} is VALID [2022-04-15 06:46:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:46:10,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063137748] [2022-04-15 06:46:10,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063137748] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:10,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1082477412] [2022-04-15 06:46:10,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:10,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:10,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:10,659 INFO L229 MonitoredProcess]: Starting monitored process 34 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:10,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 06:46:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:10,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:46:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:10,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:10,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {35842#true} call ULTIMATE.init(); {35842#true} is VALID [2022-04-15 06:46:10,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {35842#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); {35842#true} is VALID [2022-04-15 06:46:10,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {35842#true} assume true; {35842#true} is VALID [2022-04-15 06:46:10,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35842#true} {35842#true} #94#return; {35842#true} is VALID [2022-04-15 06:46:10,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {35842#true} call #t~ret17 := main(); {35842#true} is VALID [2022-04-15 06:46:10,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {35842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35842#true} is VALID [2022-04-15 06:46:10,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {35842#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_170| |v_main_#t~post6_169|)) (.cse1 (= |v_main_#t~post5_170| |v_main_#t~post5_169|)) (.cse3 (= v_main_~x~0_519 v_main_~x~0_518)) (.cse4 (= v_main_~y~0_554 v_main_~y~0_553)) (.cse2 (mod v_main_~x~0_519 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_518 v_it_35 1) v_main_~x~0_519)) (< 0 (mod (+ v_main_~x~0_519 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (= v_main_~y~0_553 (+ v_main_~x~0_519 v_main_~y~0_554 (* v_main_~x~0_518 (- 1)))) (< 0 .cse2) (< v_main_~x~0_518 v_main_~x~0_519)))) InVars {main_~y~0=v_main_~y~0_554, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_519, main_#t~post6=|v_main_#t~post6_170|} OutVars{main_~y~0=v_main_~y~0_553, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_518, main_#t~post6=|v_main_#t~post6_169|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35842#true} is VALID [2022-04-15 06:46:10,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {35842#true} [165] 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[] {35842#true} is VALID [2022-04-15 06:46:10,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {35842#true} ~z~0 := ~y~0; {35885#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:46:10,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {35885#(= 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; {35889#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:46:10,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {35889#(= 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; {35893#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:46:10,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {35893#(= 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; {35897#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:46:10,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {35897#(= 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; {35901#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-15 06:46:10,991 INFO L290 TraceCheckUtils]: 13: Hoare triple {35901#(= 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; {35905#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:46:10,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {35905#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {35905#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:46:10,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {35905#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35897#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:46:10,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {35897#(= main_~y~0 (+ main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35889#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:46:10,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {35889#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35918#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:46:10,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {35918#(= main_~z~0 (+ main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35922#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-15 06:46:10,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {35922#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {35926#(= (+ 5 main_~y~0) main_~z~0)} is VALID [2022-04-15 06:46:10,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {35926#(= (+ 5 main_~y~0) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {35926#(= (+ 5 main_~y~0) main_~z~0)} is VALID [2022-04-15 06:46:10,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {35926#(= (+ 5 main_~y~0) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35933#(= main_~z~0 (+ main_~y~0 4))} is VALID [2022-04-15 06:46:10,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {35933#(= main_~z~0 (+ main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35922#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} is VALID [2022-04-15 06:46:10,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {35922#(= (+ main_~y~0 2) (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35940#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:46:10,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {35940#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35918#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-15 06:46:10,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {35918#(= main_~z~0 (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35885#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:46:10,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {35885#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {35885#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:46:10,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {35885#(= main_~z~0 main_~y~0)} assume !(~z~0 % 4294967296 > 0); {35953#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:46:10,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {35953#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35843#false} is VALID [2022-04-15 06:46:10,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {35843#false} assume !(~y~0 % 4294967296 > 0); {35843#false} is VALID [2022-04-15 06:46:10,998 INFO L272 TraceCheckUtils]: 30: Hoare triple {35843#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35843#false} is VALID [2022-04-15 06:46:10,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {35843#false} ~cond := #in~cond; {35843#false} is VALID [2022-04-15 06:46:10,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {35843#false} assume 0 == ~cond; {35843#false} is VALID [2022-04-15 06:46:10,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {35843#false} assume !false; {35843#false} is VALID [2022-04-15 06:46:10,998 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:10,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:11,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {35843#false} assume !false; {35843#false} is VALID [2022-04-15 06:46:11,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {35843#false} assume 0 == ~cond; {35843#false} is VALID [2022-04-15 06:46:11,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {35843#false} ~cond := #in~cond; {35843#false} is VALID [2022-04-15 06:46:11,584 INFO L272 TraceCheckUtils]: 30: Hoare triple {35843#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {35843#false} is VALID [2022-04-15 06:46:11,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {35843#false} assume !(~y~0 % 4294967296 > 0); {35843#false} is VALID [2022-04-15 06:46:11,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {35953#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {35843#false} is VALID [2022-04-15 06:46:11,585 INFO L290 TraceCheckUtils]: 27: Hoare triple {35990#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {35953#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:46:11,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {35990#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {35990#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:46:11,586 INFO L290 TraceCheckUtils]: 25: Hoare triple {35997#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35990#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:46:11,586 INFO L290 TraceCheckUtils]: 24: Hoare triple {36001#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {35997#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 1) 4294967296))))} is VALID [2022-04-15 06:46:11,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {36005#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36001#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 2) 4294967296))))} is VALID [2022-04-15 06:46:11,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {36009#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36005#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:46:11,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {36013#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {36009#(or (not (< 0 (mod (+ main_~y~0 4) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:46:11,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {36013#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36013#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:46:11,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {36020#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36013#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 5 main_~y~0) 4294967296))))} is VALID [2022-04-15 06:46:11,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {36024#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod (+ main_~z~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36020#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4) 4294967296))))} is VALID [2022-04-15 06:46:11,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {36028#(or (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36024#(or (not (< 0 (mod (+ main_~y~0 3) 4294967296))) (< 0 (mod (+ main_~z~0 2) 4294967296)))} is VALID [2022-04-15 06:46:11,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {36032#(or (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36028#(or (not (< 0 (mod (+ main_~y~0 2) 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:46:11,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {36036#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36032#(or (not (< 0 (mod (+ main_~y~0 1) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:46:11,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {36036#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {36036#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:46:11,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {36043#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 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; {36036#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-15 06:46:11,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {36047#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 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; {36043#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:46:11,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {36051#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod 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; {36047#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:46:11,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {36055#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 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; {36051#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod main_~y~0 4294967296))))} is VALID [2022-04-15 06:46:11,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {35990#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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; {36055#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-15 06:46:11,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {35842#true} ~z~0 := ~y~0; {35990#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-15 06:46:11,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {35842#true} [165] 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[] {35842#true} is VALID [2022-04-15 06:46:11,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {35842#true} [166] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_170| |v_main_#t~post6_169|)) (.cse1 (= |v_main_#t~post5_170| |v_main_#t~post5_169|)) (.cse3 (= v_main_~x~0_519 v_main_~x~0_518)) (.cse4 (= v_main_~y~0_554 v_main_~y~0_553)) (.cse2 (mod v_main_~x~0_519 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_518 v_it_35 1) v_main_~x~0_519)) (< 0 (mod (+ v_main_~x~0_519 (* 4294967295 v_it_35)) 4294967296)) (not (<= 1 v_it_35)))) (= v_main_~y~0_553 (+ v_main_~x~0_519 v_main_~y~0_554 (* v_main_~x~0_518 (- 1)))) (< 0 .cse2) (< v_main_~x~0_518 v_main_~x~0_519)))) InVars {main_~y~0=v_main_~y~0_554, main_#t~post5=|v_main_#t~post5_170|, main_~x~0=v_main_~x~0_519, main_#t~post6=|v_main_#t~post6_170|} OutVars{main_~y~0=v_main_~y~0_553, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_518, main_#t~post6=|v_main_#t~post6_169|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35842#true} is VALID [2022-04-15 06:46:11,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {35842#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35842#true} is VALID [2022-04-15 06:46:11,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {35842#true} call #t~ret17 := main(); {35842#true} is VALID [2022-04-15 06:46:11,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35842#true} {35842#true} #94#return; {35842#true} is VALID [2022-04-15 06:46:11,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {35842#true} assume true; {35842#true} is VALID [2022-04-15 06:46:11,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {35842#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); {35842#true} is VALID [2022-04-15 06:46:11,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {35842#true} call ULTIMATE.init(); {35842#true} is VALID [2022-04-15 06:46:11,599 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:46:11,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1082477412] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:11,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:11,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 18] total 40 [2022-04-15 06:46:11,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:11,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [85545444] [2022-04-15 06:46:11,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [85545444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:11,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:11,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 06:46:11,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545902012] [2022-04-15 06:46:11,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:11,846 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 37 [2022-04-15 06:46:11,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:11,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:46:11,876 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:46:11,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 06:46:11,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:11,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 06:46:11,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1681, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:46:11,877 INFO L87 Difference]: Start difference. First operand 179 states and 242 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:46:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:17,270 INFO L93 Difference]: Finished difference Result 319 states and 439 transitions. [2022-04-15 06:46:17,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 06:46:17,270 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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 37 [2022-04-15 06:46:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:46:17,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2022-04-15 06:46:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:46:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 109 transitions. [2022-04-15 06:46:17,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 109 transitions. [2022-04-15 06:46:17,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:17,465 INFO L225 Difference]: With dead ends: 319 [2022-04-15 06:46:17,465 INFO L226 Difference]: Without dead ends: 302 [2022-04-15 06:46:17,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=782, Invalid=4768, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:46:17,467 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 88 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:17,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 43 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:46:17,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-04-15 06:46:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 216. [2022-04-15 06:46:19,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:19,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 302 states. Second operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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:19,486 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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:19,486 INFO L87 Difference]: Start difference. First operand 302 states. Second operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:19,489 INFO L93 Difference]: Finished difference Result 302 states and 393 transitions. [2022-04-15 06:46:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2022-04-15 06:46:19,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:19,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:19,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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 302 states. [2022-04-15 06:46:19,490 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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 302 states. [2022-04-15 06:46:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:19,493 INFO L93 Difference]: Finished difference Result 302 states and 393 transitions. [2022-04-15 06:46:19,493 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2022-04-15 06:46:19,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:19,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:19,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:19,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.3696682464454977) internal successors, (289), 211 states have internal predecessors, (289), 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:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 293 transitions. [2022-04-15 06:46:19,496 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 293 transitions. Word has length 37 [2022-04-15 06:46:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:19,497 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 293 transitions. [2022-04-15 06:46:19,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 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:46:19,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 293 transitions. [2022-04-15 06:46:31,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 291 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 293 transitions. [2022-04-15 06:46:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:46:31,529 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:31,529 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:31,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 06:46:31,729 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:46:31,730 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1410664363, now seen corresponding path program 8 times [2022-04-15 06:46:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:31,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42570647] [2022-04-15 06:46:31,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:46:31,893 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:31,895 INFO L85 PathProgramCache]: Analyzing trace with hash -550176617, now seen corresponding path program 1 times [2022-04-15 06:46:31,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:31,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511859105] [2022-04-15 06:46:31,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:31,906 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:31,923 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:32,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {37841#(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); {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {37829#true} assume true; {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37829#true} {37829#true} #94#return; {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {37829#true} call ULTIMATE.init(); {37841#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:32,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {37841#(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); {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {37829#true} assume true; {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37829#true} {37829#true} #94#return; {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {37829#true} call #t~ret17 := main(); {37829#true} is VALID [2022-04-15 06:46:32,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {37829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {37829#true} [168] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_540 4294967296)) (.cse0 (= v_main_~y~0_585 v_main_~y~0_584)) (.cse2 (= |v_main_#t~post6_175| |v_main_#t~post6_174|)) (.cse3 (= |v_main_#t~post5_175| |v_main_#t~post5_174|))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~x~0_539 v_main_~x~0_540)) (and (< v_main_~x~0_539 v_main_~x~0_540) (= v_main_~y~0_584 (+ v_main_~x~0_540 v_main_~y~0_585 (* v_main_~x~0_539 (- 1)))) (< 0 .cse1) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_540 (* 4294967295 v_it_36)) 4294967296)) (not (<= 1 v_it_36)) (not (<= (+ v_main_~x~0_539 v_it_36 1) v_main_~x~0_540))))) (and .cse0 .cse2 .cse3 (= v_main_~x~0_540 v_main_~x~0_539)))) InVars {main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_175|, main_~x~0=v_main_~x~0_540, main_#t~post6=|v_main_#t~post6_175|} OutVars{main_~y~0=v_main_~y~0_584, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_174|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {37829#true} [167] 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[] {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {37829#true} ~z~0 := ~y~0; {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {37829#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {37829#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {37829#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {37829#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {37829#true} assume !(~z~0 % 4294967296 > 0); {37829#true} is VALID [2022-04-15 06:46:32,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {37829#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37829#true} is VALID [2022-04-15 06:46:32,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {37829#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:46:32,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37835#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:32,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {37835#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37836#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-15 06:46:32,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {37836#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {37836#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} is VALID [2022-04-15 06:46:32,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {37836#(<= (* (div (+ main_~y~0 3) 4294967296) 4294967296) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37837#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-15 06:46:32,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {37837#(<= (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) 1) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37838#(<= (+ 2 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) main_~y~0)} is VALID [2022-04-15 06:46:32,026 INFO L290 TraceCheckUtils]: 21: Hoare triple {37838#(<= (+ 2 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37839#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-15 06:46:32,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {37839#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-15 06:46:32,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {37840#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 4) main_~y~0))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {37839#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} is VALID [2022-04-15 06:46:32,031 INFO L290 TraceCheckUtils]: 30: Hoare triple {37839#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 3) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {37830#false} is VALID [2022-04-15 06:46:32,031 INFO L272 TraceCheckUtils]: 31: Hoare triple {37830#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37830#false} is VALID [2022-04-15 06:46:32,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {37830#false} ~cond := #in~cond; {37830#false} is VALID [2022-04-15 06:46:32,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {37830#false} assume 0 == ~cond; {37830#false} is VALID [2022-04-15 06:46:32,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {37830#false} assume !false; {37830#false} is VALID [2022-04-15 06:46:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 06:46:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511859105] [2022-04-15 06:46:32,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511859105] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811246348] [2022-04-15 06:46:32,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:32,033 INFO L229 MonitoredProcess]: Starting monitored process 35 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,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 06:46:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:46:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:32,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:32,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {37829#true} call ULTIMATE.init(); {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {37829#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); {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {37829#true} assume true; {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37829#true} {37829#true} #94#return; {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {37829#true} call #t~ret17 := main(); {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {37829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {37829#true} [168] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_540 4294967296)) (.cse0 (= v_main_~y~0_585 v_main_~y~0_584)) (.cse2 (= |v_main_#t~post6_175| |v_main_#t~post6_174|)) (.cse3 (= |v_main_#t~post5_175| |v_main_#t~post5_174|))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~x~0_539 v_main_~x~0_540)) (and (< v_main_~x~0_539 v_main_~x~0_540) (= v_main_~y~0_584 (+ v_main_~x~0_540 v_main_~y~0_585 (* v_main_~x~0_539 (- 1)))) (< 0 .cse1) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_540 (* 4294967295 v_it_36)) 4294967296)) (not (<= 1 v_it_36)) (not (<= (+ v_main_~x~0_539 v_it_36 1) v_main_~x~0_540))))) (and .cse0 .cse2 .cse3 (= v_main_~x~0_540 v_main_~x~0_539)))) InVars {main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_175|, main_~x~0=v_main_~x~0_540, main_#t~post6=|v_main_#t~post6_175|} OutVars{main_~y~0=v_main_~y~0_584, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_174|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {37829#true} [167] 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[] {37829#true} is VALID [2022-04-15 06:46:32,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {37829#true} ~z~0 := ~y~0; {37869#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:46:32,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {37869#(= 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; {37873#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:46:32,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {37873#(= 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; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {37877#(< 0 (mod (+ main_~y~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; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {37877#(< 0 (mod (+ main_~y~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; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:32,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {37890#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:46:32,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:32,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:32,276 INFO L290 TraceCheckUtils]: 20: Hoare triple {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:46:32,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:32,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {37890#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,280 INFO L290 TraceCheckUtils]: 29: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {37890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:32,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {37890#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {37830#false} is VALID [2022-04-15 06:46:32,280 INFO L272 TraceCheckUtils]: 31: Hoare triple {37830#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37830#false} is VALID [2022-04-15 06:46:32,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {37830#false} ~cond := #in~cond; {37830#false} is VALID [2022-04-15 06:46:32,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {37830#false} assume 0 == ~cond; {37830#false} is VALID [2022-04-15 06:46:32,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {37830#false} assume !false; {37830#false} is VALID [2022-04-15 06:46:32,287 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 06:46:32,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:32,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {37830#false} assume !false; {37830#false} is VALID [2022-04-15 06:46:32,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {37830#false} assume 0 == ~cond; {37830#false} is VALID [2022-04-15 06:46:32,482 INFO L290 TraceCheckUtils]: 32: Hoare triple {37830#false} ~cond := #in~cond; {37830#false} is VALID [2022-04-15 06:46:32,482 INFO L272 TraceCheckUtils]: 31: Hoare triple {37830#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {37830#false} is VALID [2022-04-15 06:46:32,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {37890#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {37830#false} is VALID [2022-04-15 06:46:32,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {37890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:32,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {37890#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:32,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:46:32,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:32,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37901#(<= main_~y~0 (+ 4294967292 (* (div (+ main_~y~0 2) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:32,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37897#(<= main_~y~0 (+ (* (div (+ main_~y~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:46:32,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {37890#(< 0 (mod main_~y~0 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37834#(<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:46:32,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37890#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:32,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {37877#(< 0 (mod (+ main_~y~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; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {37877#(< 0 (mod (+ main_~y~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; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {38025#(or (< 0 (mod (+ main_~y~0 4294967295) 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; {37877#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:32,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {38029#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~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; {38025#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 06:46:32,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {37829#true} ~z~0 := ~y~0; {38029#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:46:32,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {37829#true} [167] 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[] {37829#true} is VALID [2022-04-15 06:46:32,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {37829#true} [168] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_540 4294967296)) (.cse0 (= v_main_~y~0_585 v_main_~y~0_584)) (.cse2 (= |v_main_#t~post6_175| |v_main_#t~post6_174|)) (.cse3 (= |v_main_#t~post5_175| |v_main_#t~post5_174|))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~x~0_539 v_main_~x~0_540)) (and (< v_main_~x~0_539 v_main_~x~0_540) (= v_main_~y~0_584 (+ v_main_~x~0_540 v_main_~y~0_585 (* v_main_~x~0_539 (- 1)))) (< 0 .cse1) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_540 (* 4294967295 v_it_36)) 4294967296)) (not (<= 1 v_it_36)) (not (<= (+ v_main_~x~0_539 v_it_36 1) v_main_~x~0_540))))) (and .cse0 .cse2 .cse3 (= v_main_~x~0_540 v_main_~x~0_539)))) InVars {main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_175|, main_~x~0=v_main_~x~0_540, main_#t~post6=|v_main_#t~post6_175|} OutVars{main_~y~0=v_main_~y~0_584, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_174|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37829#true} is VALID [2022-04-15 06:46:32,494 INFO L290 TraceCheckUtils]: 5: Hoare triple {37829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37829#true} is VALID [2022-04-15 06:46:32,494 INFO L272 TraceCheckUtils]: 4: Hoare triple {37829#true} call #t~ret17 := main(); {37829#true} is VALID [2022-04-15 06:46:32,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37829#true} {37829#true} #94#return; {37829#true} is VALID [2022-04-15 06:46:32,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {37829#true} assume true; {37829#true} is VALID [2022-04-15 06:46:32,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {37829#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); {37829#true} is VALID [2022-04-15 06:46:32,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {37829#true} call ULTIMATE.init(); {37829#true} is VALID [2022-04-15 06:46:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 06:46:32,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811246348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:32,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:32,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 06:46:32,703 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:32,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42570647] [2022-04-15 06:46:32,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42570647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:32,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:32,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:46:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849756863] [2022-04-15 06:46:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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 38 [2022-04-15 06:46:32,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:32,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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:46:32,730 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:46:32,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:46:32,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:32,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:46:32,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-04-15 06:46:32,731 INFO L87 Difference]: Start difference. First operand 216 states and 293 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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:46:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:39,917 INFO L93 Difference]: Finished difference Result 388 states and 499 transitions. [2022-04-15 06:46:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:46:39,917 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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 38 [2022-04-15 06:46:39,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:46:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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:46:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 158 transitions. [2022-04-15 06:46:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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:46:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 158 transitions. [2022-04-15 06:46:39,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 158 transitions. [2022-04-15 06:46:40,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:40,228 INFO L225 Difference]: With dead ends: 388 [2022-04-15 06:46:40,228 INFO L226 Difference]: Without dead ends: 383 [2022-04-15 06:46:40,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=580, Invalid=2612, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:46:40,229 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 78 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:46:40,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 68 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:46:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-04-15 06:46:42,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 229. [2022-04-15 06:46:42,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:46:42,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states. Second operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 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:42,695 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states. Second operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 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:42,695 INFO L87 Difference]: Start difference. First operand 383 states. Second operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 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:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:42,700 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-15 06:46:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-15 06:46:42,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:42,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:42,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 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 383 states. [2022-04-15 06:46:42,701 INFO L87 Difference]: Start difference. First operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 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 383 states. [2022-04-15 06:46:42,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:46:42,706 INFO L93 Difference]: Finished difference Result 383 states and 489 transitions. [2022-04-15 06:46:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 489 transitions. [2022-04-15 06:46:42,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:46:42,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:46:42,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:46:42,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:46:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 224 states have (on average 1.3526785714285714) internal successors, (303), 224 states have internal predecessors, (303), 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:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 307 transitions. [2022-04-15 06:46:42,710 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 307 transitions. Word has length 38 [2022-04-15 06:46:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:46:42,710 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 307 transitions. [2022-04-15 06:46:42,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 13 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:46:42,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 229 states and 307 transitions. [2022-04-15 06:46:58,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 305 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 06:46:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 307 transitions. [2022-04-15 06:46:58,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:46:58,220 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:46:58,221 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:46:58,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-15 06:46:58,421 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:46:58,421 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:46:58,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:46:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 899157845, now seen corresponding path program 12 times [2022-04-15 06:46:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:58,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [613846869] [2022-04-15 06:46:58,626 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:58,628 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:46:58,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1658591401, now seen corresponding path program 1 times [2022-04-15 06:46:58,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:46:58,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612201370] [2022-04-15 06:46:58,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:58,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:46:58,640 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:58,659 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_37.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:46:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:46:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:58,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {40166#(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); {40149#true} is VALID [2022-04-15 06:46:58,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {40149#true} assume true; {40149#true} is VALID [2022-04-15 06:46:58,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40149#true} {40149#true} #94#return; {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {40149#true} call ULTIMATE.init(); {40166#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:46:58,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {40166#(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); {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {40149#true} assume true; {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40149#true} {40149#true} #94#return; {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {40149#true} call #t~ret17 := main(); {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {40149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {40149#true} [170] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_563 4294967296)) (.cse1 (= v_main_~x~0_563 v_main_~x~0_562)) (.cse2 (= v_main_~y~0_613 v_main_~y~0_612))) (or (and (< 0 .cse0) (< v_main_~x~0_562 v_main_~x~0_563) (forall ((v_it_37 Int)) (or (< 0 (mod (+ v_main_~x~0_563 (* 4294967295 v_it_37)) 4294967296)) (not (<= 1 v_it_37)) (not (<= (+ v_main_~x~0_562 v_it_37 1) v_main_~x~0_563)))) (= v_main_~y~0_612 (+ v_main_~x~0_563 (* v_main_~x~0_562 (- 1)) v_main_~y~0_613))) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_180|) (= |v_main_#t~post6_179| |v_main_#t~post6_180|)) (and (= |v_main_#t~post6_180| |v_main_#t~post6_179|) .cse1 .cse2 (= |v_main_#t~post5_180| |v_main_#t~post5_179|)))) InVars {main_~y~0=v_main_~y~0_613, main_#t~post5=|v_main_#t~post5_180|, main_~x~0=v_main_~x~0_563, main_#t~post6=|v_main_#t~post6_180|} OutVars{main_~y~0=v_main_~y~0_612, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_562, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40149#true} is VALID [2022-04-15 06:46:58,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {40149#true} [169] 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[] {40149#true} is VALID [2022-04-15 06:46:58,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {40149#true} ~z~0 := ~y~0; {40154#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:46:58,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {40154#(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; {40155#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:58,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {40155#(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; {40156#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:46:58,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {40156#(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; {40157#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:46:58,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {40157#(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; {40158#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:46:58,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {40158#(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; {40159#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:46:58,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {40159#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {40160#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:46:58,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {40160#(and (<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 5 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40161#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:58,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {40161#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40162#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:58,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {40162#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40163#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:46:58,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {40163#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40164#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:46:58,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {40164#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40165#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:46:58,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {40165#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40150#false} is VALID [2022-04-15 06:46:58,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {40150#false} assume !(~y~0 % 4294967296 > 0); {40150#false} is VALID [2022-04-15 06:46:58,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {40150#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40150#false} is VALID [2022-04-15 06:46:58,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {40150#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {40150#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {40150#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {40150#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {40150#false} assume !(~x~0 % 4294967296 > 0); {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {40150#false} assume !(~z~0 % 4294967296 > 0); {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {40150#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {40150#false} assume !(~y~0 % 4294967296 > 0); {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L272 TraceCheckUtils]: 31: Hoare triple {40150#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {40150#false} ~cond := #in~cond; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {40150#false} assume 0 == ~cond; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {40150#false} assume !false; {40150#false} is VALID [2022-04-15 06:46:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 06:46:58,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:46:58,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612201370] [2022-04-15 06:46:58,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612201370] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:46:58,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11168676] [2022-04-15 06:46:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:46:58,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:46:58,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:46:58,864 INFO L229 MonitoredProcess]: Starting monitored process 36 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:58,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 06:46:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:58,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:46:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:46:58,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:46:59,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {40149#true} call ULTIMATE.init(); {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {40149#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); {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {40149#true} assume true; {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40149#true} {40149#true} #94#return; {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {40149#true} call #t~ret17 := main(); {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {40149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {40149#true} [170] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_563 4294967296)) (.cse1 (= v_main_~x~0_563 v_main_~x~0_562)) (.cse2 (= v_main_~y~0_613 v_main_~y~0_612))) (or (and (< 0 .cse0) (< v_main_~x~0_562 v_main_~x~0_563) (forall ((v_it_37 Int)) (or (< 0 (mod (+ v_main_~x~0_563 (* 4294967295 v_it_37)) 4294967296)) (not (<= 1 v_it_37)) (not (<= (+ v_main_~x~0_562 v_it_37 1) v_main_~x~0_563)))) (= v_main_~y~0_612 (+ v_main_~x~0_563 (* v_main_~x~0_562 (- 1)) v_main_~y~0_613))) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_180|) (= |v_main_#t~post6_179| |v_main_#t~post6_180|)) (and (= |v_main_#t~post6_180| |v_main_#t~post6_179|) .cse1 .cse2 (= |v_main_#t~post5_180| |v_main_#t~post5_179|)))) InVars {main_~y~0=v_main_~y~0_613, main_#t~post5=|v_main_#t~post5_180|, main_~x~0=v_main_~x~0_563, main_#t~post6=|v_main_#t~post6_180|} OutVars{main_~y~0=v_main_~y~0_612, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_562, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40149#true} is VALID [2022-04-15 06:46:59,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {40149#true} [169] 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[] {40149#true} is VALID [2022-04-15 06:46:59,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {40149#true} ~z~0 := ~y~0; {40154#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:46:59,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {40154#(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; {40155#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {40155#(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; {40149#true} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {40149#true} assume !(~z~0 % 4294967296 > 0); {40149#true} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {40149#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40149#true} is VALID [2022-04-15 06:46:59,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {40149#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40149#true} is VALID [2022-04-15 06:46:59,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {40149#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:46:59,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:46:59,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:46:59,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:46:59,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:46:59,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:46:59,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:46:59,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:46:59,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40249#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:59,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {40249#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:59,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:59,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:59,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {40249#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:59,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {40249#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40150#false} is VALID [2022-04-15 06:46:59,154 INFO L272 TraceCheckUtils]: 31: Hoare triple {40150#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40150#false} is VALID [2022-04-15 06:46:59,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {40150#false} ~cond := #in~cond; {40150#false} is VALID [2022-04-15 06:46:59,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {40150#false} assume 0 == ~cond; {40150#false} is VALID [2022-04-15 06:46:59,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {40150#false} assume !false; {40150#false} is VALID [2022-04-15 06:46:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 31 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 06:46:59,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:46:59,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {40150#false} assume !false; {40150#false} is VALID [2022-04-15 06:46:59,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {40150#false} assume 0 == ~cond; {40150#false} is VALID [2022-04-15 06:46:59,251 INFO L290 TraceCheckUtils]: 32: Hoare triple {40150#false} ~cond := #in~cond; {40150#false} is VALID [2022-04-15 06:46:59,251 INFO L272 TraceCheckUtils]: 31: Hoare triple {40150#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {40150#false} is VALID [2022-04-15 06:46:59,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {40249#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40150#false} is VALID [2022-04-15 06:46:59,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {40249#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:59,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:59,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:59,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {40249#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40253#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:46:59,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40249#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:46:59,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:46:59,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:46:59,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:46:59,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:46:59,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40233#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:46:59,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40229#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:46:59,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40225#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:46:59,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {40149#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40221#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:46:59,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {40149#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40149#true} is VALID [2022-04-15 06:46:59,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {40149#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {40149#true} is VALID [2022-04-15 06:46:59,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {40149#true} assume !(~z~0 % 4294967296 > 0); {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 13: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {40149#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {40149#true} ~z~0 := ~y~0; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {40149#true} [169] 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[] {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {40149#true} [170] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_563 4294967296)) (.cse1 (= v_main_~x~0_563 v_main_~x~0_562)) (.cse2 (= v_main_~y~0_613 v_main_~y~0_612))) (or (and (< 0 .cse0) (< v_main_~x~0_562 v_main_~x~0_563) (forall ((v_it_37 Int)) (or (< 0 (mod (+ v_main_~x~0_563 (* 4294967295 v_it_37)) 4294967296)) (not (<= 1 v_it_37)) (not (<= (+ v_main_~x~0_562 v_it_37 1) v_main_~x~0_563)))) (= v_main_~y~0_612 (+ v_main_~x~0_563 (* v_main_~x~0_562 (- 1)) v_main_~y~0_613))) (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_180|) (= |v_main_#t~post6_179| |v_main_#t~post6_180|)) (and (= |v_main_#t~post6_180| |v_main_#t~post6_179|) .cse1 .cse2 (= |v_main_#t~post5_180| |v_main_#t~post5_179|)))) InVars {main_~y~0=v_main_~y~0_613, main_#t~post5=|v_main_#t~post5_180|, main_~x~0=v_main_~x~0_563, main_#t~post6=|v_main_#t~post6_180|} OutVars{main_~y~0=v_main_~y~0_612, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_562, main_#t~post6=|v_main_#t~post6_179|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {40149#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {40149#true} call #t~ret17 := main(); {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40149#true} {40149#true} #94#return; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {40149#true} assume true; {40149#true} is VALID [2022-04-15 06:46:59,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {40149#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); {40149#true} is VALID [2022-04-15 06:46:59,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {40149#true} call ULTIMATE.init(); {40149#true} is VALID [2022-04-15 06:46:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-15 06:46:59,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11168676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:46:59,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:46:59,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 8] total 21 [2022-04-15 06:46:59,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:46:59,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [613846869] [2022-04-15 06:46:59,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [613846869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:46:59,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:46:59,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:46:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545752597] [2022-04-15 06:46:59,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:46:59,453 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 38 [2022-04-15 06:46:59,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:46:59,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:46:59,494 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:46:59,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:46:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:46:59,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:46:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2022-04-15 06:46:59,495 INFO L87 Difference]: Start difference. First operand 229 states and 307 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:08,298 INFO L93 Difference]: Finished difference Result 523 states and 691 transitions. [2022-04-15 06:47:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 06:47:08,298 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 38 [2022-04-15 06:47:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:08,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 165 transitions. [2022-04-15 06:47:08,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 165 transitions. [2022-04-15 06:47:08,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 165 transitions. [2022-04-15 06:47:08,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:08,571 INFO L225 Difference]: With dead ends: 523 [2022-04-15 06:47:08,571 INFO L226 Difference]: Without dead ends: 321 [2022-04-15 06:47:08,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 82 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1086 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=705, Invalid=4125, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:47:08,572 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 99 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:08,572 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 91 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:47:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-04-15 06:47:11,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 234. [2022-04-15 06:47:11,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:11,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 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:47:11,039 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 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:47:11,040 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 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:47:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:11,043 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2022-04-15 06:47:11,043 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2022-04-15 06:47:11,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:11,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:11,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 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 321 states. [2022-04-15 06:47:11,044 INFO L87 Difference]: Start difference. First operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 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 321 states. [2022-04-15 06:47:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:11,048 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2022-04-15 06:47:11,048 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2022-04-15 06:47:11,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:11,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:11,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:11,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:11,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 229 states have (on average 1.3362445414847162) internal successors, (306), 229 states have internal predecessors, (306), 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:47:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 310 transitions. [2022-04-15 06:47:11,066 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 310 transitions. Word has length 38 [2022-04-15 06:47:11,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:11,067 INFO L478 AbstractCegarLoop]: Abstraction has 234 states and 310 transitions. [2022-04-15 06:47:11,067 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:11,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 234 states and 310 transitions. [2022-04-15 06:47:27,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 307 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:27,615 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 310 transitions. [2022-04-15 06:47:27,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 06:47:27,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:47:27,616 INFO L499 BasicCegarLoop]: trace histogram [9, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:47:27,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-15 06:47:27,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:27,816 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:47:27,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:47:27,817 INFO L85 PathProgramCache]: Analyzing trace with hash -164755688, now seen corresponding path program 13 times [2022-04-15 06:47:27,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:27,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101557836] [2022-04-15 06:47:29,442 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:47:29,543 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:29,544 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:47:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash -145357033, now seen corresponding path program 1 times [2022-04-15 06:47:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:47:29,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655927213] [2022-04-15 06:47:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:29,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:47:29,557 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:47:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:29,570 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_38.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:47:29,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:47:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:29,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {42651#(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); {42635#true} is VALID [2022-04-15 06:47:29,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {42635#true} assume true; {42635#true} is VALID [2022-04-15 06:47:29,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42635#true} {42635#true} #94#return; {42635#true} is VALID [2022-04-15 06:47:29,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {42635#true} call ULTIMATE.init(); {42651#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:47:29,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {42651#(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); {42635#true} is VALID [2022-04-15 06:47:29,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {42635#true} assume true; {42635#true} is VALID [2022-04-15 06:47:29,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42635#true} {42635#true} #94#return; {42635#true} is VALID [2022-04-15 06:47:29,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {42635#true} call #t~ret17 := main(); {42635#true} is VALID [2022-04-15 06:47:29,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {42635#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42635#true} is VALID [2022-04-15 06:47:29,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {42635#true} [172] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_579 4294967296)) (.cse1 (= v_main_~x~0_579 v_main_~x~0_578)) (.cse2 (= |v_main_#t~post6_185| |v_main_#t~post6_184|)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= v_main_~y~0_646 v_main_~y~0_645))) (or (and (= v_main_~x~0_578 (+ v_main_~x~0_579 v_main_~y~0_646 (* (- 1) v_main_~y~0_645))) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (not (<= (+ v_main_~y~0_646 v_it_38 1) v_main_~y~0_645)) (< 0 (mod (+ v_main_~x~0_579 (* 4294967295 v_it_38)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_646 v_main_~y~0_645)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_646, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_579, main_#t~post6=|v_main_#t~post6_185|} OutVars{main_~y~0=v_main_~y~0_645, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_578, main_#t~post6=|v_main_#t~post6_184|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42635#true} is VALID [2022-04-15 06:47:29,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {42635#true} [171] 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[] {42640#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:47:29,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {42640#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {42640#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:47:29,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {42640#(<= 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; {42641#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:47:29,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {42641#(<= 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; {42642#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:29,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {42642#(<= 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; {42643#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:29,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {42643#(<= 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; {42644#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:29,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {42644#(<= 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; {42645#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:47:29,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {42645#(<= 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; {42646#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:29,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {42646#(<= 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; {42647#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:29,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {42647#(<= 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; {42648#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:47:29,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {42648#(<= 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; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~y~0 % 4294967296 > 0); {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:47:29,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {42649#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42650#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {42650#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {42636#false} assume !(~z~0 % 4294967296 > 0); {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {42636#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {42636#false} assume !(~y~0 % 4294967296 > 0); {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L272 TraceCheckUtils]: 31: Hoare triple {42636#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {42636#false} ~cond := #in~cond; {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {42636#false} assume 0 == ~cond; {42636#false} is VALID [2022-04-15 06:47:29,751 INFO L290 TraceCheckUtils]: 34: Hoare triple {42636#false} assume !false; {42636#false} is VALID [2022-04-15 06:47:29,752 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:47:29,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:47:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655927213] [2022-04-15 06:47:29,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655927213] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:47:29,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148479294] [2022-04-15 06:47:29,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:47:29,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:47:29,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:47:29,753 INFO L229 MonitoredProcess]: Starting monitored process 37 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:29,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 06:47:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:29,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:47:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:47:29,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:47:30,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {42635#true} call ULTIMATE.init(); {42635#true} is VALID [2022-04-15 06:47:30,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {42635#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); {42635#true} is VALID [2022-04-15 06:47:30,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {42635#true} assume true; {42635#true} is VALID [2022-04-15 06:47:30,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42635#true} {42635#true} #94#return; {42635#true} is VALID [2022-04-15 06:47:30,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {42635#true} call #t~ret17 := main(); {42635#true} is VALID [2022-04-15 06:47:30,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {42635#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42635#true} is VALID [2022-04-15 06:47:30,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {42635#true} [172] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_579 4294967296)) (.cse1 (= v_main_~x~0_579 v_main_~x~0_578)) (.cse2 (= |v_main_#t~post6_185| |v_main_#t~post6_184|)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= v_main_~y~0_646 v_main_~y~0_645))) (or (and (= v_main_~x~0_578 (+ v_main_~x~0_579 v_main_~y~0_646 (* (- 1) v_main_~y~0_645))) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (not (<= (+ v_main_~y~0_646 v_it_38 1) v_main_~y~0_645)) (< 0 (mod (+ v_main_~x~0_579 (* 4294967295 v_it_38)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_646 v_main_~y~0_645)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_646, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_579, main_#t~post6=|v_main_#t~post6_185|} OutVars{main_~y~0=v_main_~y~0_645, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_578, main_#t~post6=|v_main_#t~post6_184|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42635#true} is VALID [2022-04-15 06:47:30,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {42635#true} [171] 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[] {42635#true} is VALID [2022-04-15 06:47:30,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {42635#true} ~z~0 := ~y~0; {42679#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:47:30,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {42679#(= 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; {42683#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:47:30,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {42683#(= 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; {42687#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:47:30,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {42687#(= 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; {42691#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:47:30,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {42691#(= 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; {42695#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:47:30,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {42695#(= (+ main_~y~0 (- 3)) (+ 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; {42699#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-15 06:47:30,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {42699#(= (+ main_~y~0 (- 3)) (+ 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; {42703#(= (+ main_~y~0 (- 3)) (+ main_~z~0 3))} is VALID [2022-04-15 06:47:30,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {42703#(= (+ main_~y~0 (- 3)) (+ 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; {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {42707#(< 0 (mod (+ 4294967290 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; {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {42707#(< 0 (mod (+ 4294967290 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; {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42720#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {42720#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42724#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {42724#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42728#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:47:30,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {42728#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42732#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:47:30,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {42732#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42740#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:30,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {42740#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42740#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:30,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {42740#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,240 INFO L290 TraceCheckUtils]: 27: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,240 INFO L290 TraceCheckUtils]: 28: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42740#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:30,241 INFO L290 TraceCheckUtils]: 30: Hoare triple {42740#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42636#false} is VALID [2022-04-15 06:47:30,241 INFO L272 TraceCheckUtils]: 31: Hoare triple {42636#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42636#false} is VALID [2022-04-15 06:47:30,241 INFO L290 TraceCheckUtils]: 32: Hoare triple {42636#false} ~cond := #in~cond; {42636#false} is VALID [2022-04-15 06:47:30,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {42636#false} assume 0 == ~cond; {42636#false} is VALID [2022-04-15 06:47:30,242 INFO L290 TraceCheckUtils]: 34: Hoare triple {42636#false} assume !false; {42636#false} is VALID [2022-04-15 06:47:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:47:30,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:47:30,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {42636#false} assume !false; {42636#false} is VALID [2022-04-15 06:47:30,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {42636#false} assume 0 == ~cond; {42636#false} is VALID [2022-04-15 06:47:30,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {42636#false} ~cond := #in~cond; {42636#false} is VALID [2022-04-15 06:47:30,664 INFO L272 TraceCheckUtils]: 31: Hoare triple {42636#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {42636#false} is VALID [2022-04-15 06:47:30,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {42740#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42636#false} is VALID [2022-04-15 06:47:30,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {42740#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:30,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {42740#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,667 INFO L290 TraceCheckUtils]: 25: Hoare triple {42740#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {42740#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:30,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42740#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:47:30,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {42732#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42736#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:47:30,669 INFO L290 TraceCheckUtils]: 22: Hoare triple {42728#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42732#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:47:30,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {42724#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42728#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:47:30,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {42720#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42724#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42720#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {42707#(< 0 (mod (+ 4294967290 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; {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {42707#(< 0 (mod (+ 4294967290 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; {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {42828#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 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; {42707#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:47:30,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {42832#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 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; {42828#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:30,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {42836#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 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; {42832#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:30,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {42840#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 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; {42836#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:30,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {42844#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 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; {42840#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:30,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {42848#(or (< 0 (mod (+ 4294967290 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; {42844#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:47:30,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {42852#(or (< 0 (mod (+ 4294967290 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; {42848#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:47:30,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {42635#true} ~z~0 := ~y~0; {42852#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:47:30,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {42635#true} [171] 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[] {42635#true} is VALID [2022-04-15 06:47:30,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {42635#true} [172] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_579 4294967296)) (.cse1 (= v_main_~x~0_579 v_main_~x~0_578)) (.cse2 (= |v_main_#t~post6_185| |v_main_#t~post6_184|)) (.cse3 (= |v_main_#t~post5_185| |v_main_#t~post5_184|)) (.cse4 (= v_main_~y~0_646 v_main_~y~0_645))) (or (and (= v_main_~x~0_578 (+ v_main_~x~0_579 v_main_~y~0_646 (* (- 1) v_main_~y~0_645))) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (not (<= (+ v_main_~y~0_646 v_it_38 1) v_main_~y~0_645)) (< 0 (mod (+ v_main_~x~0_579 (* 4294967295 v_it_38)) 4294967296)))) (< 0 .cse0) (< v_main_~y~0_646 v_main_~y~0_645)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_646, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_579, main_#t~post6=|v_main_#t~post6_185|} OutVars{main_~y~0=v_main_~y~0_645, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_578, main_#t~post6=|v_main_#t~post6_184|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42635#true} is VALID [2022-04-15 06:47:30,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {42635#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42635#true} is VALID [2022-04-15 06:47:30,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {42635#true} call #t~ret17 := main(); {42635#true} is VALID [2022-04-15 06:47:30,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42635#true} {42635#true} #94#return; {42635#true} is VALID [2022-04-15 06:47:30,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {42635#true} assume true; {42635#true} is VALID [2022-04-15 06:47:30,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {42635#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); {42635#true} is VALID [2022-04-15 06:47:30,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {42635#true} call ULTIMATE.init(); {42635#true} is VALID [2022-04-15 06:47:30,680 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 21 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 06:47:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148479294] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:47:30,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:47:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 16] total 35 [2022-04-15 06:47:31,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:47:31,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101557836] [2022-04-15 06:47:31,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101557836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:47:31,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:47:31,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 06:47:31,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552015938] [2022-04-15 06:47:31,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:47:31,213 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 39 [2022-04-15 06:47:31,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:47:31,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:31,265 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:47:31,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 06:47:31,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:47:31,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 06:47:31,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1407, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:47:31,266 INFO L87 Difference]: Start difference. First operand 234 states and 310 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:43,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:43,985 INFO L93 Difference]: Finished difference Result 710 states and 1011 transitions. [2022-04-15 06:47:43,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:47:43,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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 39 [2022-04-15 06:47:43,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:47:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:43,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 223 transitions. [2022-04-15 06:47:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 223 transitions. [2022-04-15 06:47:43,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 223 transitions. [2022-04-15 06:47:44,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:47:44,340 INFO L225 Difference]: With dead ends: 710 [2022-04-15 06:47:44,340 INFO L226 Difference]: Without dead ends: 633 [2022-04-15 06:47:44,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=416, Invalid=3244, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 06:47:44,341 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 254 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:47:44,341 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 88 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 06:47:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2022-04-15 06:47:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 246. [2022-04-15 06:47:46,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:47:46,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 states have internal predecessors, (323), 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:47:46,835 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 states have internal predecessors, (323), 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:47:46,835 INFO L87 Difference]: Start difference. First operand 633 states. Second operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 states have internal predecessors, (323), 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:47:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:46,846 INFO L93 Difference]: Finished difference Result 633 states and 874 transitions. [2022-04-15 06:47:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 874 transitions. [2022-04-15 06:47:46,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:46,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:46,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 states have internal predecessors, (323), 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 633 states. [2022-04-15 06:47:46,847 INFO L87 Difference]: Start difference. First operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 states have internal predecessors, (323), 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 633 states. [2022-04-15 06:47:46,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:47:46,859 INFO L93 Difference]: Finished difference Result 633 states and 874 transitions. [2022-04-15 06:47:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 874 transitions. [2022-04-15 06:47:46,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:47:46,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:47:46,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:47:46,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:47:46,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 241 states have (on average 1.3402489626556016) internal successors, (323), 241 states have internal predecessors, (323), 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:47:46,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2022-04-15 06:47:46,863 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 39 [2022-04-15 06:47:46,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:47:46,863 INFO L478 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2022-04-15 06:47:46,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 18 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:47:46,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 246 states and 327 transitions. [2022-04-15 06:48:03,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 323 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2022-04-15 06:48:03,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 06:48:03,513 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:03,513 INFO L499 BasicCegarLoop]: trace histogram [10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:03,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 06:48:03,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:03,714 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:03,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash 106842550, now seen corresponding path program 14 times [2022-04-15 06:48:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:03,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113369547] [2022-04-15 06:48:07,831 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:07,901 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:48:07,902 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2117036503, now seen corresponding path program 1 times [2022-04-15 06:48:07,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:07,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826101972] [2022-04-15 06:48:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:07,923 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:48:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:07,937 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:48:08,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:08,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {46124#(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); {46107#true} is VALID [2022-04-15 06:48:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {46107#true} assume true; {46107#true} is VALID [2022-04-15 06:48:08,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46107#true} {46107#true} #94#return; {46107#true} is VALID [2022-04-15 06:48:08,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {46107#true} call ULTIMATE.init(); {46124#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {46124#(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); {46107#true} is VALID [2022-04-15 06:48:08,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {46107#true} assume true; {46107#true} is VALID [2022-04-15 06:48:08,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46107#true} {46107#true} #94#return; {46107#true} is VALID [2022-04-15 06:48:08,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {46107#true} call #t~ret17 := main(); {46107#true} is VALID [2022-04-15 06:48:08,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {46107#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46107#true} is VALID [2022-04-15 06:48:08,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {46107#true} [174] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_601 v_main_~x~0_600)) (.cse1 (= v_main_~y~0_673 v_main_~y~0_672)) (.cse2 (= |v_main_#t~post6_190| |v_main_#t~post6_189|)) (.cse3 (= |v_main_#t~post5_190| |v_main_#t~post5_189|)) (.cse4 (mod v_main_~x~0_601 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ v_main_~x~0_601 (* 4294967295 v_it_39)) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ v_main_~x~0_600 v_it_39 1) v_main_~x~0_601)))) (< 0 .cse4) (< v_main_~x~0_600 v_main_~x~0_601) (= v_main_~y~0_672 (+ v_main_~x~0_601 (* v_main_~x~0_600 (- 1)) v_main_~y~0_673))))) InVars {main_~y~0=v_main_~y~0_673, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_601, main_#t~post6=|v_main_#t~post6_190|} OutVars{main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_600, main_#t~post6=|v_main_#t~post6_189|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46107#true} is VALID [2022-04-15 06:48:08,134 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#true} [173] 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[] {46112#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:08,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {46112#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {46112#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:08,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {46112#(<= 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; {46113#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:08,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {46113#(<= 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; {46114#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:08,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {46114#(<= 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; {46115#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:08,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {46115#(<= 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; {46116#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:08,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {46116#(<= 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; {46117#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:48:08,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {46117#(<= 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; {46118#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:08,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {46118#(<= 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; {46119#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:08,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {46119#(<= 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; {46120#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:08,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {46120#(<= 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; {46121#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:48:08,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {46121#(<= 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; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~y~0 % 4294967296 > 0); {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:48:08,158 INFO L290 TraceCheckUtils]: 27: Hoare triple {46122#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46123#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 06:48:08,158 INFO L290 TraceCheckUtils]: 28: Hoare triple {46123#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {46108#false} assume !(~z~0 % 4294967296 > 0); {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {46108#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {46108#false} assume !(~y~0 % 4294967296 > 0); {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L272 TraceCheckUtils]: 32: Hoare triple {46108#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {46108#false} ~cond := #in~cond; {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {46108#false} assume 0 == ~cond; {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {46108#false} assume !false; {46108#false} is VALID [2022-04-15 06:48:08,159 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:48:08,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:08,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826101972] [2022-04-15 06:48:08,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826101972] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:08,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751660107] [2022-04-15 06:48:08,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:08,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:08,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:08,161 INFO L229 MonitoredProcess]: Starting monitored process 38 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:48:08,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 06:48:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:08,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:48:08,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:08,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:08,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {46107#true} call ULTIMATE.init(); {46107#true} is VALID [2022-04-15 06:48:08,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {46107#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); {46107#true} is VALID [2022-04-15 06:48:08,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {46107#true} assume true; {46107#true} is VALID [2022-04-15 06:48:08,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46107#true} {46107#true} #94#return; {46107#true} is VALID [2022-04-15 06:48:08,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {46107#true} call #t~ret17 := main(); {46107#true} is VALID [2022-04-15 06:48:08,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {46107#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46107#true} is VALID [2022-04-15 06:48:08,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {46107#true} [174] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_601 v_main_~x~0_600)) (.cse1 (= v_main_~y~0_673 v_main_~y~0_672)) (.cse2 (= |v_main_#t~post6_190| |v_main_#t~post6_189|)) (.cse3 (= |v_main_#t~post5_190| |v_main_#t~post5_189|)) (.cse4 (mod v_main_~x~0_601 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ v_main_~x~0_601 (* 4294967295 v_it_39)) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ v_main_~x~0_600 v_it_39 1) v_main_~x~0_601)))) (< 0 .cse4) (< v_main_~x~0_600 v_main_~x~0_601) (= v_main_~y~0_672 (+ v_main_~x~0_601 (* v_main_~x~0_600 (- 1)) v_main_~y~0_673))))) InVars {main_~y~0=v_main_~y~0_673, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_601, main_#t~post6=|v_main_#t~post6_190|} OutVars{main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_600, main_#t~post6=|v_main_#t~post6_189|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46107#true} is VALID [2022-04-15 06:48:08,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#true} [173] 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[] {46107#true} is VALID [2022-04-15 06:48:08,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {46107#true} ~z~0 := ~y~0; {46152#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:48:08,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {46152#(= 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; {46156#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:48:08,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {46156#(= 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; {46160#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:48:08,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {46160#(= (+ main_~z~0 1) (+ (- 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; {46164#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:48:08,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {46164#(= (+ main_~z~0 2) (+ (- 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; {46168#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:48:08,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {46168#(= (+ main_~y~0 (- 3)) (+ 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; {46172#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:48:08,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {46172#(= (+ main_~y~0 (- 4)) (+ 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; {46176#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-15 06:48:08,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {46176#(= (+ main_~y~0 (- 4)) (+ 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {46180#(< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {46180#(< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {46180#(< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46196#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {46196#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46200#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:08,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {46200#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46204#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:48:08,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {46204#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46208#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:48:08,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {46208#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:08,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46216#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:48:08,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {46216#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46216#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:48:08,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {46216#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:08,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:08,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:08,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {46216#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:48:08,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {46216#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46108#false} is VALID [2022-04-15 06:48:08,655 INFO L272 TraceCheckUtils]: 32: Hoare triple {46108#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46108#false} is VALID [2022-04-15 06:48:08,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {46108#false} ~cond := #in~cond; {46108#false} is VALID [2022-04-15 06:48:08,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {46108#false} assume 0 == ~cond; {46108#false} is VALID [2022-04-15 06:48:08,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {46108#false} assume !false; {46108#false} is VALID [2022-04-15 06:48:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:48:08,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:09,090 INFO L290 TraceCheckUtils]: 35: Hoare triple {46108#false} assume !false; {46108#false} is VALID [2022-04-15 06:48:09,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {46108#false} assume 0 == ~cond; {46108#false} is VALID [2022-04-15 06:48:09,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {46108#false} ~cond := #in~cond; {46108#false} is VALID [2022-04-15 06:48:09,090 INFO L272 TraceCheckUtils]: 32: Hoare triple {46108#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {46108#false} is VALID [2022-04-15 06:48:09,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {46216#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46108#false} is VALID [2022-04-15 06:48:09,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {46216#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:48:09,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:09,093 INFO L290 TraceCheckUtils]: 28: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:09,094 INFO L290 TraceCheckUtils]: 27: Hoare triple {46216#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:09,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {46216#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {46216#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:48:09,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46216#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:48:09,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {46208#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:48:09,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {46204#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46208#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:48:09,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {46200#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46204#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:48:09,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {46196#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46200#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46196#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {46180#(< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {46180#(< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {46180#(< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {46307#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 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; {46180#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:48:09,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {46311#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 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; {46307#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:48:09,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {46315#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 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; {46311#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:48:09,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {46319#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 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; {46315#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:48:09,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {46323#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 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; {46319#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:48:09,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {46327#(or (< 0 (mod (+ 4294967290 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; {46323#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:48:09,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {46331#(or (< 0 (mod (+ 4294967290 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; {46327#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:48:09,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {46107#true} ~z~0 := ~y~0; {46331#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:48:09,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#true} [173] 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[] {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {46107#true} [174] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_601 v_main_~x~0_600)) (.cse1 (= v_main_~y~0_673 v_main_~y~0_672)) (.cse2 (= |v_main_#t~post6_190| |v_main_#t~post6_189|)) (.cse3 (= |v_main_#t~post5_190| |v_main_#t~post5_189|)) (.cse4 (mod v_main_~x~0_601 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ v_main_~x~0_601 (* 4294967295 v_it_39)) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ v_main_~x~0_600 v_it_39 1) v_main_~x~0_601)))) (< 0 .cse4) (< v_main_~x~0_600 v_main_~x~0_601) (= v_main_~y~0_672 (+ v_main_~x~0_601 (* v_main_~x~0_600 (- 1)) v_main_~y~0_673))))) InVars {main_~y~0=v_main_~y~0_673, main_#t~post5=|v_main_#t~post5_190|, main_~x~0=v_main_~x~0_601, main_#t~post6=|v_main_#t~post6_190|} OutVars{main_~y~0=v_main_~y~0_672, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_600, main_#t~post6=|v_main_#t~post6_189|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {46107#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {46107#true} call #t~ret17 := main(); {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46107#true} {46107#true} #94#return; {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {46107#true} assume true; {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {46107#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); {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {46107#true} call ULTIMATE.init(); {46107#true} is VALID [2022-04-15 06:48:09,108 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:48:09,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751660107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:09,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:09,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 36 [2022-04-15 06:48:09,561 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:09,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113369547] [2022-04-15 06:48:09,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113369547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:09,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:09,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 06:48:09,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559015976] [2022-04-15 06:48:09,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:09,562 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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 40 [2022-04-15 06:48:09,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:09,562 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), 19 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:48:09,594 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:48:09,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 06:48:09,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:09,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 06:48:09,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1480, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 06:48:09,595 INFO L87 Difference]: Start difference. First operand 246 states and 327 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:48:24,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:24,123 INFO L93 Difference]: Finished difference Result 739 states and 1052 transitions. [2022-04-15 06:48:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 06:48:24,125 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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 40 [2022-04-15 06:48:24,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:24,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:48:24,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 233 transitions. [2022-04-15 06:48:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:48:24,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 233 transitions. [2022-04-15 06:48:24,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 233 transitions. [2022-04-15 06:48:24,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:24,598 INFO L225 Difference]: With dead ends: 739 [2022-04-15 06:48:24,599 INFO L226 Difference]: Without dead ends: 662 [2022-04-15 06:48:24,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=437, Invalid=3469, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:48:24,599 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 283 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:24,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 84 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:48:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-04-15 06:48:27,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 257. [2022-04-15 06:48:27,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:27,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 states have internal predecessors, (338), 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:27,346 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 states have internal predecessors, (338), 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:27,347 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 states have internal predecessors, (338), 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:27,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:27,359 INFO L93 Difference]: Finished difference Result 662 states and 915 transitions. [2022-04-15 06:48:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 915 transitions. [2022-04-15 06:48:27,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:27,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:27,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 states have internal predecessors, (338), 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 662 states. [2022-04-15 06:48:27,360 INFO L87 Difference]: Start difference. First operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 states have internal predecessors, (338), 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 662 states. [2022-04-15 06:48:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:27,372 INFO L93 Difference]: Finished difference Result 662 states and 915 transitions. [2022-04-15 06:48:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 915 transitions. [2022-04-15 06:48:27,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:27,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:27,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:27,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 252 states have (on average 1.3412698412698412) internal successors, (338), 252 states have internal predecessors, (338), 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:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 342 transitions. [2022-04-15 06:48:27,376 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 342 transitions. Word has length 40 [2022-04-15 06:48:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:27,376 INFO L478 AbstractCegarLoop]: Abstraction has 257 states and 342 transitions. [2022-04-15 06:48:27,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 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:48:27,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 342 transitions. [2022-04-15 06:48:46,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 338 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 342 transitions. [2022-04-15 06:48:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:48:46,738 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:46,738 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:46,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 06:48:46,954 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:46,955 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:46,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1046867033, now seen corresponding path program 9 times [2022-04-15 06:48:46,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:46,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865137224] [2022-04-15 06:48:47,160 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:48:47,161 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1212011049, now seen corresponding path program 1 times [2022-04-15 06:48:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:47,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977015250] [2022-04-15 06:48:47,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:47,173 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:48:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:47,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_40.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:48:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:47,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {49738#(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); {49726#true} is VALID [2022-04-15 06:48:47,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {49726#true} assume true; {49726#true} is VALID [2022-04-15 06:48:47,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49726#true} {49726#true} #94#return; {49726#true} is VALID [2022-04-15 06:48:47,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {49726#true} call ULTIMATE.init(); {49738#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:47,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {49738#(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); {49726#true} is VALID [2022-04-15 06:48:47,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {49726#true} assume true; {49726#true} is VALID [2022-04-15 06:48:47,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49726#true} {49726#true} #94#return; {49726#true} is VALID [2022-04-15 06:48:47,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {49726#true} call #t~ret17 := main(); {49726#true} is VALID [2022-04-15 06:48:47,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {49726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49726#true} is VALID [2022-04-15 06:48:47,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {49726#true} [176] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_194|)) (.cse1 (= v_main_~y~0_700 v_main_~y~0_699)) (.cse4 (mod v_main_~x~0_624 4294967296)) (.cse2 (= |v_main_#t~post6_195| |v_main_#t~post6_194|)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_623 v_main_~x~0_624) (forall ((v_it_40 Int)) (or (not (<= (+ v_main_~x~0_623 v_it_40 1) v_main_~x~0_624)) (not (<= 1 v_it_40)) (< 0 (mod (+ v_main_~x~0_624 (* 4294967295 v_it_40)) 4294967296)))) (= (+ v_main_~x~0_624 v_main_~y~0_700 (* v_main_~x~0_623 (- 1))) v_main_~y~0_699) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_700, main_#t~post5=|v_main_#t~post5_195|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_195|} OutVars{main_~y~0=v_main_~y~0_699, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_194|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49726#true} is VALID [2022-04-15 06:48:47,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {49726#true} [175] 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[] {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {49731#(<= 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; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {49732#(<= 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; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {49733#(<= 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; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {49734#(<= 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; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,312 INFO L272 TraceCheckUtils]: 34: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49736#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:48:47,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {49736#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {49737#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:48:47,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {49737#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {49727#false} is VALID [2022-04-15 06:48:47,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {49727#false} assume !false; {49727#false} is VALID [2022-04-15 06:48:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:48:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:47,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977015250] [2022-04-15 06:48:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977015250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:47,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678794408] [2022-04-15 06:48:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:47,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:47,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:47,315 INFO L229 MonitoredProcess]: Starting monitored process 39 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:48:47,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 06:48:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:47,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 06:48:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:47,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:47,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {49726#true} call ULTIMATE.init(); {49726#true} is VALID [2022-04-15 06:48:47,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {49726#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); {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {49726#true} assume true; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49726#true} {49726#true} #94#return; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {49726#true} call #t~ret17 := main(); {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {49726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {49726#true} [176] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_194|)) (.cse1 (= v_main_~y~0_700 v_main_~y~0_699)) (.cse4 (mod v_main_~x~0_624 4294967296)) (.cse2 (= |v_main_#t~post6_195| |v_main_#t~post6_194|)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_623 v_main_~x~0_624) (forall ((v_it_40 Int)) (or (not (<= (+ v_main_~x~0_623 v_it_40 1) v_main_~x~0_624)) (not (<= 1 v_it_40)) (< 0 (mod (+ v_main_~x~0_624 (* 4294967295 v_it_40)) 4294967296)))) (= (+ v_main_~x~0_624 v_main_~y~0_700 (* v_main_~x~0_623 (- 1))) v_main_~y~0_699) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_700, main_#t~post5=|v_main_#t~post5_195|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_195|} OutVars{main_~y~0=v_main_~y~0_699, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_194|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {49726#true} [175] 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[] {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {49726#true} ~z~0 := ~y~0; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {49726#true} assume !(~z~0 % 4294967296 > 0); {49726#true} is VALID [2022-04-15 06:48:47,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {49726#true} assume !(~y~0 % 4294967296 > 0); {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {49726#true} assume !(~x~0 % 4294967296 > 0); {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,618 INFO L272 TraceCheckUtils]: 34: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:48:47,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {49844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:48:47,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {49848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {49727#false} is VALID [2022-04-15 06:48:47,618 INFO L290 TraceCheckUtils]: 37: Hoare triple {49727#false} assume !false; {49727#false} is VALID [2022-04-15 06:48:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 06:48:47,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:47,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {49727#false} assume !false; {49727#false} is VALID [2022-04-15 06:48:47,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {49848#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {49727#false} is VALID [2022-04-15 06:48:47,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {49844#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {49848#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:48:47,846 INFO L272 TraceCheckUtils]: 34: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {49844#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:48:47,846 INFO L290 TraceCheckUtils]: 33: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,859 INFO L290 TraceCheckUtils]: 31: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,860 INFO L290 TraceCheckUtils]: 30: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49735#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49734#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49733#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:48:47,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {49732#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:48:47,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {49726#true} assume !(~x~0 % 4294967296 > 0); {49731#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:48:47,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {49726#true} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {49726#true} assume !(~y~0 % 4294967296 > 0); {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {49726#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {49726#true} assume !(~z~0 % 4294967296 > 0); {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {49726#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {49726#true} ~z~0 := ~y~0; {49726#true} is VALID [2022-04-15 06:48:47,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {49726#true} [175] 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[] {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {49726#true} [176] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_195| |v_main_#t~post5_194|)) (.cse1 (= v_main_~y~0_700 v_main_~y~0_699)) (.cse4 (mod v_main_~x~0_624 4294967296)) (.cse2 (= |v_main_#t~post6_195| |v_main_#t~post6_194|)) (.cse3 (= v_main_~x~0_624 v_main_~x~0_623))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_623 v_main_~x~0_624) (forall ((v_it_40 Int)) (or (not (<= (+ v_main_~x~0_623 v_it_40 1) v_main_~x~0_624)) (not (<= 1 v_it_40)) (< 0 (mod (+ v_main_~x~0_624 (* 4294967295 v_it_40)) 4294967296)))) (= (+ v_main_~x~0_624 v_main_~y~0_700 (* v_main_~x~0_623 (- 1))) v_main_~y~0_699) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_700, main_#t~post5=|v_main_#t~post5_195|, main_~x~0=v_main_~x~0_624, main_#t~post6=|v_main_#t~post6_195|} OutVars{main_~y~0=v_main_~y~0_699, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_623, main_#t~post6=|v_main_#t~post6_194|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L290 TraceCheckUtils]: 5: Hoare triple {49726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {49726#true} call #t~ret17 := main(); {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49726#true} {49726#true} #94#return; {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {49726#true} assume true; {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {49726#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); {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {49726#true} call ULTIMATE.init(); {49726#true} is VALID [2022-04-15 06:48:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 06:48:47,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678794408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:47,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:47,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2022-04-15 06:48:48,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:48,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [865137224] [2022-04-15 06:48:48,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [865137224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:48,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:48,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 06:48:48,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519063105] [2022-04-15 06:48:48,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:48,019 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 41 [2022-04-15 06:48:48,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:48,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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:48:48,051 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:48:48,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 06:48:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:48,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 06:48:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-04-15 06:48:48,052 INFO L87 Difference]: Start difference. First operand 257 states and 342 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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:48:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:55,232 INFO L93 Difference]: Finished difference Result 418 states and 556 transitions. [2022-04-15 06:48:55,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 06:48:55,232 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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 41 [2022-04-15 06:48:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:55,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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:48:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-04-15 06:48:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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:48:55,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 112 transitions. [2022-04-15 06:48:55,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 112 transitions. [2022-04-15 06:48:55,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:55,372 INFO L225 Difference]: With dead ends: 418 [2022-04-15 06:48:55,373 INFO L226 Difference]: Without dead ends: 408 [2022-04-15 06:48:55,373 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 87 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:48:55,373 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 104 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:55,373 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 55 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:48:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-04-15 06:48:58,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 273. [2022-04-15 06:48:58,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:58,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 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:58,466 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 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:58,467 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 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:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:58,473 INFO L93 Difference]: Finished difference Result 408 states and 545 transitions. [2022-04-15 06:48:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 545 transitions. [2022-04-15 06:48:58,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:58,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:58,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 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 408 states. [2022-04-15 06:48:58,474 INFO L87 Difference]: Start difference. First operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 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 408 states. [2022-04-15 06:48:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:58,480 INFO L93 Difference]: Finished difference Result 408 states and 545 transitions. [2022-04-15 06:48:58,480 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 545 transitions. [2022-04-15 06:48:58,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:58,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:58,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:58,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 268 states have (on average 1.3470149253731343) internal successors, (361), 268 states have internal predecessors, (361), 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:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 365 transitions. [2022-04-15 06:48:58,484 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 365 transitions. Word has length 41 [2022-04-15 06:48:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:58,484 INFO L478 AbstractCegarLoop]: Abstraction has 273 states and 365 transitions. [2022-04-15 06:48:58,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 12 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:48:58,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 273 states and 365 transitions. [2022-04-15 06:49:19,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 365 edges. 361 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 365 transitions. [2022-04-15 06:49:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:49:19,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:19,246 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:19,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:49:19,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-15 06:49:19,447 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:19,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:19,447 INFO L85 PathProgramCache]: Analyzing trace with hash 831225272, now seen corresponding path program 15 times [2022-04-15 06:49:19,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:19,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1129509765] [2022-04-15 06:49:19,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:49:19,640 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:19,642 INFO L85 PathProgramCache]: Analyzing trace with hash 171192631, now seen corresponding path program 1 times [2022-04-15 06:49:19,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:19,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574171357] [2022-04-15 06:49:19,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:19,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:19,652 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:49:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:19,679 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:49:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:20,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {52210#(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); {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {52192#true} assume true; {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52192#true} {52192#true} #94#return; {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {52192#true} call ULTIMATE.init(); {52210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:20,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {52210#(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); {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {52192#true} assume true; {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52192#true} {52192#true} #94#return; {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {52192#true} call #t~ret17 := main(); {52192#true} is VALID [2022-04-15 06:49:20,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {52192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52192#true} is VALID [2022-04-15 06:49:20,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {52192#true} [178] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_650 4294967296)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~y~0_714 v_main_~y~0_713)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and (forall ((v_it_41 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_650) 4294967296)) (not (<= 1 v_it_41)) (not (<= (+ v_main_~y~0_714 v_it_41 1) v_main_~y~0_713)))) (= v_main_~x~0_649 (+ v_main_~x~0_650 v_main_~y~0_714 (* (- 1) v_main_~y~0_713))) (< 0 .cse0) (< v_main_~y~0_714 v_main_~y~0_713)) (and (<= .cse0 0) .cse1 .cse2 (= v_main_~x~0_649 v_main_~x~0_650) .cse3) (and .cse1 .cse2 .cse3 (= v_main_~x~0_650 v_main_~x~0_649)))) InVars {main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_650, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_713, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_649, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52192#true} is VALID [2022-04-15 06:49:20,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {52192#true} [177] 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[] {52192#true} is VALID [2022-04-15 06:49:20,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {52192#true} ~z~0 := ~y~0; {52197#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:49:20,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {52197#(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; {52198#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:49:20,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {52198#(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; {52199#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:49:20,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {52199#(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; {52200#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:49:20,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {52200#(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; {52201#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:49:20,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {52201#(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; {52202#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ 5 main_~z~0))) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ 5 main_~z~0) main_~y~0)))} is VALID [2022-04-15 06:49:20,044 INFO L290 TraceCheckUtils]: 14: Hoare triple {52202#(and (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ 5 main_~z~0))) (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (<= (+ 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; {52203#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:49:20,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {52203#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {52203#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} is VALID [2022-04-15 06:49:20,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {52203#(or (<= main_~z~0 (+ (* (div (+ (- 4294967290) (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967294)) (<= (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 4294967301 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52204#(or (<= main_~z~0 (+ 4294967295 (* (div (+ (- 4294967292) main_~z~0) 4294967296) 4294967296))) (<= (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-15 06:49:20,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {52204#(or (<= main_~z~0 (+ 4294967295 (* (div (+ (- 4294967292) main_~z~0) 4294967296) 4294967296))) (<= (+ (* (div (+ 5 main_~z~0) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52205#(or (<= (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 2) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967293)) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-15 06:49:20,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {52205#(or (<= (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) 2) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967293)) 4294967296) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52206#(or (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 4294967294)) 4294967296) 4294967296))) (<= (+ 3 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) main_~z~0))} is VALID [2022-04-15 06:49:20,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {52206#(or (<= main_~z~0 (+ 4294967297 (* (div (+ main_~z~0 (- 4294967294)) 4294967296) 4294967296))) (<= (+ 3 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52207#(or (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 (- 4294967295)) 4294967296)) 4294967298)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 4) main_~z~0))} is VALID [2022-04-15 06:49:20,052 INFO L290 TraceCheckUtils]: 20: Hoare triple {52207#(or (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 (- 4294967295)) 4294967296)) 4294967298)) (<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 4) main_~z~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52208#(or (<= (+ 5 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967296)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-15 06:49:20,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {52208#(or (<= (+ 5 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0) (<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4294967296)) 4294967296) 4294967296) 4294967299)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {52193#false} is VALID [2022-04-15 06:49:20,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {52193#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {52193#false} is VALID [2022-04-15 06:49:20,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {52193#false} assume !(~y~0 % 4294967296 > 0); {52193#false} is VALID [2022-04-15 06:49:20,056 INFO L272 TraceCheckUtils]: 33: Hoare triple {52193#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52193#false} is VALID [2022-04-15 06:49:20,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {52193#false} ~cond := #in~cond; {52193#false} is VALID [2022-04-15 06:49:20,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {52193#false} assume 0 == ~cond; {52193#false} is VALID [2022-04-15 06:49:20,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {52193#false} assume !false; {52193#false} is VALID [2022-04-15 06:49:20,057 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:49:20,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:20,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574171357] [2022-04-15 06:49:20,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574171357] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:20,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222086273] [2022-04-15 06:49:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:20,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:20,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:20,058 INFO L229 MonitoredProcess]: Starting monitored process 40 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:20,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 06:49:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:20,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:49:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:20,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:20,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {52192#true} call ULTIMATE.init(); {52192#true} is VALID [2022-04-15 06:49:20,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {52192#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); {52192#true} is VALID [2022-04-15 06:49:20,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {52192#true} assume true; {52192#true} is VALID [2022-04-15 06:49:20,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52192#true} {52192#true} #94#return; {52192#true} is VALID [2022-04-15 06:49:20,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {52192#true} call #t~ret17 := main(); {52192#true} is VALID [2022-04-15 06:49:20,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {52192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52192#true} is VALID [2022-04-15 06:49:20,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {52192#true} [178] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_650 4294967296)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~y~0_714 v_main_~y~0_713)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and (forall ((v_it_41 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_650) 4294967296)) (not (<= 1 v_it_41)) (not (<= (+ v_main_~y~0_714 v_it_41 1) v_main_~y~0_713)))) (= v_main_~x~0_649 (+ v_main_~x~0_650 v_main_~y~0_714 (* (- 1) v_main_~y~0_713))) (< 0 .cse0) (< v_main_~y~0_714 v_main_~y~0_713)) (and (<= .cse0 0) .cse1 .cse2 (= v_main_~x~0_649 v_main_~x~0_650) .cse3) (and .cse1 .cse2 .cse3 (= v_main_~x~0_650 v_main_~x~0_649)))) InVars {main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_650, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_713, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_649, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52192#true} is VALID [2022-04-15 06:49:20,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {52192#true} [177] 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[] {52192#true} is VALID [2022-04-15 06:49:20,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {52192#true} ~z~0 := ~y~0; {52197#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:49:20,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {52197#(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; {52241#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:49:20,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {52241#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= 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; {52245#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:49:20,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {52245#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= 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; {52249#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-15 06:49:20,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {52249#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)) (< 0 (mod (+ main_~z~0 3) 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; {52253#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-15 06:49:20,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {52253#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0) (< 0 (mod (+ main_~z~0 4) 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; {52257#(and (<= main_~y~0 (+ 5 main_~z~0)) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:49:20,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {52257#(and (<= main_~y~0 (+ 5 main_~z~0)) (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (+ 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; {52261#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:49:20,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {52261#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {52261#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:49:20,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {52261#(and (<= (+ main_~z~0 6) main_~y~0) (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= main_~y~0 (+ main_~z~0 6)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52268#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:49:20,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {52268#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52272#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:49:20,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {52272#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52276#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:49:20,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {52276#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52280#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:49:20,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {52280#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52284#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:49:20,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {52284#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,755 INFO L290 TraceCheckUtils]: 28: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,755 INFO L290 TraceCheckUtils]: 30: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {52193#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L290 TraceCheckUtils]: 32: Hoare triple {52193#false} assume !(~y~0 % 4294967296 > 0); {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L272 TraceCheckUtils]: 33: Hoare triple {52193#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {52193#false} ~cond := #in~cond; {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L290 TraceCheckUtils]: 35: Hoare triple {52193#false} assume 0 == ~cond; {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L290 TraceCheckUtils]: 36: Hoare triple {52193#false} assume !false; {52193#false} is VALID [2022-04-15 06:49:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:49:20,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:20,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {52193#false} assume !false; {52193#false} is VALID [2022-04-15 06:49:20,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {52193#false} assume 0 == ~cond; {52193#false} is VALID [2022-04-15 06:49:20,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {52193#false} ~cond := #in~cond; {52193#false} is VALID [2022-04-15 06:49:20,957 INFO L272 TraceCheckUtils]: 33: Hoare triple {52193#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {52193#false} is VALID [2022-04-15 06:49:20,957 INFO L290 TraceCheckUtils]: 32: Hoare triple {52193#false} assume !(~y~0 % 4294967296 > 0); {52193#false} is VALID [2022-04-15 06:49:20,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {52193#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {52193#false} is VALID [2022-04-15 06:49:20,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {52193#false} is VALID [2022-04-15 06:49:20,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,959 INFO L290 TraceCheckUtils]: 28: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {52284#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52209#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:49:20,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {52280#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52284#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:49:20,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {52276#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52280#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:49:20,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {52272#(< 0 (mod (+ main_~z~0 4) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52276#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:49:20,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {52268#(< 0 (mod (+ 5 main_~z~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52272#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:49:20,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {52393#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52268#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:49:20,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {52393#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {52393#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:49:20,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {52268#(< 0 (mod (+ 5 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; {52393#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-15 06:49:20,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {52272#(< 0 (mod (+ main_~z~0 4) 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; {52268#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-15 06:49:20,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {52276#(< 0 (mod (+ main_~z~0 3) 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; {52272#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-15 06:49:20,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {52280#(< 0 (mod (+ main_~z~0 2) 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; {52276#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 06:49:20,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {52284#(< 0 (mod (+ main_~z~0 1) 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; {52280#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {52192#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52284#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {52192#true} ~z~0 := ~y~0; {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {52192#true} [177] 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[] {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {52192#true} [178] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_650 4294967296)) (.cse1 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse2 (= v_main_~y~0_714 v_main_~y~0_713)) (.cse3 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and (forall ((v_it_41 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_650) 4294967296)) (not (<= 1 v_it_41)) (not (<= (+ v_main_~y~0_714 v_it_41 1) v_main_~y~0_713)))) (= v_main_~x~0_649 (+ v_main_~x~0_650 v_main_~y~0_714 (* (- 1) v_main_~y~0_713))) (< 0 .cse0) (< v_main_~y~0_714 v_main_~y~0_713)) (and (<= .cse0 0) .cse1 .cse2 (= v_main_~x~0_649 v_main_~x~0_650) .cse3) (and .cse1 .cse2 .cse3 (= v_main_~x~0_650 v_main_~x~0_649)))) InVars {main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_650, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_713, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_649, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {52192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {52192#true} call #t~ret17 := main(); {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52192#true} {52192#true} #94#return; {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {52192#true} assume true; {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {52192#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); {52192#true} is VALID [2022-04-15 06:49:20,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {52192#true} call ULTIMATE.init(); {52192#true} is VALID [2022-04-15 06:49:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:49:20,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222086273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:20,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:20,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 9] total 28 [2022-04-15 06:49:21,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:21,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1129509765] [2022-04-15 06:49:21,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1129509765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:21,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:21,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:49:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119272763] [2022-04-15 06:49:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:21,348 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-15 06:49:21,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:21,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:49:21,407 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:49:21,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:49:21,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:21,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:49:21,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:49:21,408 INFO L87 Difference]: Start difference. First operand 273 states and 365 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:49:51,418 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 06:50:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:17,514 INFO L93 Difference]: Finished difference Result 407 states and 514 transitions. [2022-04-15 06:50:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:50:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-15 06:50:17,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:17,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:50:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-15 06:50:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:50:17,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 135 transitions. [2022-04-15 06:50:17,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 135 transitions. [2022-04-15 06:50:20,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 134 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:20,348 INFO L225 Difference]: With dead ends: 407 [2022-04-15 06:50:20,348 INFO L226 Difference]: Without dead ends: 400 [2022-04-15 06:50:20,349 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 67 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=856, Invalid=6800, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:50:20,349 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 67 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:20,349 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 90 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-15 06:50:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-15 06:50:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 282. [2022-04-15 06:50:23,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:23,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 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:23,716 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 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:23,716 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 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:23,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:23,722 INFO L93 Difference]: Finished difference Result 400 states and 506 transitions. [2022-04-15 06:50:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 506 transitions. [2022-04-15 06:50:23,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:23,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:23,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 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 400 states. [2022-04-15 06:50:23,723 INFO L87 Difference]: Start difference. First operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 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 400 states. [2022-04-15 06:50:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:23,730 INFO L93 Difference]: Finished difference Result 400 states and 506 transitions. [2022-04-15 06:50:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 506 transitions. [2022-04-15 06:50:23,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:23,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:23,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:23,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:23,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 277 states have (on average 1.339350180505415) internal successors, (371), 277 states have internal predecessors, (371), 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:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 375 transitions. [2022-04-15 06:50:23,735 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 375 transitions. Word has length 41 [2022-04-15 06:50:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:23,735 INFO L478 AbstractCegarLoop]: Abstraction has 282 states and 375 transitions. [2022-04-15 06:50:23,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:50:23,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 282 states and 375 transitions. [2022-04-15 06:50:50,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 372 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 375 transitions. [2022-04-15 06:50:50,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 06:50:50,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:50,088 INFO L499 BasicCegarLoop]: trace histogram [11, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:50,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 06:50:50,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 06:50:50,288 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:50,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -63546664, now seen corresponding path program 16 times [2022-04-15 06:50:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:50,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536327256] [2022-04-15 06:50:54,408 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:54,506 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:50:54,508 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 652823, now seen corresponding path program 1 times [2022-04-15 06:50:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:54,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96500205] [2022-04-15 06:50:54,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:54,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:54,522 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:50:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,534 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_42.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:50:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {54756#(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); {54738#true} is VALID [2022-04-15 06:50:54,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {54738#true} assume true; {54738#true} is VALID [2022-04-15 06:50:54,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54738#true} {54738#true} #94#return; {54738#true} is VALID [2022-04-15 06:50:54,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {54738#true} call ULTIMATE.init(); {54756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:54,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {54756#(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); {54738#true} is VALID [2022-04-15 06:50:54,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {54738#true} assume true; {54738#true} is VALID [2022-04-15 06:50:54,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54738#true} {54738#true} #94#return; {54738#true} is VALID [2022-04-15 06:50:54,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {54738#true} call #t~ret17 := main(); {54738#true} is VALID [2022-04-15 06:50:54,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {54738#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54738#true} is VALID [2022-04-15 06:50:54,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {54738#true} [180] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_674 4294967296)) (.cse0 (= |v_main_#t~post6_205| |v_main_#t~post6_204|)) (.cse1 (= v_main_~y~0_739 v_main_~y~0_738)) (.cse2 (= |v_main_#t~post5_205| |v_main_#t~post5_204|)) (.cse3 (= v_main_~x~0_674 v_main_~x~0_673))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (< v_main_~y~0_739 v_main_~y~0_738) (forall ((v_it_42 Int)) (or (not (<= (+ v_main_~y~0_739 v_it_42 1) v_main_~y~0_738)) (not (<= 1 v_it_42)) (< 0 (mod (+ v_main_~x~0_674 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_673 (+ v_main_~x~0_674 v_main_~y~0_739 (* (- 1) v_main_~y~0_738))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_739, main_#t~post5=|v_main_#t~post5_205|, main_~x~0=v_main_~x~0_674, main_#t~post6=|v_main_#t~post6_205|} OutVars{main_~y~0=v_main_~y~0_738, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_673, main_#t~post6=|v_main_#t~post6_204|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54738#true} is VALID [2022-04-15 06:50:54,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {54738#true} [179] 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[] {54743#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:50:54,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {54743#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {54743#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:50:54,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {54743#(<= 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; {54744#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:50:54,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {54744#(<= 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; {54745#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:54,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {54745#(<= 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; {54746#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:54,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {54746#(<= 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; {54747#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:54,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {54747#(<= 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; {54748#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:50:54,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {54748#(<= 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; {54749#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:54,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {54749#(<= 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; {54750#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:54,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {54750#(<= 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; {54751#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:50:54,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {54751#(<= 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; {54752#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:50:54,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {54752#(<= 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; {54753#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:50:54,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {54753#(<= 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; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,750 INFO L290 TraceCheckUtils]: 26: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~y~0 % 4294967296 > 0); {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:50:54,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {54754#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {54755#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} is VALID [2022-04-15 06:50:54,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {54755#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {54739#false} is VALID [2022-04-15 06:50:54,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {54739#false} assume !(~z~0 % 4294967296 > 0); {54739#false} is VALID [2022-04-15 06:50:54,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {54739#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {54739#false} is VALID [2022-04-15 06:50:54,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {54739#false} assume !(~y~0 % 4294967296 > 0); {54739#false} is VALID [2022-04-15 06:50:54,752 INFO L272 TraceCheckUtils]: 33: Hoare triple {54739#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54739#false} is VALID [2022-04-15 06:50:54,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {54739#false} ~cond := #in~cond; {54739#false} is VALID [2022-04-15 06:50:54,752 INFO L290 TraceCheckUtils]: 35: Hoare triple {54739#false} assume 0 == ~cond; {54739#false} is VALID [2022-04-15 06:50:54,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {54739#false} assume !false; {54739#false} is VALID [2022-04-15 06:50:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:50:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96500205] [2022-04-15 06:50:54,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96500205] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579339518] [2022-04-15 06:50:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:54,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:54,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:54,753 INFO L229 MonitoredProcess]: Starting monitored process 41 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:50:54,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 06:50:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:50:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:54,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:55,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {54738#true} call ULTIMATE.init(); {54738#true} is VALID [2022-04-15 06:50:55,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {54738#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); {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {54738#true} assume true; {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54738#true} {54738#true} #94#return; {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {54738#true} call #t~ret17 := main(); {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {54738#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {54738#true} [180] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_674 4294967296)) (.cse0 (= |v_main_#t~post6_205| |v_main_#t~post6_204|)) (.cse1 (= v_main_~y~0_739 v_main_~y~0_738)) (.cse2 (= |v_main_#t~post5_205| |v_main_#t~post5_204|)) (.cse3 (= v_main_~x~0_674 v_main_~x~0_673))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (< v_main_~y~0_739 v_main_~y~0_738) (forall ((v_it_42 Int)) (or (not (<= (+ v_main_~y~0_739 v_it_42 1) v_main_~y~0_738)) (not (<= 1 v_it_42)) (< 0 (mod (+ v_main_~x~0_674 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_673 (+ v_main_~x~0_674 v_main_~y~0_739 (* (- 1) v_main_~y~0_738))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_739, main_#t~post5=|v_main_#t~post5_205|, main_~x~0=v_main_~x~0_674, main_#t~post6=|v_main_#t~post6_205|} OutVars{main_~y~0=v_main_~y~0_738, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_673, main_#t~post6=|v_main_#t~post6_204|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L290 TraceCheckUtils]: 7: Hoare triple {54738#true} [179] 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[] {54738#true} is VALID [2022-04-15 06:50:55,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {54738#true} ~z~0 := ~y~0; {54784#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:50:55,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {54784#(= 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; {54788#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:50:55,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {54788#(= 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; {54792#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:50:55,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {54792#(= (+ main_~z~0 1) (+ (- 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; {54796#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:50:55,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {54796#(= (+ main_~z~0 2) (+ (- 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; {54800#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:55,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {54800#(= (+ main_~y~0 (- 3)) (+ 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; {54804#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:50:55,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {54804#(= (+ main_~y~0 (- 4)) (+ 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; {54808#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-15 06:50:55,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {54808#(= (+ main_~y~0 (- 4)) (+ 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54831#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {54831#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54835#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {54835#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54839#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:50:55,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {54839#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54843#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:50:55,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {54843#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54851#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:50:55,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {54851#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54851#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:50:55,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {54851#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {54851#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:50:55,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {54851#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54739#false} is VALID [2022-04-15 06:50:55,225 INFO L272 TraceCheckUtils]: 33: Hoare triple {54739#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54739#false} is VALID [2022-04-15 06:50:55,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {54739#false} ~cond := #in~cond; {54739#false} is VALID [2022-04-15 06:50:55,225 INFO L290 TraceCheckUtils]: 35: Hoare triple {54739#false} assume 0 == ~cond; {54739#false} is VALID [2022-04-15 06:50:55,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {54739#false} assume !false; {54739#false} is VALID [2022-04-15 06:50:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:50:55,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:55,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {54739#false} assume !false; {54739#false} is VALID [2022-04-15 06:50:55,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {54739#false} assume 0 == ~cond; {54739#false} is VALID [2022-04-15 06:50:55,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {54739#false} ~cond := #in~cond; {54739#false} is VALID [2022-04-15 06:50:55,671 INFO L272 TraceCheckUtils]: 33: Hoare triple {54739#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {54739#false} is VALID [2022-04-15 06:50:55,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {54851#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54739#false} is VALID [2022-04-15 06:50:55,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {54851#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:50:55,672 INFO L290 TraceCheckUtils]: 30: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {54851#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {54851#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {54851#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:50:55,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54851#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:50:55,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {54843#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54847#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:50:55,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {54839#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54843#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:50:55,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {54835#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54839#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:50:55,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {54831#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54835#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54831#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {54812#(< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {54945#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 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; {54812#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:50:55,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {54949#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 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; {54945#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:50:55,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {54953#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 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; {54949#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:50:55,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {54957#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 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; {54953#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:50:55,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {54961#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 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; {54957#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:50:55,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {54965#(or (< 0 (mod (+ 4294967290 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; {54961#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:50:55,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {54969#(or (< 0 (mod (+ 4294967290 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; {54965#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:50:55,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {54738#true} ~z~0 := ~y~0; {54969#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:50:55,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {54738#true} [179] 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[] {54738#true} is VALID [2022-04-15 06:50:55,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {54738#true} [180] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_674 4294967296)) (.cse0 (= |v_main_#t~post6_205| |v_main_#t~post6_204|)) (.cse1 (= v_main_~y~0_739 v_main_~y~0_738)) (.cse2 (= |v_main_#t~post5_205| |v_main_#t~post5_204|)) (.cse3 (= v_main_~x~0_674 v_main_~x~0_673))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and (< v_main_~y~0_739 v_main_~y~0_738) (forall ((v_it_42 Int)) (or (not (<= (+ v_main_~y~0_739 v_it_42 1) v_main_~y~0_738)) (not (<= 1 v_it_42)) (< 0 (mod (+ v_main_~x~0_674 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_673 (+ v_main_~x~0_674 v_main_~y~0_739 (* (- 1) v_main_~y~0_738))) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_739, main_#t~post5=|v_main_#t~post5_205|, main_~x~0=v_main_~x~0_674, main_#t~post6=|v_main_#t~post6_205|} OutVars{main_~y~0=v_main_~y~0_738, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_673, main_#t~post6=|v_main_#t~post6_204|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54738#true} is VALID [2022-04-15 06:50:55,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {54738#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54738#true} is VALID [2022-04-15 06:50:55,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {54738#true} call #t~ret17 := main(); {54738#true} is VALID [2022-04-15 06:50:55,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54738#true} {54738#true} #94#return; {54738#true} is VALID [2022-04-15 06:50:55,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {54738#true} assume true; {54738#true} is VALID [2022-04-15 06:50:55,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {54738#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); {54738#true} is VALID [2022-04-15 06:50:55,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {54738#true} call ULTIMATE.init(); {54738#true} is VALID [2022-04-15 06:50:55,695 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 35 proven. 44 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:50:55,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579339518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:55,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:55,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 37 [2022-04-15 06:50:56,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:56,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536327256] [2022-04-15 06:50:56,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536327256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:56,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:56,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:50:56,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846900444] [2022-04-15 06:50:56,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:56,236 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-15 06:50:56,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:56,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:50:56,277 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:50:56,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:50:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:50:56,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1555, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 06:50:56,278 INFO L87 Difference]: Start difference. First operand 282 states and 375 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:51:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:14,520 INFO L93 Difference]: Finished difference Result 784 states and 1120 transitions. [2022-04-15 06:51:14,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 06:51:14,520 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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 41 [2022-04-15 06:51:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:51:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 244 transitions. [2022-04-15 06:51:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:51:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 244 transitions. [2022-04-15 06:51:14,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 244 transitions. [2022-04-15 06:51:15,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:15,049 INFO L225 Difference]: With dead ends: 784 [2022-04-15 06:51:15,049 INFO L226 Difference]: Without dead ends: 691 [2022-04-15 06:51:15,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=458, Invalid=3702, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 06:51:15,050 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 251 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:15,050 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 95 Invalid, 1454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:51:15,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-15 06:51:18,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 293. [2022-04-15 06:51:18,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:18,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 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:51:18,686 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 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:51:18,686 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 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:51:18,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,699 INFO L93 Difference]: Finished difference Result 691 states and 957 transitions. [2022-04-15 06:51:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 957 transitions. [2022-04-15 06:51:18,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:18,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:18,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 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 691 states. [2022-04-15 06:51:18,700 INFO L87 Difference]: Start difference. First operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 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 691 states. [2022-04-15 06:51:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,713 INFO L93 Difference]: Finished difference Result 691 states and 957 transitions. [2022-04-15 06:51:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 957 transitions. [2022-04-15 06:51:18,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:18,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:18,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:18,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 288 states have internal predecessors, (386), 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:51:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 390 transitions. [2022-04-15 06:51:18,718 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 390 transitions. Word has length 41 [2022-04-15 06:51:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:18,718 INFO L478 AbstractCegarLoop]: Abstraction has 293 states and 390 transitions. [2022-04-15 06:51:18,718 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 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:51:18,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 293 states and 390 transitions. [2022-04-15 06:51:47,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 390 edges. 387 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:47,900 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 390 transitions. [2022-04-15 06:51:47,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:51:47,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:47,901 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:47,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 06:51:48,101 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-15 06:51:48,101 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1383374916, now seen corresponding path program 10 times [2022-04-15 06:51:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:48,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1039706233] [2022-04-15 06:51:48,359 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:48,360 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 684750278, now seen corresponding path program 1 times [2022-04-15 06:51:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:48,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846369390] [2022-04-15 06:51:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:48,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:48,374 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:51:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,395 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_43.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:51:48,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {58596#(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); {58586#true} is VALID [2022-04-15 06:51:48,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {58586#true} assume true; {58586#true} is VALID [2022-04-15 06:51:48,477 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58586#true} {58586#true} #94#return; {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {58586#true} call ULTIMATE.init(); {58596#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:48,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {58596#(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); {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {58586#true} assume true; {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58586#true} {58586#true} #94#return; {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {58586#true} call #t~ret17 := main(); {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {58586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {58586#true} [182] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_766 v_main_~y~0_765)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697)) (.cse2 (mod v_main_~x~0_698 4294967296))) (or (and .cse0 .cse1 (= |v_main_#t~post5_210| |v_main_#t~post5_209|) (= |v_main_#t~post6_210| |v_main_#t~post6_209|)) (and .cse0 .cse1 (= |v_main_#t~post5_209| |v_main_#t~post5_210|) (<= .cse2 0) (= |v_main_#t~post6_209| |v_main_#t~post6_210|)) (and (< v_main_~x~0_697 v_main_~x~0_698) (forall ((v_it_43 Int)) (or (< 0 (mod (+ v_main_~x~0_698 (* 4294967295 v_it_43)) 4294967296)) (not (<= (+ v_main_~x~0_697 v_it_43 1) v_main_~x~0_698)) (not (<= 1 v_it_43)))) (< 0 .cse2) (= v_main_~y~0_765 (+ v_main_~x~0_698 v_main_~y~0_766 (* v_main_~x~0_697 (- 1))))))) InVars {main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_210|, main_~x~0=v_main_~x~0_698, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_765, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_697, main_#t~post6=|v_main_#t~post6_209|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {58586#true} [181] 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[] {58586#true} is VALID [2022-04-15 06:51:48,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {58586#true} ~z~0 := ~y~0; {58586#true} is VALID [2022-04-15 06:51:48,479 INFO L290 TraceCheckUtils]: 9: Hoare triple {58586#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58586#true} is VALID [2022-04-15 06:51:48,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {58586#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58586#true} is VALID [2022-04-15 06:51:48,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {58586#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58586#true} is VALID [2022-04-15 06:51:48,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {58586#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58586#true} is VALID [2022-04-15 06:51:48,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {58586#true} assume !(~z~0 % 4294967296 > 0); {58591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:51:48,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {58591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:51:48,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {58592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:51:48,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {58593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58594#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:48,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {58594#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~y~0 % 4294967296 > 0); {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !(~x~0 % 4294967296 > 0); {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-15 06:51:48,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {58595#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58594#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:51:48,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {58594#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-15 06:51:48,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {58593#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {58592#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {58591#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58587#false} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {58587#false} assume !(~z~0 % 4294967296 > 0); {58587#false} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {58587#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58587#false} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {58587#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58587#false} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {58587#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58587#false} is VALID [2022-04-15 06:51:48,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {58587#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58587#false} is VALID [2022-04-15 06:51:48,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {58587#false} assume !(~y~0 % 4294967296 > 0); {58587#false} is VALID [2022-04-15 06:51:48,492 INFO L272 TraceCheckUtils]: 35: Hoare triple {58587#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58587#false} is VALID [2022-04-15 06:51:48,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {58587#false} ~cond := #in~cond; {58587#false} is VALID [2022-04-15 06:51:48,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {58587#false} assume 0 == ~cond; {58587#false} is VALID [2022-04-15 06:51:48,492 INFO L290 TraceCheckUtils]: 38: Hoare triple {58587#false} assume !false; {58587#false} is VALID [2022-04-15 06:51:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-15 06:51:48,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846369390] [2022-04-15 06:51:48,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846369390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:48,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579212841] [2022-04-15 06:51:48,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:48,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:48,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:48,496 INFO L229 MonitoredProcess]: Starting monitored process 42 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:48,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 06:51:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-15 06:51:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:48,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {58586#true} call ULTIMATE.init(); {58586#true} is VALID [2022-04-15 06:51:48,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {58586#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); {58586#true} is VALID [2022-04-15 06:51:48,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {58586#true} assume true; {58586#true} is VALID [2022-04-15 06:51:48,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58586#true} {58586#true} #94#return; {58586#true} is VALID [2022-04-15 06:51:48,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {58586#true} call #t~ret17 := main(); {58586#true} is VALID [2022-04-15 06:51:48,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {58586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58586#true} is VALID [2022-04-15 06:51:48,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {58586#true} [182] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_766 v_main_~y~0_765)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697)) (.cse2 (mod v_main_~x~0_698 4294967296))) (or (and .cse0 .cse1 (= |v_main_#t~post5_210| |v_main_#t~post5_209|) (= |v_main_#t~post6_210| |v_main_#t~post6_209|)) (and .cse0 .cse1 (= |v_main_#t~post5_209| |v_main_#t~post5_210|) (<= .cse2 0) (= |v_main_#t~post6_209| |v_main_#t~post6_210|)) (and (< v_main_~x~0_697 v_main_~x~0_698) (forall ((v_it_43 Int)) (or (< 0 (mod (+ v_main_~x~0_698 (* 4294967295 v_it_43)) 4294967296)) (not (<= (+ v_main_~x~0_697 v_it_43 1) v_main_~x~0_698)) (not (<= 1 v_it_43)))) (< 0 .cse2) (= v_main_~y~0_765 (+ v_main_~x~0_698 v_main_~y~0_766 (* v_main_~x~0_697 (- 1))))))) InVars {main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_210|, main_~x~0=v_main_~x~0_698, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_765, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_697, main_#t~post6=|v_main_#t~post6_209|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58586#true} is VALID [2022-04-15 06:51:48,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {58586#true} [181] 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[] {58586#true} is VALID [2022-04-15 06:51:48,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {58586#true} ~z~0 := ~y~0; {58624#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:51:48,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {58624#(= 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; {58628#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:51:48,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {58628#(= 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; {58632#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:51:48,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {58632#(= 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; {58636#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:51:48,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {58636#(= 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; {58640#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-15 06:51:48,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {58640#(= main_~y~0 (+ main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {58640#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-15 06:51:48,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {58640#(= main_~y~0 (+ main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58632#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:51:48,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {58632#(= main_~y~0 (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58624#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:51:48,954 INFO L290 TraceCheckUtils]: 16: Hoare triple {58624#(= main_~z~0 main_~y~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58653#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:51:48,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {58653#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58657#(= main_~z~0 (+ main_~y~0 4))} is VALID [2022-04-15 06:51:48,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {58657#(= main_~z~0 (+ main_~y~0 4))} assume !(~y~0 % 4294967296 > 0); {58657#(= main_~z~0 (+ main_~y~0 4))} is VALID [2022-04-15 06:51:48,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {58657#(= main_~z~0 (+ main_~y~0 4))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58664#(= main_~y~0 (+ main_~z~0 (- 3)))} is VALID [2022-04-15 06:51:48,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {58664#(= main_~y~0 (+ main_~z~0 (- 3)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58653#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-15 06:51:48,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {58653#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58671#(= main_~y~0 (+ (- 1) main_~z~0))} is VALID [2022-04-15 06:51:48,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {58671#(= main_~y~0 (+ (- 1) main_~z~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58624#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:51:48,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {58624#(= main_~z~0 main_~y~0)} assume !(~x~0 % 4294967296 > 0); {58624#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:51:48,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {58624#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58628#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:51:48,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {58628#(= main_~y~0 (+ main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58632#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-15 06:51:48,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {58632#(= main_~y~0 (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58636#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-15 06:51:48,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {58636#(= main_~y~0 (+ main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58640#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-15 06:51:48,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {58640#(= main_~y~0 (+ main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:51:48,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:51:48,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:51:48,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {58700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:51:48,964 INFO L290 TraceCheckUtils]: 32: Hoare triple {58704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:51:48,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {58708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58712#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:51:48,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {58712#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {58587#false} is VALID [2022-04-15 06:51:48,966 INFO L272 TraceCheckUtils]: 35: Hoare triple {58587#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58587#false} is VALID [2022-04-15 06:51:48,966 INFO L290 TraceCheckUtils]: 36: Hoare triple {58587#false} ~cond := #in~cond; {58587#false} is VALID [2022-04-15 06:51:48,966 INFO L290 TraceCheckUtils]: 37: Hoare triple {58587#false} assume 0 == ~cond; {58587#false} is VALID [2022-04-15 06:51:48,966 INFO L290 TraceCheckUtils]: 38: Hoare triple {58587#false} assume !false; {58587#false} is VALID [2022-04-15 06:51:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:48,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:49,589 INFO L290 TraceCheckUtils]: 38: Hoare triple {58587#false} assume !false; {58587#false} is VALID [2022-04-15 06:51:49,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {58587#false} assume 0 == ~cond; {58587#false} is VALID [2022-04-15 06:51:49,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {58587#false} ~cond := #in~cond; {58587#false} is VALID [2022-04-15 06:51:49,590 INFO L272 TraceCheckUtils]: 35: Hoare triple {58587#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {58587#false} is VALID [2022-04-15 06:51:49,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {58712#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {58587#false} is VALID [2022-04-15 06:51:49,592 INFO L290 TraceCheckUtils]: 33: Hoare triple {58708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58712#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:51:49,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {58704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58708#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:51:49,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {58700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58704#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:51:49,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {58700#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:51:49,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:51:49,596 INFO L290 TraceCheckUtils]: 28: Hoare triple {58758#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58693#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:51:49,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {58762#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58758#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {58766#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58762#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {58770#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58766#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,600 INFO L290 TraceCheckUtils]: 24: Hoare triple {58774#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {58770#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {58774#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {58774#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,602 INFO L290 TraceCheckUtils]: 22: Hoare triple {58781#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58774#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {58785#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58781#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:51:49,603 INFO L290 TraceCheckUtils]: 20: Hoare triple {58789#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58785#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:51:49,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {58793#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {58789#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:51:49,604 INFO L290 TraceCheckUtils]: 18: Hoare triple {58793#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {58793#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:51:49,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {58800#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58793#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:51:49,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {58804#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58800#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 06:51:49,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {58808#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58804#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 06:51:49,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {58758#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58808#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-15 06:51:49,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {58758#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {58758#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {58762#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 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; {58758#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {58766#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 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; {58762#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {58770#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 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; {58766#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {58774#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 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; {58770#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {58586#true} ~z~0 := ~y~0; {58774#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:51:49,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {58586#true} [181] 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[] {58586#true} is VALID [2022-04-15 06:51:49,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {58586#true} [182] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_766 v_main_~y~0_765)) (.cse1 (= v_main_~x~0_698 v_main_~x~0_697)) (.cse2 (mod v_main_~x~0_698 4294967296))) (or (and .cse0 .cse1 (= |v_main_#t~post5_210| |v_main_#t~post5_209|) (= |v_main_#t~post6_210| |v_main_#t~post6_209|)) (and .cse0 .cse1 (= |v_main_#t~post5_209| |v_main_#t~post5_210|) (<= .cse2 0) (= |v_main_#t~post6_209| |v_main_#t~post6_210|)) (and (< v_main_~x~0_697 v_main_~x~0_698) (forall ((v_it_43 Int)) (or (< 0 (mod (+ v_main_~x~0_698 (* 4294967295 v_it_43)) 4294967296)) (not (<= (+ v_main_~x~0_697 v_it_43 1) v_main_~x~0_698)) (not (<= 1 v_it_43)))) (< 0 .cse2) (= v_main_~y~0_765 (+ v_main_~x~0_698 v_main_~y~0_766 (* v_main_~x~0_697 (- 1))))))) InVars {main_~y~0=v_main_~y~0_766, main_#t~post5=|v_main_#t~post5_210|, main_~x~0=v_main_~x~0_698, main_#t~post6=|v_main_#t~post6_210|} OutVars{main_~y~0=v_main_~y~0_765, main_#t~post5=|v_main_#t~post5_209|, main_~x~0=v_main_~x~0_697, main_#t~post6=|v_main_#t~post6_209|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {58586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {58586#true} call #t~ret17 := main(); {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58586#true} {58586#true} #94#return; {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {58586#true} assume true; {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {58586#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); {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {58586#true} call ULTIMATE.init(); {58586#true} is VALID [2022-04-15 06:51:49,613 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:49,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579212841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:49,613 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:49,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 19] total 34 [2022-04-15 06:51:49,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:49,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1039706233] [2022-04-15 06:51:49,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1039706233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:49,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:49,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 06:51:49,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946750542] [2022-04-15 06:51:49,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:49,892 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 42 [2022-04-15 06:51:49,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:49,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:51:49,924 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:51:49,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 06:51:49,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 06:51:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 06:51:49,925 INFO L87 Difference]: Start difference. First operand 293 states and 390 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:51:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:57,920 INFO L93 Difference]: Finished difference Result 424 states and 543 transitions. [2022-04-15 06:51:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 06:51:57,920 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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 42 [2022-04-15 06:51:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:51:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 87 transitions. [2022-04-15 06:51:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:51:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 87 transitions. [2022-04-15 06:51:57,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 87 transitions. [2022-04-15 06:51:58,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:58,078 INFO L225 Difference]: With dead ends: 424 [2022-04-15 06:51:58,078 INFO L226 Difference]: Without dead ends: 384 [2022-04-15 06:51:58,079 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=324, Invalid=2982, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:51:58,079 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 58 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:58,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 52 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:51:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-15 06:52:02,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 299. [2022-04-15 06:52:02,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:02,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 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:52:02,269 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 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:52:02,269 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 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:52:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:02,274 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-04-15 06:52:02,275 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 487 transitions. [2022-04-15 06:52:02,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:02,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:02,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 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 384 states. [2022-04-15 06:52:02,275 INFO L87 Difference]: Start difference. First operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 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 384 states. [2022-04-15 06:52:02,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:02,281 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-04-15 06:52:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 487 transitions. [2022-04-15 06:52:02,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:02,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:02,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:02,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 294 states have internal predecessors, (389), 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:52:02,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 393 transitions. [2022-04-15 06:52:02,286 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 393 transitions. Word has length 42 [2022-04-15 06:52:02,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:02,286 INFO L478 AbstractCegarLoop]: Abstraction has 299 states and 393 transitions. [2022-04-15 06:52:02,286 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 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:52:02,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 299 states and 393 transitions. [2022-04-15 06:52:30,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 390 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 393 transitions. [2022-04-15 06:52:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 06:52:30,242 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:30,242 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:30,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:30,447 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-15 06:52:30,447 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:30,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:30,448 INFO L85 PathProgramCache]: Analyzing trace with hash 924637287, now seen corresponding path program 17 times [2022-04-15 06:52:30,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:30,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [945478960] [2022-04-15 06:52:30,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:52:30,653 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash 572573064, now seen corresponding path program 1 times [2022-04-15 06:52:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559424591] [2022-04-15 06:52:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:30,665 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:52:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,683 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_44.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:52:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:30,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {61137#(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); {61118#true} is VALID [2022-04-15 06:52:30,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {61118#true} assume true; {61118#true} is VALID [2022-04-15 06:52:30,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61118#true} {61118#true} #94#return; {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {61118#true} call ULTIMATE.init(); {61137#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:30,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {61137#(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); {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {61118#true} assume true; {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61118#true} {61118#true} #94#return; {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {61118#true} call #t~ret17 := main(); {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {61118#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {61118#true} [184] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_215| |v_main_#t~post6_214|)) (.cse0 (mod v_main_~x~0_726 4294967296)) (.cse2 (= v_main_~y~0_800 v_main_~y~0_799)) (.cse3 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse4 (= v_main_~x~0_726 v_main_~x~0_725))) (or (and (forall ((v_it_44 Int)) (or (not (<= (+ v_main_~y~0_800 v_it_44 1) v_main_~y~0_799)) (< 0 (mod (+ v_main_~x~0_726 (* 4294967295 v_it_44)) 4294967296)) (not (<= 1 v_it_44)))) (< v_main_~y~0_800 v_main_~y~0_799) (< 0 .cse0) (= v_main_~x~0_725 (+ v_main_~x~0_726 v_main_~y~0_800 (* (- 1) v_main_~y~0_799)))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_800, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_215|} OutVars{main_~y~0=v_main_~y~0_799, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_725, main_#t~post6=|v_main_#t~post6_214|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {61118#true} is VALID [2022-04-15 06:52:30,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {61118#true} [183] 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[] {61118#true} is VALID [2022-04-15 06:52:30,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {61118#true} ~z~0 := ~y~0; {61123#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:52:30,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {61123#(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; {61124#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:52:30,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {61124#(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; {61125#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:52:30,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {61125#(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; {61126#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-15 06:52:30,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {61126#(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; {61127#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 06:52:30,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {61127#(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; {61128#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-15 06:52:30,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {61128#(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; {61129#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-15 06:52:30,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {61129#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {61130#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:52:30,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {61130#(and (<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 6 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61131#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:52:30,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {61131#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61132#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:52:30,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {61132#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61133#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:52:30,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {61133#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61134#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:52:30,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {61134#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-15 06:52:30,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {61135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61136#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-15 06:52:30,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {61136#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61119#false} is VALID [2022-04-15 06:52:30,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {61119#false} assume !(~y~0 % 4294967296 > 0); {61119#false} is VALID [2022-04-15 06:52:30,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {61119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61119#false} is VALID [2022-04-15 06:52:30,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {61119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61119#false} is VALID [2022-04-15 06:52:30,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {61119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 27: Hoare triple {61119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {61119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {61119#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 30: Hoare triple {61119#false} assume !(~x~0 % 4294967296 > 0); {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {61119#false} assume !(~z~0 % 4294967296 > 0); {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {61119#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {61119#false} assume !(~y~0 % 4294967296 > 0); {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L272 TraceCheckUtils]: 34: Hoare triple {61119#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 35: Hoare triple {61119#false} ~cond := #in~cond; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 36: Hoare triple {61119#false} assume 0 == ~cond; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L290 TraceCheckUtils]: 37: Hoare triple {61119#false} assume !false; {61119#false} is VALID [2022-04-15 06:52:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:52:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:30,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559424591] [2022-04-15 06:52:30,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559424591] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:30,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658290785] [2022-04-15 06:52:30,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:30,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:30,943 INFO L229 MonitoredProcess]: Starting monitored process 43 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:52:30,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 06:52:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:30,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:52:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:31,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:31,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {61118#true} call ULTIMATE.init(); {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {61118#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); {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {61118#true} assume true; {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61118#true} {61118#true} #94#return; {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {61118#true} call #t~ret17 := main(); {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {61118#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {61118#true} [184] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_215| |v_main_#t~post6_214|)) (.cse0 (mod v_main_~x~0_726 4294967296)) (.cse2 (= v_main_~y~0_800 v_main_~y~0_799)) (.cse3 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse4 (= v_main_~x~0_726 v_main_~x~0_725))) (or (and (forall ((v_it_44 Int)) (or (not (<= (+ v_main_~y~0_800 v_it_44 1) v_main_~y~0_799)) (< 0 (mod (+ v_main_~x~0_726 (* 4294967295 v_it_44)) 4294967296)) (not (<= 1 v_it_44)))) (< v_main_~y~0_800 v_main_~y~0_799) (< 0 .cse0) (= v_main_~x~0_725 (+ v_main_~x~0_726 v_main_~y~0_800 (* (- 1) v_main_~y~0_799)))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_800, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_215|} OutVars{main_~y~0=v_main_~y~0_799, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_725, main_#t~post6=|v_main_#t~post6_214|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {61118#true} is VALID [2022-04-15 06:52:31,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {61118#true} [183] 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[] {61118#true} is VALID [2022-04-15 06:52:31,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {61118#true} ~z~0 := ~y~0; {61123#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-15 06:52:31,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {61123#(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; {61124#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 06:52:31,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {61124#(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; {61125#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 06:52:31,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {61125#(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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:31,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:31,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:31,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:31,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:31,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 06:52:31,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 06:52:31,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-15 06:52:31,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-15 06:52:31,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-15 06:52:31,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-15 06:52:31,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-15 06:52:31,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-15 06:52:31,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 06:52:31,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 06:52:31,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,845 INFO L290 TraceCheckUtils]: 29: Hoare triple {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:31,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61119#false} is VALID [2022-04-15 06:52:31,848 INFO L272 TraceCheckUtils]: 34: Hoare triple {61119#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61119#false} is VALID [2022-04-15 06:52:31,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {61119#false} ~cond := #in~cond; {61119#false} is VALID [2022-04-15 06:52:31,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {61119#false} assume 0 == ~cond; {61119#false} is VALID [2022-04-15 06:52:31,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {61119#false} assume !false; {61119#false} is VALID [2022-04-15 06:52:31,848 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:52:31,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:32,488 INFO L290 TraceCheckUtils]: 37: Hoare triple {61119#false} assume !false; {61119#false} is VALID [2022-04-15 06:52:32,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {61119#false} assume 0 == ~cond; {61119#false} is VALID [2022-04-15 06:52:32,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {61119#false} ~cond := #in~cond; {61119#false} is VALID [2022-04-15 06:52:32,489 INFO L272 TraceCheckUtils]: 34: Hoare triple {61119#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {61119#false} is VALID [2022-04-15 06:52:32,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61119#false} is VALID [2022-04-15 06:52:32,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 06:52:32,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 06:52:32,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-15 06:52:32,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-15 06:52:32,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-15 06:52:32,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61214#(< (div (+ 4294967290 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 4) 4294967296) 1))} is VALID [2022-04-15 06:52:32,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61210#(< (div (+ 4294967291 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 3) 4294967296) 1))} is VALID [2022-04-15 06:52:32,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61206#(< (div (+ 4294967292 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 2) 4294967296) 1))} is VALID [2022-04-15 06:52:32,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61202#(< (div (+ (* (- 1) main_~y~0) 4294967293) (- 4294967296)) (+ (div (+ main_~y~0 1) 4294967296) 1))} is VALID [2022-04-15 06:52:32,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61198#(< (div (+ 4294967294 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~y~0 4294967296) 1))} is VALID [2022-04-15 06:52:32,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61194#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {61190#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-15 06:52:32,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:32,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:32,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:32,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:32,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {61338#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61174#(< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1))} is VALID [2022-04-15 06:52:32,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {61342#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61338#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1)))} is VALID [2022-04-15 06:52:32,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {61346#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 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; {61342#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1)))} is VALID [2022-04-15 06:52:32,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {61118#true} ~z~0 := ~y~0; {61346#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< (div (+ 4294967297 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ main_~y~0 (- 3)) 4294967296) 1)))} is VALID [2022-04-15 06:52:32,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {61118#true} [183] 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[] {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {61118#true} [184] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_215| |v_main_#t~post6_214|)) (.cse0 (mod v_main_~x~0_726 4294967296)) (.cse2 (= v_main_~y~0_800 v_main_~y~0_799)) (.cse3 (= |v_main_#t~post5_215| |v_main_#t~post5_214|)) (.cse4 (= v_main_~x~0_726 v_main_~x~0_725))) (or (and (forall ((v_it_44 Int)) (or (not (<= (+ v_main_~y~0_800 v_it_44 1) v_main_~y~0_799)) (< 0 (mod (+ v_main_~x~0_726 (* 4294967295 v_it_44)) 4294967296)) (not (<= 1 v_it_44)))) (< v_main_~y~0_800 v_main_~y~0_799) (< 0 .cse0) (= v_main_~x~0_725 (+ v_main_~x~0_726 v_main_~y~0_800 (* (- 1) v_main_~y~0_799)))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_800, main_#t~post5=|v_main_#t~post5_215|, main_~x~0=v_main_~x~0_726, main_#t~post6=|v_main_#t~post6_215|} OutVars{main_~y~0=v_main_~y~0_799, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_725, main_#t~post6=|v_main_#t~post6_214|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {61118#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {61118#true} call #t~ret17 := main(); {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61118#true} {61118#true} #94#return; {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {61118#true} assume true; {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {61118#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); {61118#true} is VALID [2022-04-15 06:52:32,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {61118#true} call ULTIMATE.init(); {61118#true} is VALID [2022-04-15 06:52:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 53 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 06:52:32,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658290785] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:32,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:32,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 28 [2022-04-15 06:52:32,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:32,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [945478960] [2022-04-15 06:52:32,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [945478960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:32,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:32,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:52:32,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809012144] [2022-04-15 06:52:32,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 42 [2022-04-15 06:52:32,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:32,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:52:33,008 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:52:33,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:52:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:52:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=906, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 06:52:33,009 INFO L87 Difference]: Start difference. First operand 299 states and 393 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:52:49,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:49,240 INFO L93 Difference]: Finished difference Result 716 states and 933 transitions. [2022-04-15 06:52:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:52:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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 42 [2022-04-15 06:52:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:52:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 212 transitions. [2022-04-15 06:52:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:52:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 212 transitions. [2022-04-15 06:52:49,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 212 transitions. [2022-04-15 06:52:49,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:49,667 INFO L225 Difference]: With dead ends: 716 [2022-04-15 06:52:49,667 INFO L226 Difference]: Without dead ends: 442 [2022-04-15 06:52:49,668 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1281, Invalid=7275, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:52:49,668 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 94 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:49,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 113 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 06:52:49,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-04-15 06:52:53,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 303. [2022-04-15 06:52:53,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:53,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 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:52:53,767 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 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:52:53,768 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 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:52:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:53,774 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2022-04-15 06:52:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2022-04-15 06:52:53,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:53,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:53,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 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 442 states. [2022-04-15 06:52:53,775 INFO L87 Difference]: Start difference. First operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 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 442 states. [2022-04-15 06:52:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:53,781 INFO L93 Difference]: Finished difference Result 442 states and 552 transitions. [2022-04-15 06:52:53,781 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 552 transitions. [2022-04-15 06:52:53,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:53,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:53,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:53,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 298 states have (on average 1.3120805369127517) internal successors, (391), 298 states have internal predecessors, (391), 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:52:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 395 transitions. [2022-04-15 06:52:53,786 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 395 transitions. Word has length 42 [2022-04-15 06:52:53,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:53,786 INFO L478 AbstractCegarLoop]: Abstraction has 303 states and 395 transitions. [2022-04-15 06:52:53,786 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 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:52:53,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 303 states and 395 transitions. [2022-04-15 06:53:28,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 395 edges. 392 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:28,066 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 395 transitions. [2022-04-15 06:53:28,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:53:28,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:28,066 INFO L499 BasicCegarLoop]: trace histogram [12, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:28,082 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:28,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:28,267 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:28,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:28,267 INFO L85 PathProgramCache]: Analyzing trace with hash 777159737, now seen corresponding path program 18 times [2022-04-15 06:53:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:28,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996533585] [2022-04-15 06:53:30,382 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:30,504 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:53:30,506 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash -426349737, now seen corresponding path program 1 times [2022-04-15 06:53:30,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:30,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012923055] [2022-04-15 06:53:30,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:30,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:30,517 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:53:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:30,530 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_45.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:53:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:30,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:30,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {64445#(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); {64426#true} is VALID [2022-04-15 06:53:30,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {64426#true} assume true; {64426#true} is VALID [2022-04-15 06:53:30,735 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64426#true} {64426#true} #94#return; {64426#true} is VALID [2022-04-15 06:53:30,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {64426#true} call ULTIMATE.init(); {64445#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:30,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {64445#(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); {64426#true} is VALID [2022-04-15 06:53:30,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {64426#true} assume true; {64426#true} is VALID [2022-04-15 06:53:30,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64426#true} {64426#true} #94#return; {64426#true} is VALID [2022-04-15 06:53:30,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {64426#true} call #t~ret17 := main(); {64426#true} is VALID [2022-04-15 06:53:30,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {64426#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64426#true} is VALID [2022-04-15 06:53:30,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {64426#true} [186] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_750 4294967296))) (or (and (= |v_main_#t~post6_220| |v_main_#t~post6_219|) (= v_main_~y~0_840 v_main_~y~0_839) (= |v_main_#t~post5_220| |v_main_#t~post5_219|) (= v_main_~x~0_750 v_main_~x~0_749)) (and (<= .cse0 0) (= |v_main_#t~post5_219| |v_main_#t~post5_220|) (= |v_main_#t~post6_219| |v_main_#t~post6_220|) (= v_main_~x~0_749 v_main_~x~0_750) (= v_main_~y~0_839 v_main_~y~0_840)) (and (< v_main_~y~0_840 v_main_~y~0_839) (forall ((v_it_45 Int)) (or (< 0 (mod (+ v_main_~x~0_750 (* 4294967295 v_it_45)) 4294967296)) (not (<= (+ v_main_~y~0_840 v_it_45 1) v_main_~y~0_839)) (not (<= 1 v_it_45)))) (= v_main_~x~0_749 (+ v_main_~x~0_750 v_main_~y~0_840 (* (- 1) v_main_~y~0_839))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_840, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_839, main_#t~post5=|v_main_#t~post5_219|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64426#true} is VALID [2022-04-15 06:53:30,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {64426#true} [185] 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[] {64431#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:53:30,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {64431#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {64431#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:53:30,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {64431#(<= 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; {64432#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:53:30,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {64432#(<= 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; {64433#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:30,739 INFO L290 TraceCheckUtils]: 11: Hoare triple {64433#(<= 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; {64434#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:30,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {64434#(<= 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; {64435#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:30,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {64435#(<= 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; {64436#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-15 06:53:30,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {64436#(<= 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; {64437#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:30,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {64437#(<= 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; {64438#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:30,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {64438#(<= 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; {64439#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:53:30,743 INFO L290 TraceCheckUtils]: 17: Hoare triple {64439#(<= 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; {64440#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-15 06:53:30,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {64440#(<= 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; {64441#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-15 06:53:30,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {64441#(<= 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; {64442#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-15 06:53:30,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {64442#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~y~0 % 4294967296 > 0); {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-15 06:53:30,749 INFO L290 TraceCheckUtils]: 29: Hoare triple {64443#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64444#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 30: Hoare triple {64444#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 31: Hoare triple {64427#false} assume !(~z~0 % 4294967296 > 0); {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {64427#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {64427#false} assume !(~y~0 % 4294967296 > 0); {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L272 TraceCheckUtils]: 34: Hoare triple {64427#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {64427#false} ~cond := #in~cond; {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 36: Hoare triple {64427#false} assume 0 == ~cond; {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L290 TraceCheckUtils]: 37: Hoare triple {64427#false} assume !false; {64427#false} is VALID [2022-04-15 06:53:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-15 06:53:30,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:30,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012923055] [2022-04-15 06:53:30,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012923055] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:30,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490627823] [2022-04-15 06:53:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:30,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:30,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:30,752 INFO L229 MonitoredProcess]: Starting monitored process 44 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:53:30,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 06:53:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:30,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:53:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:30,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:31,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {64426#true} call ULTIMATE.init(); {64426#true} is VALID [2022-04-15 06:53:31,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {64426#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); {64426#true} is VALID [2022-04-15 06:53:31,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {64426#true} assume true; {64426#true} is VALID [2022-04-15 06:53:31,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64426#true} {64426#true} #94#return; {64426#true} is VALID [2022-04-15 06:53:31,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {64426#true} call #t~ret17 := main(); {64426#true} is VALID [2022-04-15 06:53:31,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {64426#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64426#true} is VALID [2022-04-15 06:53:31,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {64426#true} [186] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_750 4294967296))) (or (and (= |v_main_#t~post6_220| |v_main_#t~post6_219|) (= v_main_~y~0_840 v_main_~y~0_839) (= |v_main_#t~post5_220| |v_main_#t~post5_219|) (= v_main_~x~0_750 v_main_~x~0_749)) (and (<= .cse0 0) (= |v_main_#t~post5_219| |v_main_#t~post5_220|) (= |v_main_#t~post6_219| |v_main_#t~post6_220|) (= v_main_~x~0_749 v_main_~x~0_750) (= v_main_~y~0_839 v_main_~y~0_840)) (and (< v_main_~y~0_840 v_main_~y~0_839) (forall ((v_it_45 Int)) (or (< 0 (mod (+ v_main_~x~0_750 (* 4294967295 v_it_45)) 4294967296)) (not (<= (+ v_main_~y~0_840 v_it_45 1) v_main_~y~0_839)) (not (<= 1 v_it_45)))) (= v_main_~x~0_749 (+ v_main_~x~0_750 v_main_~y~0_840 (* (- 1) v_main_~y~0_839))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_840, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_839, main_#t~post5=|v_main_#t~post5_219|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64426#true} is VALID [2022-04-15 06:53:31,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {64426#true} [185] 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[] {64426#true} is VALID [2022-04-15 06:53:31,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {64426#true} ~z~0 := ~y~0; {64473#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:53:31,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {64473#(= 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; {64477#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-15 06:53:31,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {64477#(= 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; {64481#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-15 06:53:31,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {64481#(= (+ main_~z~0 1) (+ (- 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; {64485#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:31,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {64485#(= (+ (- 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; {64489#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:31,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {64489#(= (+ main_~y~0 (- 3)) (+ 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; {64493#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:31,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {64493#(= (+ main_~y~0 (- 4)) (+ 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; {64497#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-15 06:53:31,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {64497#(= (+ main_~y~0 (- 5)) (+ 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64523#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {64523#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64527#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {64527#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64531#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:53:31,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {64531#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64535#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:53:31,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {64535#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:53:31,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {64543#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:53:31,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {64543#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {64543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:53:31,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {64543#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64427#false} is VALID [2022-04-15 06:53:31,244 INFO L272 TraceCheckUtils]: 34: Hoare triple {64427#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {64427#false} is VALID [2022-04-15 06:53:31,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {64427#false} ~cond := #in~cond; {64427#false} is VALID [2022-04-15 06:53:31,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {64427#false} assume 0 == ~cond; {64427#false} is VALID [2022-04-15 06:53:31,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {64427#false} assume !false; {64427#false} is VALID [2022-04-15 06:53:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 06:53:31,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:31,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {64427#false} assume !false; {64427#false} is VALID [2022-04-15 06:53:31,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {64427#false} assume 0 == ~cond; {64427#false} is VALID [2022-04-15 06:53:31,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {64427#false} ~cond := #in~cond; {64427#false} is VALID [2022-04-15 06:53:31,689 INFO L272 TraceCheckUtils]: 34: Hoare triple {64427#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {64427#false} is VALID [2022-04-15 06:53:31,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {64543#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64427#false} is VALID [2022-04-15 06:53:31,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {64543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:53:31,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {64543#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {64543#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {64543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:53:31,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64543#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:53:31,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {64535#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64539#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:53:31,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {64531#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64535#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:53:31,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {64527#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64531#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 06:53:31,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {64523#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64527#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64523#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,698 INFO L290 TraceCheckUtils]: 20: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {64501#(< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {64640#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 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; {64501#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 06:53:31,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {64644#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 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; {64640#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:31,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {64648#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 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; {64644#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:31,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {64652#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 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; {64648#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:31,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {64656#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 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; {64652#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:31,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {64660#(or (< 0 (mod (+ 4294967290 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; {64656#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-15 06:53:31,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {64664#(or (< 0 (mod (+ 4294967290 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; {64660#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:53:31,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {64426#true} ~z~0 := ~y~0; {64664#(or (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 06:53:31,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {64426#true} [185] 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[] {64426#true} is VALID [2022-04-15 06:53:31,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {64426#true} [186] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_750 4294967296))) (or (and (= |v_main_#t~post6_220| |v_main_#t~post6_219|) (= v_main_~y~0_840 v_main_~y~0_839) (= |v_main_#t~post5_220| |v_main_#t~post5_219|) (= v_main_~x~0_750 v_main_~x~0_749)) (and (<= .cse0 0) (= |v_main_#t~post5_219| |v_main_#t~post5_220|) (= |v_main_#t~post6_219| |v_main_#t~post6_220|) (= v_main_~x~0_749 v_main_~x~0_750) (= v_main_~y~0_839 v_main_~y~0_840)) (and (< v_main_~y~0_840 v_main_~y~0_839) (forall ((v_it_45 Int)) (or (< 0 (mod (+ v_main_~x~0_750 (* 4294967295 v_it_45)) 4294967296)) (not (<= (+ v_main_~y~0_840 v_it_45 1) v_main_~y~0_839)) (not (<= 1 v_it_45)))) (= v_main_~x~0_749 (+ v_main_~x~0_750 v_main_~y~0_840 (* (- 1) v_main_~y~0_839))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_840, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_750, main_#t~post6=|v_main_#t~post6_220|} OutVars{main_~y~0=v_main_~y~0_839, main_#t~post5=|v_main_#t~post5_219|, main_~x~0=v_main_~x~0_749, main_#t~post6=|v_main_#t~post6_219|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {64426#true} is VALID [2022-04-15 06:53:31,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {64426#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64426#true} is VALID [2022-04-15 06:53:31,706 INFO L272 TraceCheckUtils]: 4: Hoare triple {64426#true} call #t~ret17 := main(); {64426#true} is VALID [2022-04-15 06:53:31,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64426#true} {64426#true} #94#return; {64426#true} is VALID [2022-04-15 06:53:31,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {64426#true} assume true; {64426#true} is VALID [2022-04-15 06:53:31,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {64426#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); {64426#true} is VALID [2022-04-15 06:53:31,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {64426#true} call ULTIMATE.init(); {64426#true} is VALID [2022-04-15 06:53:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 42 proven. 44 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 06:53:31,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490627823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:31,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:31,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 38 [2022-04-15 06:53:32,617 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:32,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996533585] [2022-04-15 06:53:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996533585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:32,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:32,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 06:53:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230011821] [2022-04-15 06:53:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:32,618 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 43 [2022-04-15 06:53:32,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:32,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:53:32,716 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:53:32,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 06:53:32,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:32,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 06:53:32,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1698, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 06:53:32,717 INFO L87 Difference]: Start difference. First operand 303 states and 395 transitions. Second operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:53:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:55,067 INFO L93 Difference]: Finished difference Result 940 states and 1335 transitions. [2022-04-15 06:53:55,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:53:55,068 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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 43 [2022-04-15 06:53:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:55,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:53:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 269 transitions. [2022-04-15 06:53:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:53:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 269 transitions. [2022-04-15 06:53:55,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 269 transitions. [2022-04-15 06:53:55,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:55,696 INFO L225 Difference]: With dead ends: 940 [2022-04-15 06:53:55,696 INFO L226 Difference]: Without dead ends: 813 [2022-04-15 06:53:55,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=563, Invalid=4267, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 06:53:55,697 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 343 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 1754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:55,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 103 Invalid, 1754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:53:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2022-04-15 06:53:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 315. [2022-04-15 06:53:59,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:59,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 813 states. Second operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 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:53:59,899 INFO L74 IsIncluded]: Start isIncluded. First operand 813 states. Second operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 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:53:59,900 INFO L87 Difference]: Start difference. First operand 813 states. Second operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 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:53:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:59,919 INFO L93 Difference]: Finished difference Result 813 states and 1132 transitions. [2022-04-15 06:53:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1132 transitions. [2022-04-15 06:53:59,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:59,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:59,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 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 813 states. [2022-04-15 06:53:59,921 INFO L87 Difference]: Start difference. First operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 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 813 states. [2022-04-15 06:53:59,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:59,940 INFO L93 Difference]: Finished difference Result 813 states and 1132 transitions. [2022-04-15 06:53:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1132 transitions. [2022-04-15 06:53:59,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:59,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:59,941 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:59,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 310 states have (on average 1.3161290322580645) internal successors, (408), 310 states have internal predecessors, (408), 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:53:59,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 412 transitions. [2022-04-15 06:53:59,946 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 412 transitions. Word has length 43 [2022-04-15 06:53:59,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:59,946 INFO L478 AbstractCegarLoop]: Abstraction has 315 states and 412 transitions. [2022-04-15 06:53:59,946 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 22 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:53:59,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 315 states and 412 transitions. [2022-04-15 06:54:32,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 412 edges. 409 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 412 transitions. [2022-04-15 06:54:32,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 06:54:32,885 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:32,885 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:32,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:33,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-15 06:54:33,086 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:33,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:33,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1373145668, now seen corresponding path program 11 times [2022-04-15 06:54:33,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:33,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2690892] [2022-04-15 06:54:33,532 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:54:33,533 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:33,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1373536602, now seen corresponding path program 1 times [2022-04-15 06:54:33,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:33,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954028011] [2022-04-15 06:54:33,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:33,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:33,545 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:54:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:33,561 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_46.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:54:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:33,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {68906#(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); {68888#true} is VALID [2022-04-15 06:54:33,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {68888#true} assume true; {68888#true} is VALID [2022-04-15 06:54:33,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68888#true} {68888#true} #94#return; {68888#true} is VALID [2022-04-15 06:54:33,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {68888#true} call ULTIMATE.init(); {68906#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:33,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {68906#(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); {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {68888#true} assume true; {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68888#true} {68888#true} #94#return; {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {68888#true} call #t~ret17 := main(); {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {68888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {68888#true} [188] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_776 4294967296)) (.cse0 (= |v_main_#t~post5_225| |v_main_#t~post5_224|)) (.cse1 (= v_main_~y~0_868 v_main_~y~0_867)) (.cse2 (= |v_main_#t~post6_225| |v_main_#t~post6_224|)) (.cse4 (= v_main_~x~0_776 v_main_~x~0_775))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (< v_main_~x~0_775 v_main_~x~0_776) (forall ((v_it_46 Int)) (or (< 0 (mod (+ v_main_~x~0_776 (* 4294967295 v_it_46)) 4294967296)) (not (<= (+ v_main_~x~0_775 v_it_46 1) v_main_~x~0_776)) (not (<= 1 v_it_46)))) (= v_main_~y~0_867 (+ v_main_~x~0_776 v_main_~y~0_868 (* v_main_~x~0_775 (- 1))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_225|, main_~x~0=v_main_~x~0_776, main_#t~post6=|v_main_#t~post6_225|} OutVars{main_~y~0=v_main_~y~0_867, main_#t~post5=|v_main_#t~post5_224|, main_~x~0=v_main_~x~0_775, main_#t~post6=|v_main_#t~post6_224|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {68888#true} [187] 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[] {68888#true} is VALID [2022-04-15 06:54:33,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {68888#true} ~z~0 := ~y~0; {68888#true} is VALID [2022-04-15 06:54:33,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68893#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {68893#(<= main_~z~0 (+ 4294967294 (* (div main_~z~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; {68894#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:54:33,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {68894#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 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; {68895#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {68895#(<= main_~z~0 (+ 4294967292 (* (div main_~z~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; {68896#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {68896#(<= main_~z~0 (+ 4294967291 (* (div main_~z~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; {68897#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {68897#(<= main_~z~0 (+ 4294967290 (* (div main_~z~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; {68898#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 06:54:33,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {68898#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !(~z~0 % 4294967296 > 0); {68898#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-15 06:54:33,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {68898#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68899#(<= main_~z~0 (+ 4294967290 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-15 06:54:33,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {68899#(<= main_~z~0 (+ 4294967290 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68900#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967291))} is VALID [2022-04-15 06:54:33,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {68900#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967291))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68901#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {68901#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68902#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 06:54:33,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {68902#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68903#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967294))} is VALID [2022-04-15 06:54:33,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {68903#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-15 06:54:33,754 INFO L290 TraceCheckUtils]: 30: Hoare triple {68904#(<= main_~z~0 (+ 4294967295 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {68905#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-15 06:54:33,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {68905#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {68889#false} is VALID [2022-04-15 06:54:33,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {68889#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68889#false} is VALID [2022-04-15 06:54:33,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {68889#false} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68889#false} is VALID [2022-04-15 06:54:33,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {68889#false} assume !(~y~0 % 4294967296 > 0); {68889#false} is VALID [2022-04-15 06:54:33,754 INFO L272 TraceCheckUtils]: 35: Hoare triple {68889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68889#false} is VALID [2022-04-15 06:54:33,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {68889#false} ~cond := #in~cond; {68889#false} is VALID [2022-04-15 06:54:33,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {68889#false} assume 0 == ~cond; {68889#false} is VALID [2022-04-15 06:54:33,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {68889#false} assume !false; {68889#false} is VALID [2022-04-15 06:54:33,755 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 06:54:33,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:33,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954028011] [2022-04-15 06:54:33,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954028011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:33,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759090647] [2022-04-15 06:54:33,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:33,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:33,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:33,759 INFO L229 MonitoredProcess]: Starting monitored process 45 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:54:33,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 06:54:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:33,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:54:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:33,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:34,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {68888#true} call ULTIMATE.init(); {68888#true} is VALID [2022-04-15 06:54:34,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {68888#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); {68888#true} is VALID [2022-04-15 06:54:34,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {68888#true} assume true; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68888#true} {68888#true} #94#return; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {68888#true} call #t~ret17 := main(); {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 5: Hoare triple {68888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {68888#true} [188] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_776 4294967296)) (.cse0 (= |v_main_#t~post5_225| |v_main_#t~post5_224|)) (.cse1 (= v_main_~y~0_868 v_main_~y~0_867)) (.cse2 (= |v_main_#t~post6_225| |v_main_#t~post6_224|)) (.cse4 (= v_main_~x~0_776 v_main_~x~0_775))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (< v_main_~x~0_775 v_main_~x~0_776) (forall ((v_it_46 Int)) (or (< 0 (mod (+ v_main_~x~0_776 (* 4294967295 v_it_46)) 4294967296)) (not (<= (+ v_main_~x~0_775 v_it_46 1) v_main_~x~0_776)) (not (<= 1 v_it_46)))) (= v_main_~y~0_867 (+ v_main_~x~0_776 v_main_~y~0_868 (* v_main_~x~0_775 (- 1))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_225|, main_~x~0=v_main_~x~0_776, main_#t~post6=|v_main_#t~post6_225|} OutVars{main_~y~0=v_main_~y~0_867, main_#t~post5=|v_main_#t~post5_224|, main_~x~0=v_main_~x~0_775, main_#t~post6=|v_main_#t~post6_224|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {68888#true} [187] 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[] {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {68888#true} ~z~0 := ~y~0; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {68888#true} assume !(~z~0 % 4294967296 > 0); {68888#true} is VALID [2022-04-15 06:54:34,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {68888#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68888#true} is VALID [2022-04-15 06:54:34,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {68888#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68888#true} is VALID [2022-04-15 06:54:34,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {68888#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:54:34,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:54:34,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:54:34,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:54:34,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:54:34,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:54:34,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:54:34,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:54:34,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68992#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:54:34,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {68992#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:54:34,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:54:34,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68992#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:54:34,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {68992#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {68889#false} is VALID [2022-04-15 06:54:34,053 INFO L272 TraceCheckUtils]: 35: Hoare triple {68889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68889#false} is VALID [2022-04-15 06:54:34,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {68889#false} ~cond := #in~cond; {68889#false} is VALID [2022-04-15 06:54:34,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {68889#false} assume 0 == ~cond; {68889#false} is VALID [2022-04-15 06:54:34,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {68889#false} assume !false; {68889#false} is VALID [2022-04-15 06:54:34,054 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 06:54:34,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:34,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {68889#false} assume !false; {68889#false} is VALID [2022-04-15 06:54:34,157 INFO L290 TraceCheckUtils]: 37: Hoare triple {68889#false} assume 0 == ~cond; {68889#false} is VALID [2022-04-15 06:54:34,157 INFO L290 TraceCheckUtils]: 36: Hoare triple {68889#false} ~cond := #in~cond; {68889#false} is VALID [2022-04-15 06:54:34,157 INFO L272 TraceCheckUtils]: 35: Hoare triple {68889#false} call __VERIFIER_assert((if 0 == ~x~0 % 4294967296 then 1 else 0)); {68889#false} is VALID [2022-04-15 06:54:34,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {68992#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {68889#false} is VALID [2022-04-15 06:54:34,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68992#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:54:34,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post15 := ~y~0;~y~0 := #t~post15 - 1;havoc #t~post15;#t~post16 := ~x~0;~x~0 := #t~post16 - 1;havoc #t~post16; {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:54:34,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {69000#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 06:54:34,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {68992#(< 0 (mod main_~y~0 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68996#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 06:54:34,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68992#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:54:34,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:54:34,164 INFO L290 TraceCheckUtils]: 24: Hoare triple {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:54:34,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:54:34,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} assume !(~y~0 % 4294967296 > 0); {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:54:34,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68976#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 06:54:34,167 INFO L290 TraceCheckUtils]: 20: Hoare triple {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68972#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 06:54:34,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68968#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {68888#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68964#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {68888#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {68888#true} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {68888#true} assume !(~z~0 % 4294967296 > 0); {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {68888#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {68888#true} ~z~0 := ~y~0; {68888#true} is VALID [2022-04-15 06:54:34,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {68888#true} [187] 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[] {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {68888#true} [188] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_776 4294967296)) (.cse0 (= |v_main_#t~post5_225| |v_main_#t~post5_224|)) (.cse1 (= v_main_~y~0_868 v_main_~y~0_867)) (.cse2 (= |v_main_#t~post6_225| |v_main_#t~post6_224|)) (.cse4 (= v_main_~x~0_776 v_main_~x~0_775))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< 0 .cse3) (< v_main_~x~0_775 v_main_~x~0_776) (forall ((v_it_46 Int)) (or (< 0 (mod (+ v_main_~x~0_776 (* 4294967295 v_it_46)) 4294967296)) (not (<= (+ v_main_~x~0_775 v_it_46 1) v_main_~x~0_776)) (not (<= 1 v_it_46)))) (= v_main_~y~0_867 (+ v_main_~x~0_776 v_main_~y~0_868 (* v_main_~x~0_775 (- 1))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_225|, main_~x~0=v_main_~x~0_776, main_#t~post6=|v_main_#t~post6_225|} OutVars{main_~y~0=v_main_~y~0_867, main_#t~post5=|v_main_#t~post5_224|, main_~x~0=v_main_~x~0_775, main_#t~post6=|v_main_#t~post6_224|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {68888#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {68888#true} call #t~ret17 := main(); {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68888#true} {68888#true} #94#return; {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {68888#true} assume true; {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {68888#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); {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {68888#true} call ULTIMATE.init(); {68888#true} is VALID [2022-04-15 06:54:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 06:54:34,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759090647] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:34,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:34,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 23 [2022-04-15 06:54:34,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:34,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2690892] [2022-04-15 06:54:34,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2690892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:34,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:34,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 06:54:34,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644698649] [2022-04-15 06:54:34,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:34,586 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 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 44 [2022-04-15 06:54:34,586 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:34,586 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), 21 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:54:34,629 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:54:34,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 06:54:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:34,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 06:54:34,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2022-04-15 06:54:34,629 INFO L87 Difference]: Start difference. First operand 315 states and 412 transitions. Second operand has 22 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 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)