/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-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:41:27,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:41:27,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:41:27,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:41:27,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:41:27,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:41:27,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:41:27,115 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:41:27,120 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:41:27,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:41:27,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:41:27,127 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:41:27,127 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:41:27,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:41:27,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:41:27,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:41:27,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:41:27,132 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:41:27,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:41:27,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:41:27,142 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:41:27,143 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:41:27,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:41:27,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:41:27,146 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:41:27,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:41:27,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:41:27,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:41:27,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:41:27,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:41:27,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:41:27,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:41:27,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:41:27,150 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:41:27,150 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:41:27,151 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:41:27,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:41:27,151 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:41:27,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:41:27,152 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:41:27,152 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:41:27,155 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:41:27,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:41:27,167 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:41:27,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:41:27,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:41:27,168 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:41:27,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:41:27,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:41:27,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:41:27,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:41:27,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:41:27,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:41:27,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:41:27,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:41:27,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:27,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:41:27,170 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:41:27,171 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:41:27,171 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:41:27,171 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-28 03:41:27,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:41:27,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:41:27,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:41:27,368 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:41:27,369 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:41:27,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-28 03:41:27,415 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d68f0f41/e48c9ca23d3c45538cd27e01574e712e/FLAG0f409c9b4 [2022-04-28 03:41:27,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:41:27,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-04-28 03:41:27,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d68f0f41/e48c9ca23d3c45538cd27e01574e712e/FLAG0f409c9b4 [2022-04-28 03:41:28,159 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d68f0f41/e48c9ca23d3c45538cd27e01574e712e [2022-04-28 03:41:28,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:41:28,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:41:28,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:28,163 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:41:28,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:41:28,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,167 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0e5533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28, skipping insertion in model container [2022-04-28 03:41:28,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:41:28,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:41:28,290 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-de52.c[368,381] [2022-04-28 03:41:28,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:28,319 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:41:28,332 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-de52.c[368,381] [2022-04-28 03:41:28,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:28,357 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:41:28,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28 WrapperNode [2022-04-28 03:41:28,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:28,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:41:28,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:41:28,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:41:28,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,393 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:41:28,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:41:28,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:41:28,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:41:28,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (1/1) ... [2022-04-28 03:41:28,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:28,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:28,431 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-28 03:41:28,449 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-28 03:41:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:41:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:41:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:41:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:41:28,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:41:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:41:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:41:28,464 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:41:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:41:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:41:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:41:28,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:41:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:41:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:41:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:41:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:41:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:41:28,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:41:28,513 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:41:28,515 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:41:28,696 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:41:28,712 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:41:28,713 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 03:41:28,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:28 BoogieIcfgContainer [2022-04-28 03:41:28,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:41:28,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:41:28,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:41:28,718 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:41:28,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:41:28" (1/3) ... [2022-04-28 03:41:28,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b449b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:28, skipping insertion in model container [2022-04-28 03:41:28,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:28" (2/3) ... [2022-04-28 03:41:28,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b449b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:28, skipping insertion in model container [2022-04-28 03:41:28,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:28" (3/3) ... [2022-04-28 03:41:28,720 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.c [2022-04-28 03:41:28,730 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:41:28,730 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:41:28,774 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:41:28,780 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7eaf81a1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@715d38ae [2022-04-28 03:41:28,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:41:28,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-28 03:41:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:41:28,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:28,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:28,803 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:28,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:28,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-28 03:41:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:28,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [580787707] [2022-04-28 03:41:28,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:28,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-28 03:41:28,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:28,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867601584] [2022-04-28 03:41:28,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:28,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:28,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 03:41:28,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:41:28,999 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 03:41:29,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:29,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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); {27#true} is VALID [2022-04-28 03:41:29,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:41:29,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 03:41:29,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-28 03:41:29,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-28 03:41:29,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 03:41:29,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-28 03:41:29,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 03:41:29,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 03:41:29,004 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 03:41:29,004 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-28 03:41:29,005 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 03:41:29,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 03:41:29,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:41:29,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:41:29,006 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-28 03:41:29,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:29,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867601584] [2022-04-28 03:41:29,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867601584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:29,009 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:29,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [580787707] [2022-04-28 03:41:29,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [580787707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:29,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749609901] [2022-04-28 03:41:29,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:29,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:41:29,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:29,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:41:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:41:29,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:41:29,069 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,144 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-28 03:41:29,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:41:29,145 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:41:29,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 03:41:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 03:41:29,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-28 03:41:29,220 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-28 03:41:29,225 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:41:29,225 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:41:29,227 INFO L412 NwaCegarLoop]: 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-28 03:41:29,229 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 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-28 03:41:29,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:29,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:41:29,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:41:29,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:29,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,247 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,248 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,250 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 03:41:29,250 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 03:41:29,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:41:29,251 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:41:29,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,253 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 03:41:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 03:41:29,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:29,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-28 03:41:29,256 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-28 03:41:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:29,257 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-28 03:41:29,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-28 03:41:29,292 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-28 03:41:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 03:41:29,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:41:29,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:29,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:29,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:41:29,294 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-28 03:41:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714370670] [2022-04-28 03:41:29,295 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-28 03:41:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:29,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714930271] [2022-04-28 03:41:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(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); {185#true} is VALID [2022-04-28 03:41:29,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 03:41:29,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 03:41:29,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:29,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(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); {185#true} is VALID [2022-04-28 03:41:29,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 03:41:29,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 03:41:29,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-28 03:41:29,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {185#true} is VALID [2022-04-28 03:41:29,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {185#true} assume !(~x~0 % 4294967296 > 0); {185#true} is VALID [2022-04-28 03:41:29,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {185#true} ~z~0 := ~y~0; {185#true} is VALID [2022-04-28 03:41:29,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {185#true} assume !(~z~0 % 4294967296 > 0); {185#true} is VALID [2022-04-28 03:41:29,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {185#true} assume !(~y~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-28 03:41:29,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~x~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-28 03:41:29,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} assume !(~z~0 % 4294967296 > 0); {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} is VALID [2022-04-28 03:41:29,411 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= (+ main_~y~0 (* (div main_~y~0 4294967296) (- 4294967296))) 0)} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:29,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:29,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-28 03:41:29,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-28 03:41:29,413 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-28 03:41:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:29,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714930271] [2022-04-28 03:41:29,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714930271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:29,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:29,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714370670] [2022-04-28 03:41:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714370670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:29,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756439639] [2022-04-28 03:41:29,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:41:29,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:29,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:29,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:29,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:29,439 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,630 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 03:41:29,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:29,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:41:29,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 03:41:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 03:41:29,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 03:41:29,683 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-28 03:41:29,686 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:41:29,686 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:41:29,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-28 03:41:29,689 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:29,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 32 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:29,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:41:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:41:29,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:29,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,701 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,701 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,704 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-28 03:41:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-28 03:41:29,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 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-28 03:41:29,705 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 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-28 03:41:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,708 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2022-04-28 03:41:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-28 03:41:29,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:29,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-04-28 03:41:29,712 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-04-28 03:41:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:29,712 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-04-28 03:41:29,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 30 transitions. [2022-04-28 03:41:29,740 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-28 03:41:29,740 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-04-28 03:41:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:29,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:29,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:29,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:41:29,744 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-28 03:41:29,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1005899069] [2022-04-28 03:41:29,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:41:29,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-28 03:41:29,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:29,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637557536] [2022-04-28 03:41:29,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:29,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(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); {363#true} is VALID [2022-04-28 03:41:29,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 03:41:29,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-28 03:41:29,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:29,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(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); {363#true} is VALID [2022-04-28 03:41:29,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-28 03:41:29,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #83#return; {363#true} is VALID [2022-04-28 03:41:29,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-28 03:41:29,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {363#true} is VALID [2022-04-28 03:41:29,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !(~x~0 % 4294967296 > 0); {363#true} is VALID [2022-04-28 03:41:29,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} ~z~0 := ~y~0; {363#true} is VALID [2022-04-28 03:41:29,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(~z~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:29,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:29,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:29,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {364#false} is VALID [2022-04-28 03:41:29,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {364#false} assume !(~z~0 % 4294967296 > 0); {364#false} is VALID [2022-04-28 03:41:29,842 INFO L272 TraceCheckUtils]: 13: Hoare triple {364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {364#false} is VALID [2022-04-28 03:41:29,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {364#false} ~cond := #in~cond; {364#false} is VALID [2022-04-28 03:41:29,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {364#false} assume 0 == ~cond; {364#false} is VALID [2022-04-28 03:41:29,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-28 03:41:29,843 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-28 03:41:29,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:29,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637557536] [2022-04-28 03:41:29,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637557536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:29,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:29,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1005899069] [2022-04-28 03:41:29,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1005899069] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:29,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:29,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:29,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138770471] [2022-04-28 03:41:29,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:29,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:29,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,858 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-28 03:41:29,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:41:29,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:41:29,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:41:29,860 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,935 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 03:41:29,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:41:29,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:29,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 03:41:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 03:41:29,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-28 03:41:29,961 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-28 03:41:29,962 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:41:29,962 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:41:29,962 INFO L412 NwaCegarLoop]: 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-28 03:41:29,963 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 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-28 03:41:29,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:29,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:41:29,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:41:29,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:29,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,974 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,974 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,975 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-28 03:41:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 03:41:29,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 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-28 03:41:29,976 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 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-28 03:41:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:29,977 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-28 03:41:29,977 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 03:41:29,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:29,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:29,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:29,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:29,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:29,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-04-28 03:41:29,978 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-04-28 03:41:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:29,979 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-04-28 03:41:29,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:29,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 36 transitions. [2022-04-28 03:41:30,008 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-28 03:41:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 03:41:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:30,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:30,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:30,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:41:30,012 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-28 03:41:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [992569644] [2022-04-28 03:41:30,013 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:41:30,013 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-28 03:41:30,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:30,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036358066] [2022-04-28 03:41:30,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:30,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {556#(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); {550#true} is VALID [2022-04-28 03:41:30,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-28 03:41:30,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-28 03:41:30,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {556#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#(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); {550#true} is VALID [2022-04-28 03:41:30,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2022-04-28 03:41:30,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #83#return; {550#true} is VALID [2022-04-28 03:41:30,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret15 := main(); {550#true} is VALID [2022-04-28 03:41:30,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {550#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {550#true} is VALID [2022-04-28 03:41:30,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#true} assume !(~x~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {555#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {555#(<= 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; {551#false} is VALID [2022-04-28 03:41:30,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {551#false} assume !(~x~0 % 4294967296 > 0); {551#false} is VALID [2022-04-28 03:41:30,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {551#false} assume !(~z~0 % 4294967296 > 0); {551#false} is VALID [2022-04-28 03:41:30,094 INFO L272 TraceCheckUtils]: 13: Hoare triple {551#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {551#false} is VALID [2022-04-28 03:41:30,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2022-04-28 03:41:30,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2022-04-28 03:41:30,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {551#false} assume !false; {551#false} is VALID [2022-04-28 03:41:30,094 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-28 03:41:30,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036358066] [2022-04-28 03:41:30,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036358066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:30,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:30,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [992569644] [2022-04-28 03:41:30,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [992569644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:30,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518088162] [2022-04-28 03:41:30,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:30,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,117 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-28 03:41:30,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:41:30,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:41:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:41:30,119 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,216 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2022-04-28 03:41:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:41:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-28 03:41:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-04-28 03:41:30,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-04-28 03:41:30,253 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-28 03:41:30,255 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:41:30,255 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:41:30,255 INFO L412 NwaCegarLoop]: 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-28 03:41:30,257 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:30,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 27 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:30,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:41:30,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 03:41:30,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:30,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 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-28 03:41:30,281 INFO L74 IsIncluded]: Start isIncluded. First operand 32 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-28 03:41:30,281 INFO L87 Difference]: Start difference. First operand 32 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-28 03:41:30,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,283 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 03:41:30,283 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 03:41:30,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,283 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 32 states. [2022-04-28 03:41:30,284 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 32 states. [2022-04-28 03:41:30,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,285 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-04-28 03:41:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 03:41:30,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:30,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:30,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:30,290 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:30,290 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-28 03:41:30,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-04-28 03:41:30,291 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 17 [2022-04-28 03:41:30,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:30,291 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-04-28 03:41:30,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-28 03:41:30,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 43 transitions. [2022-04-28 03:41:30,327 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-28 03:41:30,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-04-28 03:41:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:30,329 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:30,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:30,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:41:30,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:30,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-28 03:41:30,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [58073941] [2022-04-28 03:41:30,611 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-28 03:41:30,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:30,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1460958083, now seen corresponding path program 1 times [2022-04-28 03:41:30,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:30,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823831294] [2022-04-28 03:41:30,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:30,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:30,635 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-28 03:41:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,654 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-28 03:41:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#(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); {775#true} is VALID [2022-04-28 03:41:30,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-28 03:41:30,717 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-28 03:41:30,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {775#true} call ULTIMATE.init(); {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#(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); {775#true} is VALID [2022-04-28 03:41:30,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {775#true} assume true; {775#true} is VALID [2022-04-28 03:41:30,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {775#true} {775#true} #83#return; {775#true} is VALID [2022-04-28 03:41:30,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {775#true} call #t~ret15 := main(); {775#true} is VALID [2022-04-28 03:41:30,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {780#(= main_~y~0 0)} is VALID [2022-04-28 03:41:30,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {780#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:30,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:41:30,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.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_~z~0_12 v_main_~z~0_11)) (.cse4 (mod v_main_~z~0_12 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_11 v_main_~z~0_12 (* (- 1) v_main_~z~0_11)) v_main_~x~0_10) (< v_main_~z~0_11 v_main_~z~0_12) (< 0 .cse4) (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))))))) InVars {main_~x~0=v_main_~x~0_11, 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_10, 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] {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [86] 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[] {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {783#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:30,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {783#(<= 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; {776#false} is VALID [2022-04-28 03:41:30,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#false} assume !(~x~0 % 4294967296 > 0); {776#false} is VALID [2022-04-28 03:41:30,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#false} assume !(~z~0 % 4294967296 > 0); {776#false} is VALID [2022-04-28 03:41:30,723 INFO L272 TraceCheckUtils]: 14: Hoare triple {776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {776#false} is VALID [2022-04-28 03:41:30,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#false} ~cond := #in~cond; {776#false} is VALID [2022-04-28 03:41:30,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#false} assume 0 == ~cond; {776#false} is VALID [2022-04-28 03:41:30,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#false} assume !false; {776#false} is VALID [2022-04-28 03:41:30,723 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-28 03:41:30,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823831294] [2022-04-28 03:41:30,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823831294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:30,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:30,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [58073941] [2022-04-28 03:41:30,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [58073941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225615014] [2022-04-28 03:41:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:30,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:30,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:30,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:30,775 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-28 03:41:30,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:41:30,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:41:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:41:30,776 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,968 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-28 03:41:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:30,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:30,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 03:41:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:30,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-28 03:41:30,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-28 03:41:31,016 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-28 03:41:31,017 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:41:31,017 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:41:31,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 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-28 03:41:31,017 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 29 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:31,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 34 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:31,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:41:31,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:41:31,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:31,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,032 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,032 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,033 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-28 03:41:31,033 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 03:41:31,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:41:31,033 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:41:31,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,034 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-04-28 03:41:31,034 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 03:41:31,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:31,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:31,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-28 03:41:31,035 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 18 [2022-04-28 03:41:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:31,036 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-28 03:41:31,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 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-28 03:41:31,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-28 03:41:31,067 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-28 03:41:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 03:41:31,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:41:31,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:31,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:31,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:41:31,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:31,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:31,068 INFO L85 PathProgramCache]: Analyzing trace with hash 735022287, now seen corresponding path program 1 times [2022-04-28 03:41:31,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048990150] [2022-04-28 03:41:31,266 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-28 03:41:31,268 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:31,271 INFO L85 PathProgramCache]: Analyzing trace with hash 932024430, now seen corresponding path program 1 times [2022-04-28 03:41:31,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:31,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423643172] [2022-04-28 03:41:31,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:31,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:31,281 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-28 03:41:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:31,291 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-28 03:41:31,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:31,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {994#(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); {987#true} is VALID [2022-04-28 03:41:31,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#true} assume true; {987#true} is VALID [2022-04-28 03:41:31,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {987#true} {987#true} #83#return; {987#true} is VALID [2022-04-28 03:41:31,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {987#true} call ULTIMATE.init(); {994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:31,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {994#(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); {987#true} is VALID [2022-04-28 03:41:31,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {987#true} assume true; {987#true} is VALID [2022-04-28 03:41:31,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {987#true} {987#true} #83#return; {987#true} is VALID [2022-04-28 03:41:31,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {987#true} call #t~ret15 := main(); {987#true} is VALID [2022-04-28 03:41:31,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {987#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {987#true} is VALID [2022-04-28 03:41:31,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {987#true} [89] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse1 (= v_main_~x~0_19 v_main_~x~0_18)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_16 v_main_~y~0_15)) (.cse4 (mod v_main_~x~0_19 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~y~0_16 v_main_~y~0_15) (< 0 .cse4) (= v_main_~x~0_18 (+ v_main_~x~0_19 v_main_~y~0_16 (* (- 1) v_main_~y~0_15))) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_19 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_16 v_it_2 1) v_main_~y~0_15))))))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_19, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_18, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {987#true} is VALID [2022-04-28 03:41:31,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#true} [88] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {987#true} is VALID [2022-04-28 03:41:31,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {987#true} ~z~0 := ~y~0; {992#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:31,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {992#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !(~z~0 % 4294967296 > 0); {993#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:31,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {993#(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; {988#false} is VALID [2022-04-28 03:41:31,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {988#false} assume !(~y~0 % 4294967296 > 0); {988#false} is VALID [2022-04-28 03:41:31,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {988#false} assume !(~x~0 % 4294967296 > 0); {988#false} is VALID [2022-04-28 03:41:31,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {988#false} is VALID [2022-04-28 03:41:31,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {988#false} assume !(~z~0 % 4294967296 > 0); {988#false} is VALID [2022-04-28 03:41:31,327 INFO L272 TraceCheckUtils]: 15: Hoare triple {988#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {988#false} is VALID [2022-04-28 03:41:31,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#false} ~cond := #in~cond; {988#false} is VALID [2022-04-28 03:41:31,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {988#false} assume 0 == ~cond; {988#false} is VALID [2022-04-28 03:41:31,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {988#false} assume !false; {988#false} is VALID [2022-04-28 03:41:31,328 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-28 03:41:31,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:31,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423643172] [2022-04-28 03:41:31,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423643172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:31,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:31,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:31,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:31,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048990150] [2022-04-28 03:41:31,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048990150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:31,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:31,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:31,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158498015] [2022-04-28 03:41:31,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:31,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:31,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:31,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:31,397 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,548 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 03:41:31,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:31,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:31,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 03:41:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 03:41:31,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 03:41:31,574 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-28 03:41:31,574 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:41:31,574 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:41:31,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 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-28 03:41:31,575 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:31,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:41:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:41:31,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:31,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,587 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,588 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,588 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-28 03:41:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-28 03:41:31,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:41:31,589 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:41:31,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,589 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-04-28 03:41:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-28 03:41:31,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:31,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:31,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-28 03:41:31,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-28 03:41:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:31,591 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-28 03:41:31,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-28 03:41:31,616 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-28 03:41:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-28 03:41:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:41:31,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:31,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:31,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:41:31,617 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:31,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:31,617 INFO L85 PathProgramCache]: Analyzing trace with hash -528072081, now seen corresponding path program 1 times [2022-04-28 03:41:31,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [866383411] [2022-04-28 03:41:35,702 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:41:35,838 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-28 03:41:35,840 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:35,842 INFO L85 PathProgramCache]: Analyzing trace with hash -659710514, now seen corresponding path program 1 times [2022-04-28 03:41:35,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:35,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674717601] [2022-04-28 03:41:35,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:35,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:35,850 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-28 03:41:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,875 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-28 03:41:35,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {1183#(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); {1175#true} is VALID [2022-04-28 03:41:35,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-28 03:41:35,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-28 03:41:35,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:35,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#(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); {1175#true} is VALID [2022-04-28 03:41:35,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-28 03:41:35,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-28 03:41:35,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2022-04-28 03:41:35,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#true} is VALID [2022-04-28 03:41:35,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse0 (mod v_main_~x~0_26 4294967296))) (or (and (= v_main_~y~0_23 (+ v_main_~x~0_26 v_main_~y~0_24 (* (- 1) v_main_~x~0_25))) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse0) (< v_main_~x~0_25 v_main_~x~0_26)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1175#true} is VALID [2022-04-28 03:41:35,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-28 03:41:35,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} ~z~0 := ~y~0; {1180#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:35,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(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; {1181#(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-28 03:41:35,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(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); {1182#(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-28 03:41:35,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(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); {1176#false} is VALID [2022-04-28 03:41:35,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#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; {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !(~x~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !(~z~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L272 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-28 03:41:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:35,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:35,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674717601] [2022-04-28 03:41:35,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674717601] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:35,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843967225] [2022-04-28 03:41:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:35,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:35,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:35,951 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-28 03:41:35,952 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-28 03:41:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 03:41:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:36,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2022-04-28 03:41:36,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#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); {1175#true} is VALID [2022-04-28 03:41:36,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-28 03:41:36,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-28 03:41:36,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2022-04-28 03:41:36,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#true} is VALID [2022-04-28 03:41:36,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse0 (mod v_main_~x~0_26 4294967296))) (or (and (= v_main_~y~0_23 (+ v_main_~x~0_26 v_main_~y~0_24 (* (- 1) v_main_~x~0_25))) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse0) (< v_main_~x~0_25 v_main_~x~0_26)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1175#true} is VALID [2022-04-28 03:41:36,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-28 03:41:36,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} ~z~0 := ~y~0; {1180#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:36,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(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; {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:41:36,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:41:36,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:36,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#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; {1176#false} is VALID [2022-04-28 03:41:36,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !(~x~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:36,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !(~z~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:36,746 INFO L272 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1176#false} is VALID [2022-04-28 03:41:36,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-28 03:41:36,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-28 03:41:36,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-28 03:41:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:36,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:37,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {1176#false} assume !false; {1176#false} is VALID [2022-04-28 03:41:37,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {1176#false} assume 0 == ~cond; {1176#false} is VALID [2022-04-28 03:41:37,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {1176#false} ~cond := #in~cond; {1176#false} is VALID [2022-04-28 03:41:37,125 INFO L272 TraceCheckUtils]: 15: Hoare triple {1176#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1176#false} is VALID [2022-04-28 03:41:37,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {1176#false} assume !(~z~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:37,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {1176#false} assume !(~x~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:37,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {1176#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; {1176#false} is VALID [2022-04-28 03:41:37,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1176#false} is VALID [2022-04-28 03:41:37,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:41:37,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {1269#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 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; {1214#(< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:41:37,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#true} ~z~0 := ~y~0; {1269#(or (not (< 0 (mod main_~z~0 4294967296))) (< (div (+ 4294967295 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 1) main_~y~0) 4294967296) 1)))} is VALID [2022-04-28 03:41:37,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {1175#true} [90] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {1175#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse3 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse4 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse0 (mod v_main_~x~0_26 4294967296))) (or (and (= v_main_~y~0_23 (+ v_main_~x~0_26 v_main_~y~0_24 (* (- 1) v_main_~x~0_25))) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse0) (< v_main_~x~0_25 v_main_~x~0_26)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {1175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L272 TraceCheckUtils]: 4: Hoare triple {1175#true} call #t~ret15 := main(); {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1175#true} {1175#true} #83#return; {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {1175#true} assume true; {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {1175#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); {1175#true} is VALID [2022-04-28 03:41:37,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {1175#true} call ULTIMATE.init(); {1175#true} is VALID [2022-04-28 03:41:37,129 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-28 03:41:37,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843967225] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:37,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:41:37,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-04-28 03:41:37,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:37,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [866383411] [2022-04-28 03:41:37,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [866383411] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:37,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:37,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:37,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028780884] [2022-04-28 03:41:37,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:37,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:37,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:37,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:41:37,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:37,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:41:37,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:37,173 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,284 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 03:41:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:41:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:41:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-28 03:41:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-04-28 03:41:37,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-04-28 03:41:37,310 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-28 03:41:37,311 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:41:37,311 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:41:37,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:41:37,312 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:37,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:41:37,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:41:37,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:37,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,330 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,330 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,330 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 03:41:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:41:37,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:37,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:37,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:41:37,331 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:41:37,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,331 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 03:41:37,331 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:41:37,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:37,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:37,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:37,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:37,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 03:41:37,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 19 [2022-04-28 03:41:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:37,333 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 03:41:37,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:37,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 03:41:37,358 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-28 03:41:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:41:37,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:37,359 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:37,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:37,380 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-28 03:41:37,559 WARN L477 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-28 03:41:37,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 342490275, now seen corresponding path program 1 times [2022-04-28 03:41:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:37,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558355749] [2022-04-28 03:41:37,741 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-28 03:41:37,742 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:37,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1041257116, now seen corresponding path program 1 times [2022-04-28 03:41:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:37,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467947969] [2022-04-28 03:41:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:37,753 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-28 03:41:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,768 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-28 03:41:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:37,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,797 INFO L290 TraceCheckUtils]: 0: Hoare triple {1457#(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); {1450#true} is VALID [2022-04-28 03:41:37,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-28 03:41:37,797 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-28 03:41:37,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:37,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {1457#(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); {1450#true} is VALID [2022-04-28 03:41:37,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-28 03:41:37,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-28 03:41:37,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret15 := main(); {1450#true} is VALID [2022-04-28 03:41:37,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1450#true} is VALID [2022-04-28 03:41:37,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse4 (mod v_main_~x~0_35 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_4 Int)) (or (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_34 v_it_4 1) v_main_~x~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_31 (+ v_main_~x~0_35 v_main_~y~0_32 (* (- 1) v_main_~x~0_34))) (< v_main_~x~0_34 v_main_~x~0_35)))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1450#true} is VALID [2022-04-28 03:41:37,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:37,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:37,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {1455#(<= 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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:37,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:37,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {1456#(<= (+ (* 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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:37,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:37,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-28 03:41:37,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1451#false} is VALID [2022-04-28 03:41:37,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#false} assume !(~z~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-28 03:41:37,802 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1451#false} is VALID [2022-04-28 03:41:37,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2022-04-28 03:41:37,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2022-04-28 03:41:37,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2022-04-28 03:41:37,802 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-28 03:41:37,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:37,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467947969] [2022-04-28 03:41:37,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467947969] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:37,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300019286] [2022-04-28 03:41:37,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:37,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:37,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:37,804 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-28 03:41:37,805 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-28 03:41:37,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 03:41:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:38,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2022-04-28 03:41:38,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {1450#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); {1450#true} is VALID [2022-04-28 03:41:38,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-28 03:41:38,066 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-28 03:41:38,066 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret15 := main(); {1450#true} is VALID [2022-04-28 03:41:38,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1450#true} is VALID [2022-04-28 03:41:38,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse4 (mod v_main_~x~0_35 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_4 Int)) (or (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_34 v_it_4 1) v_main_~x~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_31 (+ v_main_~x~0_35 v_main_~y~0_32 (* (- 1) v_main_~x~0_34))) (< v_main_~x~0_34 v_main_~x~0_35)))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1450#true} is VALID [2022-04-28 03:41:38,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:38,067 INFO L290 TraceCheckUtils]: 8: Hoare triple {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1455#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:38,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {1455#(<= 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; {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {1488#(<= 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; {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:38,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {1488#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-28 03:41:38,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1451#false} is VALID [2022-04-28 03:41:38,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#false} assume !(~z~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-28 03:41:38,070 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1451#false} is VALID [2022-04-28 03:41:38,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2022-04-28 03:41:38,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2022-04-28 03:41:38,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2022-04-28 03:41:38,070 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-28 03:41:38,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:38,282 INFO L290 TraceCheckUtils]: 19: Hoare triple {1451#false} assume !false; {1451#false} is VALID [2022-04-28 03:41:38,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1451#false} assume 0 == ~cond; {1451#false} is VALID [2022-04-28 03:41:38,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1451#false} ~cond := #in~cond; {1451#false} is VALID [2022-04-28 03:41:38,283 INFO L272 TraceCheckUtils]: 16: Hoare triple {1451#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1451#false} is VALID [2022-04-28 03:41:38,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {1451#false} assume !(~z~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-28 03:41:38,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {1451#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {1451#false} is VALID [2022-04-28 03:41:38,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1451#false} is VALID [2022-04-28 03:41:38,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {1456#(<= (+ (* 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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1549#(<= (* (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; {1456#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:38,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:41:38,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {1450#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1549#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:41:38,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {1450#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse1 (= v_main_~x~0_35 v_main_~x~0_34)) (.cse2 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse3 (= v_main_~y~0_32 v_main_~y~0_31)) (.cse4 (mod v_main_~x~0_35 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_4 Int)) (or (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_34 v_it_4 1) v_main_~x~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_35) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_31 (+ v_main_~x~0_35 v_main_~y~0_32 (* (- 1) v_main_~x~0_34))) (< v_main_~x~0_34 v_main_~x~0_35)))) InVars {main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_31, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1450#true} is VALID [2022-04-28 03:41:38,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1450#true} is VALID [2022-04-28 03:41:38,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#true} call #t~ret15 := main(); {1450#true} is VALID [2022-04-28 03:41:38,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#true} {1450#true} #83#return; {1450#true} is VALID [2022-04-28 03:41:38,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#true} assume true; {1450#true} is VALID [2022-04-28 03:41:38,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {1450#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); {1450#true} is VALID [2022-04-28 03:41:38,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {1450#true} call ULTIMATE.init(); {1450#true} is VALID [2022-04-28 03:41:38,288 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-28 03:41:38,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300019286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:38,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:38,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:41:38,344 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:38,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558355749] [2022-04-28 03:41:38,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558355749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:38,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:38,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:38,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138651562] [2022-04-28 03:41:38,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:38,345 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-28 03:41:38,345 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:38,345 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-28 03:41:38,360 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-28 03:41:38,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:38,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:38,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:38,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:41:38,361 INFO L87 Difference]: Start difference. First operand 22 states and 27 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-28 03:41:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:38,554 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2022-04-28 03:41:38,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:38,555 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-28 03:41:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:38,555 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-28 03:41:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-28 03:41:38,556 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-28 03:41:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-28 03:41:38,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-28 03:41:38,590 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-28 03:41:38,590 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:41:38,591 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:41:38,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 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-28 03:41:38,591 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:38,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:38,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:41:38,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 03:41:38,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:38,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 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-28 03:41:38,613 INFO L74 IsIncluded]: Start isIncluded. First operand 30 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-28 03:41:38,613 INFO L87 Difference]: Start difference. First operand 30 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-28 03:41:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:38,614 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-04-28 03:41:38,614 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 03:41:38,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:38,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:38,615 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 30 states. [2022-04-28 03:41:38,615 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 30 states. [2022-04-28 03:41:38,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:38,615 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-04-28 03:41:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 03:41:38,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:38,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:38,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:38,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:38,616 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-28 03:41:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-04-28 03:41:38,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 20 [2022-04-28 03:41:38,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:38,617 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-04-28 03:41:38,617 INFO L496 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-28 03:41:38,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 35 transitions. [2022-04-28 03:41:38,656 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-28 03:41:38,657 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-04-28 03:41:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:38,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:38,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:38,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:41:38,857 WARN L477 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-28 03:41:38,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-28 03:41:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:38,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1568636665] [2022-04-28 03:41:39,053 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-28 03:41:39,055 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1236351981, now seen corresponding path program 1 times [2022-04-28 03:41:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:39,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051443848] [2022-04-28 03:41:39,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:39,066 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-28 03:41:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,090 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-28 03:41:39,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1782#(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); {1775#true} is VALID [2022-04-28 03:41:39,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 03:41:39,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-28 03:41:39,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:39,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1782#(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); {1775#true} is VALID [2022-04-28 03:41:39,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 03:41:39,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-28 03:41:39,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret15 := main(); {1775#true} is VALID [2022-04-28 03:41:39,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1775#true} is VALID [2022-04-28 03:41:39,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (mod v_main_~x~0_44 4294967296)) (.cse1 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse2 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_43 (+ v_main_~x~0_44 v_main_~y~0_41 (* (- 1) v_main_~y~0_40))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_41 v_it_5 1) v_main_~y~0_40)) (not (<= 1 v_it_5)))) (< 0 .cse4) (< v_main_~y~0_41 v_main_~y~0_40)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1775#true} is VALID [2022-04-28 03:41:39,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1775#true} is VALID [2022-04-28 03:41:39,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} ~z~0 := ~y~0; {1775#true} is VALID [2022-04-28 03:41:39,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#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; {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= 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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(<= (+ (* (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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1776#false} is VALID [2022-04-28 03:41:39,148 INFO L272 TraceCheckUtils]: 16: Hoare triple {1776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-28 03:41:39,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-28 03:41:39,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 03:41:39,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 03:41:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:39,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:39,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051443848] [2022-04-28 03:41:39,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051443848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:39,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218160876] [2022-04-28 03:41:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:39,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:39,151 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-28 03:41:39,152 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-28 03:41:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:39,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:39,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 03:41:39,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 03:41:39,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 03:41:39,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-28 03:41:39,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret15 := main(); {1775#true} is VALID [2022-04-28 03:41:39,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1775#true} is VALID [2022-04-28 03:41:39,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (mod v_main_~x~0_44 4294967296)) (.cse1 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse2 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_43 (+ v_main_~x~0_44 v_main_~y~0_41 (* (- 1) v_main_~y~0_40))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_41 v_it_5 1) v_main_~y~0_40)) (not (<= 1 v_it_5)))) (< 0 .cse4) (< v_main_~y~0_41 v_main_~y~0_40)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1775#true} is VALID [2022-04-28 03:41:39,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1775#true} is VALID [2022-04-28 03:41:39,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} ~z~0 := ~y~0; {1775#true} is VALID [2022-04-28 03:41:39,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#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; {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,379 INFO L290 TraceCheckUtils]: 10: Hoare triple {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= 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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(<= (+ (* (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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1776#false} is VALID [2022-04-28 03:41:39,382 INFO L272 TraceCheckUtils]: 16: Hoare triple {1776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-28 03:41:39,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-28 03:41:39,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 03:41:39,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 03:41:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:39,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:39,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-28 03:41:39,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {1776#false} assume 0 == ~cond; {1776#false} is VALID [2022-04-28 03:41:39,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {1776#false} ~cond := #in~cond; {1776#false} is VALID [2022-04-28 03:41:39,453 INFO L272 TraceCheckUtils]: 16: Hoare triple {1776#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {1776#false} is VALID [2022-04-28 03:41:39,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {1776#false} is VALID [2022-04-28 03:41:39,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {1781#(<= (+ (* (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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {1780#(<= 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; {1781#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:39,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#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; {1780#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:39,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} ~z~0 := ~y~0; {1775#true} is VALID [2022-04-28 03:41:39,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1775#true} is VALID [2022-04-28 03:41:39,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {1775#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_41 v_main_~y~0_40)) (.cse4 (mod v_main_~x~0_44 4294967296)) (.cse1 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse2 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse3 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_43 (+ v_main_~x~0_44 v_main_~y~0_41 (* (- 1) v_main_~y~0_40))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_41 v_it_5 1) v_main_~y~0_40)) (not (<= 1 v_it_5)))) (< 0 .cse4) (< v_main_~y~0_41 v_main_~y~0_40)) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_40, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1775#true} is VALID [2022-04-28 03:41:39,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1775#true} is VALID [2022-04-28 03:41:39,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret15 := main(); {1775#true} is VALID [2022-04-28 03:41:39,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #83#return; {1775#true} is VALID [2022-04-28 03:41:39,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-28 03:41:39,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#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); {1775#true} is VALID [2022-04-28 03:41:39,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-28 03:41:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:39,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218160876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:39,458 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:39,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:41:39,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:39,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1568636665] [2022-04-28 03:41:39,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1568636665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:39,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:39,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065920706] [2022-04-28 03:41:39,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:39,519 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-28 03:41:39,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:39,519 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-28 03:41:39,534 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-28 03:41:39,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:39,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:39,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:39,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:39,534 INFO L87 Difference]: Start difference. First operand 27 states and 35 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-28 03:41:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,771 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-28 03:41:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:41:39,771 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-28 03:41:39,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:39,771 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-28 03:41:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 03:41:39,779 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-28 03:41:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2022-04-28 03:41:39,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2022-04-28 03:41:39,822 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-28 03:41:39,823 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:41:39,823 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:41:39,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 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-28 03:41:39,823 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:39,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:39,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:41:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-04-28 03:41:39,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:39,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,856 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,856 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,857 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-28 03:41:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-28 03:41:39,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:39,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:39,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:41:39,857 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:41:39,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:39,858 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-28 03:41:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-04-28 03:41:39,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:39,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:39,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:39,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:39,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-04-28 03:41:39,859 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 20 [2022-04-28 03:41:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:39,859 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-04-28 03:41:39,859 INFO L496 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-28 03:41:39,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 42 transitions. [2022-04-28 03:41:39,911 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-28 03:41:39,911 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-04-28 03:41:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:39,912 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:39,912 INFO L195 NwaCegarLoop]: 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-28 03:41:39,929 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-28 03:41:40,112 WARN L477 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-28 03:41:40,112 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-28 03:41:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:40,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [35394868] [2022-04-28 03:41:40,329 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-28 03:41:40,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1928691568, now seen corresponding path program 1 times [2022-04-28 03:41:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041953251] [2022-04-28 03:41:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:40,346 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-28 03:41:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,358 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-28 03:41:40,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {2138#(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); {2126#true} is VALID [2022-04-28 03:41:40,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:40,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-28 03:41:40,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2138#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:40,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2138#(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); {2126#true} is VALID [2022-04-28 03:41:40,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:40,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-28 03:41:40,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret15 := main(); {2126#true} is VALID [2022-04-28 03:41:40,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-28 03:41:40,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (= v_main_~y~0_50 v_main_~y~0_49)) (.cse0 (mod v_main_~x~0_53 4294967296)) (.cse3 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_50 v_it_6 1) v_main_~y~0_49)) (< 0 (mod (+ v_main_~x~0_53 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< v_main_~y~0_50 v_main_~y~0_49) (= (+ v_main_~x~0_53 v_main_~y~0_50 (* (- 1) v_main_~y~0_49)) v_main_~x~0_52)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_49, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-28 03:41:40,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2126#true} is VALID [2022-04-28 03:41:40,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {2126#true} ~z~0 := ~y~0; {2131#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:40,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(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; {2132#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:40,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {2132#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2133#(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-28 03:41:40,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {2133#(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; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(<= 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; {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:40,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:40,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,464 INFO L272 TraceCheckUtils]: 17: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2136#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:40,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {2136#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2137#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:40,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {2137#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 03:41:40,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 03:41:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:40,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:40,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041953251] [2022-04-28 03:41:40,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041953251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:40,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989850491] [2022-04-28 03:41:40,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:40,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:40,466 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-28 03:41:40,467 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-28 03:41:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:41:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:40,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-28 03:41:40,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#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); {2126#true} is VALID [2022-04-28 03:41:40,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:40,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-28 03:41:40,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret15 := main(); {2126#true} is VALID [2022-04-28 03:41:40,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-28 03:41:40,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (= v_main_~y~0_50 v_main_~y~0_49)) (.cse0 (mod v_main_~x~0_53 4294967296)) (.cse3 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_50 v_it_6 1) v_main_~y~0_49)) (< 0 (mod (+ v_main_~x~0_53 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< v_main_~y~0_50 v_main_~y~0_49) (= (+ v_main_~x~0_53 v_main_~y~0_50 (* (- 1) v_main_~y~0_49)) v_main_~x~0_52)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_49, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-28 03:41:40,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2126#true} is VALID [2022-04-28 03:41:40,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {2126#true} ~z~0 := ~y~0; {2131#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:40,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {2131#(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; {2126#true} is VALID [2022-04-28 03:41:40,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(~z~0 % 4294967296 > 0); {2126#true} is VALID [2022-04-28 03:41:40,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#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; {2126#true} is VALID [2022-04-28 03:41:40,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {2126#true} assume !(~y~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(<= 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; {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:40,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:40,741 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,742 INFO L272 TraceCheckUtils]: 17: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:40,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:40,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 03:41:40,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 03:41:40,743 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-28 03:41:40,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:40,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {2127#false} assume !false; {2127#false} is VALID [2022-04-28 03:41:40,849 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2127#false} is VALID [2022-04-28 03:41:40,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2197#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:40,850 INFO L272 TraceCheckUtils]: 17: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2193#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:40,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:40,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {2134#(<= 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; {2135#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:40,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {2126#true} assume !(~y~0 % 4294967296 > 0); {2134#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {2126#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; {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#true} assume !(~z~0 % 4294967296 > 0); {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {2126#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; {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {2126#true} ~z~0 := ~y~0; {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {2126#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {2126#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_53 v_main_~x~0_52)) (.cse2 (= v_main_~y~0_50 v_main_~y~0_49)) (.cse0 (mod v_main_~x~0_53 4294967296)) (.cse3 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|))) (or (and (< 0 .cse0) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_50 v_it_6 1) v_main_~y~0_49)) (< 0 (mod (+ v_main_~x~0_53 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< v_main_~y~0_50 v_main_~y~0_49) (= (+ v_main_~x~0_53 v_main_~y~0_50 (* (- 1) v_main_~y~0_49)) v_main_~x~0_52)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_53, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_49, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {2126#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {2126#true} call #t~ret15 := main(); {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2126#true} {2126#true} #83#return; {2126#true} is VALID [2022-04-28 03:41:40,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {2126#true} assume true; {2126#true} is VALID [2022-04-28 03:41:40,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {2126#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); {2126#true} is VALID [2022-04-28 03:41:40,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {2126#true} call ULTIMATE.init(); {2126#true} is VALID [2022-04-28 03:41:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:40,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989850491] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:40,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:40,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 12 [2022-04-28 03:41:40,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:40,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [35394868] [2022-04-28 03:41:40,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [35394868] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:40,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:40,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:41:40,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296158732] [2022-04-28 03:41:40,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:40,879 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:40,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:40,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:40,896 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-28 03:41:40,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:41:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:41:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:41:40,897 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:41,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:41,517 INFO L93 Difference]: Finished difference Result 68 states and 96 transitions. [2022-04-28 03:41:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:41:41,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 03:41:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 58 transitions. [2022-04-28 03:41:41,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 58 transitions. [2022-04-28 03:41:41,570 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-28 03:41:41,571 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:41:41,571 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:41:41,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:41:41,572 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:41,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 50 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:41:41,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:41:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-04-28 03:41:41,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:41,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,641 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,641 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:41,642 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-28 03:41:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2022-04-28 03:41:41,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:41,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:41,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:41:41,643 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:41:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:41,649 INFO L93 Difference]: Finished difference Result 45 states and 61 transitions. [2022-04-28 03:41:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2022-04-28 03:41:41,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:41,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:41,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:41,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 37 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-04-28 03:41:41,650 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 21 [2022-04-28 03:41:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:41,650 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-04-28 03:41:41,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 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-28 03:41:41,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 58 transitions. [2022-04-28 03:41:41,740 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-28 03:41:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-04-28 03:41:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:41:41,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:41,741 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:41,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:41:41,941 WARN L477 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-28 03:41:41,942 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-04-28 03:41:41,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:41,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006413083] [2022-04-28 03:41:42,117 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-28 03:41:42,119 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:42,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1926333389, now seen corresponding path program 1 times [2022-04-28 03:41:42,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:42,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638488647] [2022-04-28 03:41:42,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:42,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:42,134 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-28 03:41:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:42,158 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:42,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {2611#(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); {2600#true} is VALID [2022-04-28 03:41:42,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-28 03:41:42,282 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-28 03:41:42,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2611#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:42,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2611#(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); {2600#true} is VALID [2022-04-28 03:41:42,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-28 03:41:42,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-28 03:41:42,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret15 := main(); {2600#true} is VALID [2022-04-28 03:41:42,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2605#(= main_~y~0 0)} is VALID [2022-04-28 03:41:42,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {2605#(= main_~y~0 0)} [99] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse0 (mod v_main_~x~0_61 4294967296)) (.cse2 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_62 (* (- 1) v_main_~y~0_61))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_62 v_it_7 1) v_main_~y~0_61)) (not (<= 1 v_it_7)))) (< 0 .cse0) (< v_main_~y~0_62 v_main_~y~0_61)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2606#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:41:42,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {2606#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2607#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 03:41:42,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2607#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {2608#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-28 03:41:42,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2608#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2600#true} is VALID [2022-04-28 03:41:42,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {2600#true} assume !(~z~0 % 4294967296 > 0); {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:41:42,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {2609#(<= (* (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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:41:42,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2601#false} is VALID [2022-04-28 03:41:42,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#false} assume !(~z~0 % 4294967296 > 0); {2601#false} is VALID [2022-04-28 03:41:42,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-28 03:41:42,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-28 03:41:42,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-28 03:41:42,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-28 03:41:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:42,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638488647] [2022-04-28 03:41:42,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638488647] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:42,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542466851] [2022-04-28 03:41:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:42,301 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-28 03:41:42,302 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-28 03:41:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:42,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:41:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:42,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:42,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2022-04-28 03:41:42,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#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); {2600#true} is VALID [2022-04-28 03:41:42,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-28 03:41:42,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-28 03:41:42,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret15 := main(); {2600#true} is VALID [2022-04-28 03:41:42,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2600#true} is VALID [2022-04-28 03:41:42,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {2600#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse0 (mod v_main_~x~0_61 4294967296)) (.cse2 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_62 (* (- 1) v_main_~y~0_61))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_62 v_it_7 1) v_main_~y~0_61)) (not (<= 1 v_it_7)))) (< 0 .cse0) (< v_main_~y~0_62 v_main_~y~0_61)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2600#true} is VALID [2022-04-28 03:41:42,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {2600#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2600#true} is VALID [2022-04-28 03:41:42,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {2600#true} ~z~0 := ~y~0; {2639#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:42,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {2639#(= 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; {2643#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:41:42,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {2643#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {2643#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:41:42,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {2643#(= 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; {2650#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:41:42,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {2650#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:41:42,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2601#false} is VALID [2022-04-28 03:41:42,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#false} assume !(~z~0 % 4294967296 > 0); {2601#false} is VALID [2022-04-28 03:41:42,549 INFO L272 TraceCheckUtils]: 18: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-28 03:41:42,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-28 03:41:42,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-28 03:41:42,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-28 03:41:42,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:42,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:42,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {2601#false} assume !false; {2601#false} is VALID [2022-04-28 03:41:42,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {2601#false} assume 0 == ~cond; {2601#false} is VALID [2022-04-28 03:41:42,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#false} ~cond := #in~cond; {2601#false} is VALID [2022-04-28 03:41:42,872 INFO L272 TraceCheckUtils]: 18: Hoare triple {2601#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {2601#false} is VALID [2022-04-28 03:41:42,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {2601#false} assume !(~z~0 % 4294967296 > 0); {2601#false} is VALID [2022-04-28 03:41:42,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2601#false} is VALID [2022-04-28 03:41:42,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2609#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:41:42,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 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; {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {2708#(or (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2610#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:42,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 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; {2708#(or (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:42,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:42,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {2719#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2712#(or (<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:42,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {2600#true} ~z~0 := ~y~0; {2719#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0))} is VALID [2022-04-28 03:41:42,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {2600#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2600#true} is VALID [2022-04-28 03:41:42,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {2600#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse0 (mod v_main_~x~0_61 4294967296)) (.cse2 (= v_main_~y~0_62 v_main_~y~0_61)) (.cse3 (= |v_main_#t~post5_29| |v_main_#t~post5_28|))) (or (and (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_62 (* (- 1) v_main_~y~0_61))) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_62 v_it_7 1) v_main_~y~0_61)) (not (<= 1 v_it_7)))) (< 0 .cse0) (< v_main_~y~0_62 v_main_~y~0_61)) (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse1 .cse2 .cse3) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_62, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_61, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2600#true} is VALID [2022-04-28 03:41:42,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {2600#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2600#true} is VALID [2022-04-28 03:41:42,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {2600#true} call #t~ret15 := main(); {2600#true} is VALID [2022-04-28 03:41:42,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2600#true} {2600#true} #83#return; {2600#true} is VALID [2022-04-28 03:41:42,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {2600#true} assume true; {2600#true} is VALID [2022-04-28 03:41:42,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {2600#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); {2600#true} is VALID [2022-04-28 03:41:42,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {2600#true} call ULTIMATE.init(); {2600#true} is VALID [2022-04-28 03:41:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:42,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542466851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:42,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:42,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-28 03:41:43,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:43,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006413083] [2022-04-28 03:41:43,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006413083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:43,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:43,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:43,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114064205] [2022-04-28 03:41:43,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:43,865 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-28 03:41:43,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:43,865 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-28 03:41:43,982 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-28 03:41:43,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:41:43,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:41:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:41:43,983 INFO L87 Difference]: Start difference. First operand 42 states and 58 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-28 03:41:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:44,600 INFO L93 Difference]: Finished difference Result 61 states and 85 transitions. [2022-04-28 03:41:44,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:41:44,601 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-28 03:41:44,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:44,601 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-28 03:41:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-28 03:41:44,602 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-28 03:41:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-28 03:41:44,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-28 03:41:44,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:44,727 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:41:44,727 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:41:44,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:41:44,728 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:44,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-04-28 03:41:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:41:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 43. [2022-04-28 03:41:44,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:44,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,828 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,828 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:44,829 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-28 03:41:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-04-28 03:41:44,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:44,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:44,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 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-28 03:41:44,829 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 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-28 03:41:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:44,830 INFO L93 Difference]: Finished difference Result 53 states and 75 transitions. [2022-04-28 03:41:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-04-28 03:41:44,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:44,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:44,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:44,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:44,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2022-04-28 03:41:44,832 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 22 [2022-04-28 03:41:44,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:44,832 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2022-04-28 03:41:44,832 INFO L496 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-28 03:41:44,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 58 transitions. [2022-04-28 03:41:45,902 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-28 03:41:45,903 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-28 03:41:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:41:45,903 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:45,903 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:45,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:41:46,103 WARN L477 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-28 03:41:46,104 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:46,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:46,104 INFO L85 PathProgramCache]: Analyzing trace with hash -439116189, now seen corresponding path program 3 times [2022-04-28 03:41:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1059960434] [2022-04-28 03:41:50,197 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:41:50,283 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-28 03:41:50,285 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash 605709284, now seen corresponding path program 1 times [2022-04-28 03:41:50,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:50,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108363541] [2022-04-28 03:41:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:50,297 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-28 03:41:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,321 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-28 03:41:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {3089#(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); {3082#true} is VALID [2022-04-28 03:41:50,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-28 03:41:50,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-28 03:41:50,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {3082#true} call ULTIMATE.init(); {3089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:50,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {3089#(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); {3082#true} is VALID [2022-04-28 03:41:50,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-28 03:41:50,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-28 03:41:50,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {3082#true} call #t~ret15 := main(); {3082#true} is VALID [2022-04-28 03:41:50,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3082#true} is VALID [2022-04-28 03:41:50,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_70 4294967296)) (.cse1 (= v_main_~y~0_75 v_main_~y~0_74)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (< 0 .cse0) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_69 v_it_8 1) v_main_~x~0_70)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_70) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_69 v_main_~x~0_70) (= v_main_~y~0_74 (+ v_main_~x~0_70 v_main_~y~0_75 (* (- 1) v_main_~x~0_69)))) (and (= v_main_~x~0_70 v_main_~x~0_69) .cse1 .cse2 .cse3) (and (<= .cse0 0) (= v_main_~x~0_69 v_main_~x~0_70) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3082#true} is VALID [2022-04-28 03:41:50,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= 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; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 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; {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#false} assume !(~x~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {3083#false} assume !(~z~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L272 TraceCheckUtils]: 18: Hoare triple {3083#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#false} ~cond := #in~cond; {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#false} assume 0 == ~cond; {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#false} assume !false; {3083#false} is VALID [2022-04-28 03:41:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:50,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:50,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108363541] [2022-04-28 03:41:50,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108363541] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:50,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897363352] [2022-04-28 03:41:50,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:50,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:50,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:50,364 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-28 03:41:50,366 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-28 03:41:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:41:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:50,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:50,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {3082#true} call ULTIMATE.init(); {3082#true} is VALID [2022-04-28 03:41:50,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#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); {3082#true} is VALID [2022-04-28 03:41:50,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-28 03:41:50,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-28 03:41:50,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {3082#true} call #t~ret15 := main(); {3082#true} is VALID [2022-04-28 03:41:50,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3082#true} is VALID [2022-04-28 03:41:50,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_70 4294967296)) (.cse1 (= v_main_~y~0_75 v_main_~y~0_74)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (< 0 .cse0) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_69 v_it_8 1) v_main_~x~0_70)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_70) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_69 v_main_~x~0_70) (= v_main_~y~0_74 (+ v_main_~x~0_70 v_main_~y~0_75 (* (- 1) v_main_~x~0_69)))) (and (= v_main_~x~0_70 v_main_~x~0_69) .cse1 .cse2 .cse3) (and (<= .cse0 0) (= v_main_~x~0_69 v_main_~x~0_70) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3082#true} is VALID [2022-04-28 03:41:50,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= 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; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 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; {3083#false} is VALID [2022-04-28 03:41:50,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#false} assume !(~x~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-28 03:41:50,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3083#false} is VALID [2022-04-28 03:41:50,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {3083#false} assume !(~z~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-28 03:41:50,574 INFO L272 TraceCheckUtils]: 18: Hoare triple {3083#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3083#false} is VALID [2022-04-28 03:41:50,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#false} ~cond := #in~cond; {3083#false} is VALID [2022-04-28 03:41:50,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#false} assume 0 == ~cond; {3083#false} is VALID [2022-04-28 03:41:50,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#false} assume !false; {3083#false} is VALID [2022-04-28 03:41:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:50,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:50,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {3083#false} assume !false; {3083#false} is VALID [2022-04-28 03:41:50,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {3083#false} assume 0 == ~cond; {3083#false} is VALID [2022-04-28 03:41:50,781 INFO L290 TraceCheckUtils]: 19: Hoare triple {3083#false} ~cond := #in~cond; {3083#false} is VALID [2022-04-28 03:41:50,781 INFO L272 TraceCheckUtils]: 18: Hoare triple {3083#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3083#false} is VALID [2022-04-28 03:41:50,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {3083#false} assume !(~z~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-28 03:41:50,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {3083#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3083#false} is VALID [2022-04-28 03:41:50,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {3083#false} assume !(~x~0 % 4294967296 > 0); {3083#false} is VALID [2022-04-28 03:41:50,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {3087#(<= 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; {3083#false} is VALID [2022-04-28 03:41:50,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {3088#(<= 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; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {3088#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {3087#(<= 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; {3088#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:50,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3087#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:50,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_70 4294967296)) (.cse1 (= v_main_~y~0_75 v_main_~y~0_74)) (.cse2 (= |v_main_#t~post5_34| |v_main_#t~post5_33|)) (.cse3 (= |v_main_#t~post6_34| |v_main_#t~post6_33|))) (or (and (< 0 .cse0) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~x~0_69 v_it_8 1) v_main_~x~0_70)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_70) 4294967296)) (not (<= 1 v_it_8)))) (< v_main_~x~0_69 v_main_~x~0_70) (= v_main_~y~0_74 (+ v_main_~x~0_70 v_main_~y~0_75 (* (- 1) v_main_~x~0_69)))) (and (= v_main_~x~0_70 v_main_~x~0_69) .cse1 .cse2 .cse3) (and (<= .cse0 0) (= v_main_~x~0_69 v_main_~x~0_70) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_34|, main_~x~0=v_main_~x~0_70, main_#t~post6=|v_main_#t~post6_34|} OutVars{main_~y~0=v_main_~y~0_74, main_#t~post5=|v_main_#t~post5_33|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_33|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3082#true} is VALID [2022-04-28 03:41:50,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3082#true} is VALID [2022-04-28 03:41:50,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {3082#true} call #t~ret15 := main(); {3082#true} is VALID [2022-04-28 03:41:50,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3082#true} {3082#true} #83#return; {3082#true} is VALID [2022-04-28 03:41:50,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-04-28 03:41:50,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#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); {3082#true} is VALID [2022-04-28 03:41:50,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {3082#true} call ULTIMATE.init(); {3082#true} is VALID [2022-04-28 03:41:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:41:50,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897363352] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:50,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:50,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:41:50,840 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:50,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1059960434] [2022-04-28 03:41:50,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1059960434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:50,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:50,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:50,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741872084] [2022-04-28 03:41:50,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:50,841 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-28 03:41:50,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:50,841 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-28 03:41:50,856 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-28 03:41:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:50,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:50,857 INFO L87 Difference]: Start difference. First operand 43 states and 58 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-28 03:41:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:51,118 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-28 03:41:51,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:51,119 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-28 03:41:51,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:51,119 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-28 03:41:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 03:41:51,120 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-28 03:41:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-28 03:41:51,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-28 03:41:51,157 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-28 03:41:51,158 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:41:51,158 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:41:51,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:51,158 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:51,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 35 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:51,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:41:51,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:41:51,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:51,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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-28 03:41:51,246 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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-28 03:41:51,247 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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-28 03:41:51,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:51,248 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-28 03:41:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-28 03:41:51,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:51,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:51,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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 38 states. [2022-04-28 03:41:51,250 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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 38 states. [2022-04-28 03:41:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:51,251 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-04-28 03:41:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-28 03:41:51,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:51,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:51,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:51,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 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-28 03:41:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-04-28 03:41:51,252 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 22 [2022-04-28 03:41:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:51,253 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-04-28 03:41:51,253 INFO L496 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-28 03:41:51,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 51 transitions. [2022-04-28 03:41:53,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-04-28 03:41:53,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:41:53,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:53,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:53,441 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-28 03:41:53,641 WARN L477 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-28 03:41:53,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:53,641 INFO L85 PathProgramCache]: Analyzing trace with hash -6760208, now seen corresponding path program 2 times [2022-04-28 03:41:53,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:53,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627632586] [2022-04-28 03:41:53,844 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-28 03:41:53,845 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:53,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1316259996, now seen corresponding path program 1 times [2022-04-28 03:41:53,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:53,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734659863] [2022-04-28 03:41:53,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:53,857 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-28 03:41:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,866 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-28 03:41:53,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {3495#(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); {3486#true} is VALID [2022-04-28 03:41:53,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-28 03:41:53,925 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-28 03:41:53,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {3486#true} call ULTIMATE.init(); {3495#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:53,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {3495#(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); {3486#true} is VALID [2022-04-28 03:41:53,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-28 03:41:53,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-28 03:41:53,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {3486#true} call #t~ret15 := main(); {3486#true} is VALID [2022-04-28 03:41:53,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3486#true} is VALID [2022-04-28 03:41:53,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_87 v_main_~y~0_86)) (.cse3 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse0 (mod v_main_~x~0_83 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) (<= .cse0 0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse3) (and (= v_main_~x~0_82 (+ v_main_~x~0_83 v_main_~y~0_87 (* (- 1) v_main_~y~0_86))) (< v_main_~y~0_87 v_main_~y~0_86) (< 0 .cse0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_87 v_it_9 1) v_main_~y~0_86)) (< 0 (mod (+ v_main_~x~0_83 (* v_it_9 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_87, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3486#true} is VALID [2022-04-28 03:41:53,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3491#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:53,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {3491#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3491#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:53,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#(<= 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; {3492#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:53,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {3492#(<= 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; {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {3493#(<= 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; {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {3493#(<= 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; {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3493#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {3493#(<= 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; {3494#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:53,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {3494#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-28 03:41:53,932 INFO L290 TraceCheckUtils]: 17: Hoare triple {3487#false} assume !(~z~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-28 03:41:53,932 INFO L272 TraceCheckUtils]: 18: Hoare triple {3487#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3487#false} is VALID [2022-04-28 03:41:53,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3487#false} ~cond := #in~cond; {3487#false} is VALID [2022-04-28 03:41:53,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3487#false} assume 0 == ~cond; {3487#false} is VALID [2022-04-28 03:41:53,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {3487#false} assume !false; {3487#false} is VALID [2022-04-28 03:41:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:41:53,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734659863] [2022-04-28 03:41:53,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734659863] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:53,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922129641] [2022-04-28 03:41:53,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:53,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:53,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:53,933 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-28 03:41:53,934 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-28 03:41:53,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:41:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:54,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {3486#true} call ULTIMATE.init(); {3486#true} is VALID [2022-04-28 03:41:54,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#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); {3486#true} is VALID [2022-04-28 03:41:54,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-28 03:41:54,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-28 03:41:54,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {3486#true} call #t~ret15 := main(); {3486#true} is VALID [2022-04-28 03:41:54,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3486#true} is VALID [2022-04-28 03:41:54,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_87 v_main_~y~0_86)) (.cse3 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse0 (mod v_main_~x~0_83 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) (<= .cse0 0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse3) (and (= v_main_~x~0_82 (+ v_main_~x~0_83 v_main_~y~0_87 (* (- 1) v_main_~y~0_86))) (< v_main_~y~0_87 v_main_~y~0_86) (< 0 .cse0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_87 v_it_9 1) v_main_~y~0_86)) (< 0 (mod (+ v_main_~x~0_83 (* v_it_9 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_87, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3486#true} is VALID [2022-04-28 03:41:54,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3486#true} is VALID [2022-04-28 03:41:54,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#true} ~z~0 := ~y~0; {3486#true} is VALID [2022-04-28 03:41:54,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:54,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {3526#(< 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; {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:41:54,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:41:54,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {3530#(< 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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:54,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {3526#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-28 03:41:54,057 INFO L272 TraceCheckUtils]: 18: Hoare triple {3487#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3487#false} is VALID [2022-04-28 03:41:54,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {3487#false} ~cond := #in~cond; {3487#false} is VALID [2022-04-28 03:41:54,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {3487#false} assume 0 == ~cond; {3487#false} is VALID [2022-04-28 03:41:54,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {3487#false} assume !false; {3487#false} is VALID [2022-04-28 03:41:54,058 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-28 03:41:54,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:54,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {3487#false} assume !false; {3487#false} is VALID [2022-04-28 03:41:54,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {3487#false} assume 0 == ~cond; {3487#false} is VALID [2022-04-28 03:41:54,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {3487#false} ~cond := #in~cond; {3487#false} is VALID [2022-04-28 03:41:54,121 INFO L272 TraceCheckUtils]: 18: Hoare triple {3487#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {3487#false} is VALID [2022-04-28 03:41:54,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3487#false} is VALID [2022-04-28 03:41:54,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {3540#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {3540#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {3526#(< 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; {3540#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:54,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {3530#(< 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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:54,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:41:54,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {3526#(< 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; {3530#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:41:54,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {3486#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; {3526#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:54,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {3486#true} ~z~0 := ~y~0; {3486#true} is VALID [2022-04-28 03:41:54,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {3486#true} [102] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3486#true} is VALID [2022-04-28 03:41:54,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {3486#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse2 (= v_main_~y~0_87 v_main_~y~0_86)) (.cse3 (= v_main_~x~0_83 v_main_~x~0_82)) (.cse0 (mod v_main_~x~0_83 4294967296))) (or (and (= |v_main_#t~post5_38| |v_main_#t~post5_39|) (<= .cse0 0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse3) (and (= v_main_~x~0_82 (+ v_main_~x~0_83 v_main_~y~0_87 (* (- 1) v_main_~y~0_86))) (< v_main_~y~0_87 v_main_~y~0_86) (< 0 .cse0) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_87 v_it_9 1) v_main_~y~0_86)) (< 0 (mod (+ v_main_~x~0_83 (* v_it_9 4294967295)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_87, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_82, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3486#true} is VALID [2022-04-28 03:41:54,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {3486#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3486#true} is VALID [2022-04-28 03:41:54,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {3486#true} call #t~ret15 := main(); {3486#true} is VALID [2022-04-28 03:41:54,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3486#true} {3486#true} #83#return; {3486#true} is VALID [2022-04-28 03:41:54,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {3486#true} assume true; {3486#true} is VALID [2022-04-28 03:41:54,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {3486#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); {3486#true} is VALID [2022-04-28 03:41:54,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {3486#true} call ULTIMATE.init(); {3486#true} is VALID [2022-04-28 03:41:54,126 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-28 03:41:54,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922129641] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:54,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:54,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-04-28 03:41:54,182 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:54,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627632586] [2022-04-28 03:41:54,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627632586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:54,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:54,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:54,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219244078] [2022-04-28 03:41:54,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:54,183 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 23 [2022-04-28 03:41:54,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:54,183 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-28 03:41:54,200 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-28 03:41:54,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:41:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:54,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:41:54,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:41:54,200 INFO L87 Difference]: Start difference. First operand 38 states and 51 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-28 03:41:54,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:54,779 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2022-04-28 03:41:54,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:41:54,779 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 23 [2022-04-28 03:41:54,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:54,779 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-28 03:41:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 03:41:54,780 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-28 03:41:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 64 transitions. [2022-04-28 03:41:54,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 64 transitions. [2022-04-28 03:41:54,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:54,849 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:41:54,849 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:41:54,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:41:54,850 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 63 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:54,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 34 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:41:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2022-04-28 03:41:54,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:54,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:54,981 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:54,981 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:54,982 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2022-04-28 03:41:54,982 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2022-04-28 03:41:54,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:54,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:54,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 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-28 03:41:54,983 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 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-28 03:41:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:54,984 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2022-04-28 03:41:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2022-04-28 03:41:54,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:54,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:54,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:54,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:54,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 68 transitions. [2022-04-28 03:41:54,985 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 68 transitions. Word has length 23 [2022-04-28 03:41:54,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:54,985 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 68 transitions. [2022-04-28 03:41:54,986 INFO L496 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-28 03:41:54,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 68 transitions. [2022-04-28 03:41:57,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 67 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-28 03:41:57,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:41:57,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:57,228 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:57,244 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-28 03:41:57,442 WARN L477 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-28 03:41:57,443 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:57,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1804115870, now seen corresponding path program 4 times [2022-04-28 03:41:57,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:57,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [36019361] [2022-04-28 03:41:57,612 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-28 03:41:57,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2058352594, now seen corresponding path program 1 times [2022-04-28 03:41:57,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444592971] [2022-04-28 03:41:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:57,624 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-28 03:41:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:57,638 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-28 03:41:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:57,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {4029#(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); {4020#true} is VALID [2022-04-28 03:41:57,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-28 03:41:57,706 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4029#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:57,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {4029#(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); {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {4020#true} call #t~ret15 := main(); {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse4 (= v_main_~x~0_94 v_main_~x~0_93))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_98 (* (- 1) v_main_~y~0_97))) (< 0 .cse0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_98 v_it_10 1) v_main_~y~0_97)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)))) (< v_main_~y~0_98 v_main_~y~0_97)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_98, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_97, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4020#true} is VALID [2022-04-28 03:41:57,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4020#true} is VALID [2022-04-28 03:41:57,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#true} ~z~0 := ~y~0; {4025#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:57,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {4025#(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; {4026#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:57,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(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; {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:57,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(<= 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; {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#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; {4021#false} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {4021#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; {4021#false} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {4021#false} assume !(~x~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4021#false} is VALID [2022-04-28 03:41:57,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#false} assume !(~z~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:57,711 INFO L272 TraceCheckUtils]: 19: Hoare triple {4021#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4021#false} is VALID [2022-04-28 03:41:57,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#false} ~cond := #in~cond; {4021#false} is VALID [2022-04-28 03:41:57,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {4021#false} assume 0 == ~cond; {4021#false} is VALID [2022-04-28 03:41:57,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2022-04-28 03:41:57,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:41:57,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:57,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444592971] [2022-04-28 03:41:57,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444592971] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:57,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793966863] [2022-04-28 03:41:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:57,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:57,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:57,713 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-28 03:41:57,714 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-28 03:41:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:57,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:57,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:58,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4020#true} is VALID [2022-04-28 03:41:58,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#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); {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {4020#true} call #t~ret15 := main(); {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse4 (= v_main_~x~0_94 v_main_~x~0_93))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_98 (* (- 1) v_main_~y~0_97))) (< 0 .cse0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_98 v_it_10 1) v_main_~y~0_97)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)))) (< v_main_~y~0_98 v_main_~y~0_97)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_98, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_97, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4020#true} is VALID [2022-04-28 03:41:58,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#true} ~z~0 := ~y~0; {4025#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:41:58,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {4025#(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; {4026#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:58,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {4026#(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; {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:58,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:58,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(<= 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; {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#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; {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {4021#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; {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {4021#false} assume !(~x~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#false} assume !(~z~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L272 TraceCheckUtils]: 19: Hoare triple {4021#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4021#false} is VALID [2022-04-28 03:41:58,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#false} ~cond := #in~cond; {4021#false} is VALID [2022-04-28 03:41:58,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {4021#false} assume 0 == ~cond; {4021#false} is VALID [2022-04-28 03:41:58,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2022-04-28 03:41:58,110 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:41:58,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:58,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {4021#false} assume !false; {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {4021#false} assume 0 == ~cond; {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {4021#false} ~cond := #in~cond; {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L272 TraceCheckUtils]: 19: Hoare triple {4021#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {4021#false} assume !(~z~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {4021#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {4021#false} assume !(~x~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {4021#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; {4021#false} is VALID [2022-04-28 03:41:58,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {4021#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; {4021#false} is VALID [2022-04-28 03:41:58,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4021#false} is VALID [2022-04-28 03:41:58,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {4027#(<= 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; {4028#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:58,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:58,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {4135#(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; {4027#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:58,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {4139#(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; {4135#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:41:58,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {4020#true} ~z~0 := ~y~0; {4139#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:58,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#true} [104] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4020#true} is VALID [2022-04-28 03:41:58,360 INFO L290 TraceCheckUtils]: 6: Hoare triple {4020#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_94 4294967296)) (.cse1 (= |v_main_#t~post6_44| |v_main_#t~post6_43|)) (.cse2 (= v_main_~y~0_98 v_main_~y~0_97)) (.cse3 (= |v_main_#t~post5_44| |v_main_#t~post5_43|)) (.cse4 (= v_main_~x~0_94 v_main_~x~0_93))) (or (and (= v_main_~x~0_93 (+ v_main_~x~0_94 v_main_~y~0_98 (* (- 1) v_main_~y~0_97))) (< 0 .cse0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_98 v_it_10 1) v_main_~y~0_97)) (< 0 (mod (+ v_main_~x~0_94 (* 4294967295 v_it_10)) 4294967296)))) (< v_main_~y~0_98 v_main_~y~0_97)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_98, main_#t~post5=|v_main_#t~post5_44|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_44|} OutVars{main_~y~0=v_main_~y~0_97, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_43|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4020#true} is VALID [2022-04-28 03:41:58,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {4020#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4020#true} is VALID [2022-04-28 03:41:58,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {4020#true} call #t~ret15 := main(); {4020#true} is VALID [2022-04-28 03:41:58,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4020#true} {4020#true} #83#return; {4020#true} is VALID [2022-04-28 03:41:58,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {4020#true} assume true; {4020#true} is VALID [2022-04-28 03:41:58,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {4020#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); {4020#true} is VALID [2022-04-28 03:41:58,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {4020#true} call ULTIMATE.init(); {4020#true} is VALID [2022-04-28 03:41:58,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:41:58,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793966863] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:58,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:58,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:41:58,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:58,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [36019361] [2022-04-28 03:41:58,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [36019361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:58,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:58,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:58,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542321603] [2022-04-28 03:41:58,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:58,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-04-28 03:41:58,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:58,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:41:58,480 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-28 03:41:58,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:41:58,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:58,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:41:58,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:58,481 INFO L87 Difference]: Start difference. First operand 50 states and 68 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:41:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:59,067 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-28 03:41:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:41:59,068 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-04-28 03:41:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:59,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:41:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 03:41:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:41:59,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 03:41:59,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-28 03:41:59,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:59,121 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:41:59,121 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:41:59,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:41:59,122 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:59,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 46 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:41:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:41:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2022-04-28 03:41:59,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:59,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:59,246 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:59,246 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:59,247 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 03:41:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 03:41:59,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:59,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:59,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 03:41:59,248 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 03:41:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:59,248 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-28 03:41:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-28 03:41:59,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:59,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:59,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:59,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:59,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:59,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-04-28 03:41:59,250 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 24 [2022-04-28 03:41:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:59,250 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-04-28 03:41:59,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:41:59,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 54 transitions. [2022-04-28 03:42:01,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2022-04-28 03:42:01,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:42:01,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:01,566 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:01,584 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-28 03:42:01,766 WARN L477 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-28 03:42:01,767 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:01,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:01,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 3 times [2022-04-28 03:42:01,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:01,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091955585] [2022-04-28 03:42:01,959 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-28 03:42:01,961 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1635895922, now seen corresponding path program 1 times [2022-04-28 03:42:01,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:01,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321049627] [2022-04-28 03:42:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:01,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:01,970 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-28 03:42:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:01,981 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-28 03:42:02,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {4486#(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); {4477#true} is VALID [2022-04-28 03:42:02,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-28 03:42:02,024 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-28 03:42:02,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {4477#true} call ULTIMATE.init(); {4486#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:02,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {4486#(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); {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {4477#true} call #t~ret15 := main(); {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {4477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {4477#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse4 (mod v_main_~x~0_106 4294967296)) (.cse2 (= v_main_~y~0_111 v_main_~y~0_110)) (.cse3 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse4) (= v_main_~y~0_110 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_111))) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {4477#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4477#true} is VALID [2022-04-28 03:42:02,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {4477#true} ~z~0 := ~y~0; {4477#true} is VALID [2022-04-28 03:42:02,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {4477#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; {4482#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:02,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {4482#(<= 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; {4483#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:42:02,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {4483#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4483#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:42:02,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {4483#(<= main_~z~0 (+ (* (div main_~z~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; {4484#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:42:02,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {4484#(<= main_~z~0 (+ 4294967294 (* 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; {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:02,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:02,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {4485#(<= (+ 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; {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:02,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {4485#(<= (+ 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; {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:02,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:42:02,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {4485#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {4478#false} is VALID [2022-04-28 03:42:02,034 INFO L272 TraceCheckUtils]: 19: Hoare triple {4478#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4478#false} is VALID [2022-04-28 03:42:02,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#false} ~cond := #in~cond; {4478#false} is VALID [2022-04-28 03:42:02,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {4478#false} assume 0 == ~cond; {4478#false} is VALID [2022-04-28 03:42:02,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#false} assume !false; {4478#false} is VALID [2022-04-28 03:42:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:02,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:02,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321049627] [2022-04-28 03:42:02,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321049627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:02,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549535379] [2022-04-28 03:42:02,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:02,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:02,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:02,036 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-28 03:42:02,037 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-28 03:42:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:42:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:02,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:02,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {4477#true} call ULTIMATE.init(); {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#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); {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {4477#true} call #t~ret15 := main(); {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {4477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {4477#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse4 (mod v_main_~x~0_106 4294967296)) (.cse2 (= v_main_~y~0_111 v_main_~y~0_110)) (.cse3 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse4) (= v_main_~y~0_110 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_111))) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4477#true} is VALID [2022-04-28 03:42:02,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {4477#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4477#true} is VALID [2022-04-28 03:42:02,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {4477#true} ~z~0 := ~y~0; {4514#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:02,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {4514#(= 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; {4518#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:42:02,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {4518#(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; {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:02,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:02,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {4522#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~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; {4529#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-28 03:42:02,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {4529#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= (+ main_~z~0 1) (+ 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; {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:02,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4533#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:02,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {4533#(and (= (+ (- 1) 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; {4540#(and (< 0 (mod main_~z~0 4294967296)) (= main_~y~0 (+ (- 1) main_~z~0)))} is VALID [2022-04-28 03:42:02,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {4540#(and (< 0 (mod main_~z~0 4294967296)) (= 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4478#false} is VALID [2022-04-28 03:42:02,258 INFO L272 TraceCheckUtils]: 19: Hoare triple {4478#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4478#false} is VALID [2022-04-28 03:42:02,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#false} ~cond := #in~cond; {4478#false} is VALID [2022-04-28 03:42:02,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {4478#false} assume 0 == ~cond; {4478#false} is VALID [2022-04-28 03:42:02,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#false} assume !false; {4478#false} is VALID [2022-04-28 03:42:02,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:02,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:02,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {4478#false} assume !false; {4478#false} is VALID [2022-04-28 03:42:02,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {4478#false} assume 0 == ~cond; {4478#false} is VALID [2022-04-28 03:42:02,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {4478#false} ~cond := #in~cond; {4478#false} is VALID [2022-04-28 03:42:02,374 INFO L272 TraceCheckUtils]: 19: Hoare triple {4478#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {4478#false} is VALID [2022-04-28 03:42:02,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4478#false} is VALID [2022-04-28 03:42:02,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {4544#(< 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {4544#(< 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {4544#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {4482#(<= 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; {4544#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:02,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {4593#(<= 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; {4482#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:02,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:42:02,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {4482#(<= 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; {4593#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {4477#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; {4482#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {4477#true} ~z~0 := ~y~0; {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {4477#true} [106] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {4477#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_49| |v_main_#t~post5_48|)) (.cse4 (mod v_main_~x~0_106 4294967296)) (.cse2 (= v_main_~y~0_111 v_main_~y~0_110)) (.cse3 (= |v_main_#t~post6_49| |v_main_#t~post6_48|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse4) (= v_main_~y~0_110 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_111))) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_111, main_#t~post5=|v_main_#t~post5_49|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_49|} OutVars{main_~y~0=v_main_~y~0_110, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_48|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {4477#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {4477#true} call #t~ret15 := main(); {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4477#true} {4477#true} #83#return; {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {4477#true} assume true; {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4477#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); {4477#true} is VALID [2022-04-28 03:42:02,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {4477#true} call ULTIMATE.init(); {4477#true} is VALID [2022-04-28 03:42:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:02,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549535379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:02,380 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:02,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 5] total 15 [2022-04-28 03:42:02,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:02,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091955585] [2022-04-28 03:42:02,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091955585] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:02,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:02,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:42:02,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89477529] [2022-04-28 03:42:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:02,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-04-28 03:42:02,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:02,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:42:02,480 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-28 03:42:02,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:42:02,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:02,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:42:02,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:42:02,481 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:42:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,201 INFO L93 Difference]: Finished difference Result 64 states and 87 transitions. [2022-04-28 03:42:03,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:42:03,201 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-04-28 03:42:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:03,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:42:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 03:42:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:42:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 51 transitions. [2022-04-28 03:42:03,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 51 transitions. [2022-04-28 03:42:03,255 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-28 03:42:03,256 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:42:03,256 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:42:03,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:42:03,257 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:03,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 42 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:42:03,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:42:03,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 50. [2022-04-28 03:42:03,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:03,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,425 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,425 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,426 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-28 03:42:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-04-28 03:42:03,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:03,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:03,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:42:03,427 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:42:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:03,428 INFO L93 Difference]: Finished difference Result 59 states and 80 transitions. [2022-04-28 03:42:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-04-28 03:42:03,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:03,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:03,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:03,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-28 03:42:03,429 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 24 [2022-04-28 03:42:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:03,429 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-28 03:42:03,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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-28 03:42:03,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-28 03:42:03,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-28 03:42:03,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:42:03,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:03,829 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:03,846 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-28 03:42:04,031 WARN L477 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-28 03:42:04,031 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:04,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:04,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 4 times [2022-04-28 03:42:04,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:04,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1505484845] [2022-04-28 03:42:04,227 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-28 03:42:04,228 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:04,230 INFO L85 PathProgramCache]: Analyzing trace with hash 310709397, now seen corresponding path program 1 times [2022-04-28 03:42:04,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:04,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568103281] [2022-04-28 03:42:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:04,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:04,237 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-28 03:42:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,276 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:04,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:04,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {5017#(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); {5003#true} is VALID [2022-04-28 03:42:04,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-28 03:42:04,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-28 03:42:04,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {5003#true} call ULTIMATE.init(); {5017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:04,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {5017#(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); {5003#true} is VALID [2022-04-28 03:42:04,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-28 03:42:04,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-28 03:42:04,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {5003#true} call #t~ret15 := main(); {5003#true} is VALID [2022-04-28 03:42:04,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {5003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5008#(= main_~y~0 0)} is VALID [2022-04-28 03:42:04,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {5008#(= main_~y~0 0)} [109] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_118 4294967296)) (.cse1 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse2 (= v_main_~x~0_118 v_main_~x~0_117)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|))) (or (and (= v_main_~x~0_117 (+ v_main_~x~0_118 v_main_~y~0_127 (* (- 1) v_main_~y~0_126))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_118 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_127 v_it_12 1) v_main_~y~0_126)) (not (<= 1 v_it_12)))) (< 0 .cse0) (< v_main_~y~0_127 v_main_~y~0_126)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5009#(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-28 03:42:04,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {5009#(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)))} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5010#(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-28 03:42:04,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {5010#(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; {5011#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~z~0 main_~y~0)))} is VALID [2022-04-28 03:42:04,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {5011#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967295 (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= 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; {5012#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} is VALID [2022-04-28 03:42:04,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {5012#(and (<= (+ main_~z~0 1) main_~y~0) (<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5013#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:04,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {5013#(<= (+ main_~y~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5014#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:04,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {5014#(<= 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; {5015#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:04,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= 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; {5016#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:04,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= 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; {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#false} assume !(~y~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {5004#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; {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {5004#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; {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {5004#false} assume !(~x~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {5004#false} assume !(~z~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L272 TraceCheckUtils]: 20: Hoare triple {5004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 21: Hoare triple {5004#false} ~cond := #in~cond; {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {5004#false} assume 0 == ~cond; {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L290 TraceCheckUtils]: 23: Hoare triple {5004#false} assume !false; {5004#false} is VALID [2022-04-28 03:42:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568103281] [2022-04-28 03:42:04,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568103281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:04,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316904846] [2022-04-28 03:42:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:04,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:04,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:04,485 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-28 03:42:04,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:42:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:42:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:04,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:04,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {5003#true} call ULTIMATE.init(); {5003#true} is VALID [2022-04-28 03:42:04,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#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); {5003#true} is VALID [2022-04-28 03:42:04,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-28 03:42:04,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-28 03:42:04,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {5003#true} call #t~ret15 := main(); {5003#true} is VALID [2022-04-28 03:42:04,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {5003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5003#true} is VALID [2022-04-28 03:42:04,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {5003#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_118 4294967296)) (.cse1 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse2 (= v_main_~x~0_118 v_main_~x~0_117)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|))) (or (and (= v_main_~x~0_117 (+ v_main_~x~0_118 v_main_~y~0_127 (* (- 1) v_main_~y~0_126))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_118 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_127 v_it_12 1) v_main_~y~0_126)) (not (<= 1 v_it_12)))) (< 0 .cse0) (< v_main_~y~0_127 v_main_~y~0_126)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5003#true} is VALID [2022-04-28 03:42:04,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {5003#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5003#true} is VALID [2022-04-28 03:42:04,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {5003#true} ~z~0 := ~y~0; {5045#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:04,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {5045#(= 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; {5049#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:04,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {5049#(= 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; {5053#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:42:04,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {5053#(= main_~y~0 (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {5014#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:04,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {5014#(<= 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; {5015#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= 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; {5016#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= 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; {5004#false} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#false} assume !(~y~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {5004#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; {5004#false} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {5004#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; {5004#false} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {5004#false} assume !(~x~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:04,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {5004#false} assume !(~z~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:04,753 INFO L272 TraceCheckUtils]: 20: Hoare triple {5004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5004#false} is VALID [2022-04-28 03:42:04,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {5004#false} ~cond := #in~cond; {5004#false} is VALID [2022-04-28 03:42:04,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {5004#false} assume 0 == ~cond; {5004#false} is VALID [2022-04-28 03:42:04,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {5004#false} assume !false; {5004#false} is VALID [2022-04-28 03:42:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:04,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:05,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {5004#false} assume !false; {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {5004#false} assume 0 == ~cond; {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {5004#false} ~cond := #in~cond; {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L272 TraceCheckUtils]: 20: Hoare triple {5004#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {5004#false} assume !(~z~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {5004#false} assume !(~x~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {5004#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; {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {5004#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; {5004#false} is VALID [2022-04-28 03:42:05,049 INFO L290 TraceCheckUtils]: 15: Hoare triple {5004#false} assume !(~y~0 % 4294967296 > 0); {5004#false} is VALID [2022-04-28 03:42:05,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {5016#(<= 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; {5004#false} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {5015#(<= 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; {5016#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:05,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {5014#(<= 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; {5015#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:05,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {5129#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5014#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:05,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {5133#(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; {5129#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:42:05,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {5137#(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; {5133#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:42:05,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {5003#true} ~z~0 := ~y~0; {5137#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:42:05,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {5003#true} [108] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {5003#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_118 4294967296)) (.cse1 (= v_main_~y~0_127 v_main_~y~0_126)) (.cse2 (= v_main_~x~0_118 v_main_~x~0_117)) (.cse3 (= |v_main_#t~post6_54| |v_main_#t~post6_53|)) (.cse4 (= |v_main_#t~post5_54| |v_main_#t~post5_53|))) (or (and (= v_main_~x~0_117 (+ v_main_~x~0_118 v_main_~y~0_127 (* (- 1) v_main_~y~0_126))) (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_118 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_127 v_it_12 1) v_main_~y~0_126)) (not (<= 1 v_it_12)))) (< 0 .cse0) (< v_main_~y~0_127 v_main_~y~0_126)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_127, main_#t~post5=|v_main_#t~post5_54|, main_~x~0=v_main_~x~0_118, main_#t~post6=|v_main_#t~post6_54|} OutVars{main_~y~0=v_main_~y~0_126, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_117, main_#t~post6=|v_main_#t~post6_53|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {5003#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {5003#true} call #t~ret15 := main(); {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5003#true} {5003#true} #83#return; {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {5003#true} assume true; {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {5003#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); {5003#true} is VALID [2022-04-28 03:42:05,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {5003#true} call ULTIMATE.init(); {5003#true} is VALID [2022-04-28 03:42:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:42:05,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316904846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:05,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:05,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 18 [2022-04-28 03:42:08,920 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:08,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1505484845] [2022-04-28 03:42:08,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1505484845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:08,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:08,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:42:08,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766042959] [2022-04-28 03:42:08,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:08,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:08,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:08,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:09,046 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-28 03:42:09,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:42:09,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:09,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:42:09,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:42:09,047 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:41,982 WARN L232 SmtUtils]: Spent 6.55s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:42:42,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:42,878 INFO L93 Difference]: Finished difference Result 103 states and 145 transitions. [2022-04-28 03:42:42,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:42:42,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:42,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:42,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-28 03:42:42,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:42,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 73 transitions. [2022-04-28 03:42:42,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 73 transitions. [2022-04-28 03:42:46,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 72 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:46,233 INFO L225 Difference]: With dead ends: 103 [2022-04-28 03:42:46,234 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 03:42:46,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 34.4s TimeCoverageRelationStatistics Valid=202, Invalid=915, Unknown=5, NotChecked=0, Total=1122 [2022-04-28 03:42:46,236 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:46,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 53 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 183 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-04-28 03:42:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 03:42:46,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 61. [2022-04-28 03:42:46,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:46,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:46,471 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:46,471 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:46,472 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-28 03:42:46,472 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-28 03:42:46,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:46,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:46,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 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 85 states. [2022-04-28 03:42:46,473 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 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 85 states. [2022-04-28 03:42:46,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:46,474 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-28 03:42:46,474 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-28 03:42:46,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:46,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:46,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:46,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:46,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:46,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2022-04-28 03:42:46,475 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 25 [2022-04-28 03:42:46,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:46,475 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2022-04-28 03:42:46,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 12 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-28 03:42:46,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 82 transitions. [2022-04-28 03:42:49,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 81 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2022-04-28 03:42:49,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:42:49,489 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:49,489 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:49,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:42:49,699 WARN L477 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-28 03:42:49,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:49,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-04-28 03:42:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:49,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1157760712] [2022-04-28 03:42:49,894 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-28 03:42:49,896 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:49,898 INFO L85 PathProgramCache]: Analyzing trace with hash -2105316882, now seen corresponding path program 1 times [2022-04-28 03:42:49,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:49,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920673468] [2022-04-28 03:42:49,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:49,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:49,906 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-28 03:42:49,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:49,922 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-28 03:42:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:50,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {5710#(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); {5696#true} is VALID [2022-04-28 03:42:50,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-28 03:42:50,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {5696#true} call ULTIMATE.init(); {5710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:50,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {5710#(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); {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {5696#true} call #t~ret15 := main(); {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_58|)) (.cse3 (mod v_main_~x~0_130 4294967296))) (or (and .cse0 (= v_main_~x~0_130 v_main_~x~0_129) .cse1 .cse2) (and .cse0 (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse3 0) .cse2) (and (< v_main_~y~0_143 v_main_~y~0_142) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_143 v_it_13 1) v_main_~y~0_142)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_129 (+ v_main_~x~0_130 v_main_~y~0_143 (* (- 1) v_main_~y~0_142)))))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5696#true} is VALID [2022-04-28 03:42:50,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5696#true} is VALID [2022-04-28 03:42:50,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#true} ~z~0 := ~y~0; {5701#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:42:50,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {5701#(= (+ 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; {5702#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:50,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {5702#(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; {5703#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:42:50,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {5703#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5704#(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-28 03:42:50,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {5704#(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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {5705#(<= 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; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#(<= 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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {5705#(<= 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; {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:50,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:50,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,059 INFO L272 TraceCheckUtils]: 21: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5708#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:42:50,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {5708#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5709#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:42:50,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {5709#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5697#false} is VALID [2022-04-28 03:42:50,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-04-28 03:42:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:42:50,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:50,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920673468] [2022-04-28 03:42:50,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920673468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:50,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122428964] [2022-04-28 03:42:50,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:50,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:50,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:50,062 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-28 03:42:50,062 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-28 03:42:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:50,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:42:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:50,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:50,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {5696#true} call ULTIMATE.init(); {5696#true} is VALID [2022-04-28 03:42:50,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#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); {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {5696#true} call #t~ret15 := main(); {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_58|)) (.cse3 (mod v_main_~x~0_130 4294967296))) (or (and .cse0 (= v_main_~x~0_130 v_main_~x~0_129) .cse1 .cse2) (and .cse0 (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse3 0) .cse2) (and (< v_main_~y~0_143 v_main_~y~0_142) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_143 v_it_13 1) v_main_~y~0_142)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_129 (+ v_main_~x~0_130 v_main_~y~0_143 (* (- 1) v_main_~y~0_142)))))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5696#true} is VALID [2022-04-28 03:42:50,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#true} ~z~0 := ~y~0; {5701#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:42:50,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {5701#(= (+ 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; {5702#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:42:50,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {5702#(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; {5696#true} is VALID [2022-04-28 03:42:50,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {5696#true} assume !(~z~0 % 4294967296 > 0); {5696#true} is VALID [2022-04-28 03:42:50,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {5696#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; {5696#true} is VALID [2022-04-28 03:42:50,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {5696#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; {5696#true} is VALID [2022-04-28 03:42:50,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {5696#true} assume !(~y~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#(<= 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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {5705#(<= 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; {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:50,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:50,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,341 INFO L272 TraceCheckUtils]: 21: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:50,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:50,341 INFO L290 TraceCheckUtils]: 23: Hoare triple {5781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5697#false} is VALID [2022-04-28 03:42:50,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-04-28 03:42:50,342 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-28 03:42:50,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:50,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {5697#false} assume !false; {5697#false} is VALID [2022-04-28 03:42:50,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {5781#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5697#false} is VALID [2022-04-28 03:42:50,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5781#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:50,453 INFO L272 TraceCheckUtils]: 21: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {5777#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:50,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,454 INFO L290 TraceCheckUtils]: 19: Hoare triple {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:50,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {5705#(<= 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; {5707#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:50,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {5706#(<= 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; {5705#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:42:50,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {5696#true} assume !(~y~0 % 4294967296 > 0); {5706#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:42:50,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {5696#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; {5696#true} is VALID [2022-04-28 03:42:50,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {5696#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; {5696#true} is VALID [2022-04-28 03:42:50,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {5696#true} assume !(~z~0 % 4294967296 > 0); {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {5696#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; {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {5696#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; {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {5696#true} ~z~0 := ~y~0; {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {5696#true} [110] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {5696#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse1 (= |v_main_#t~post6_59| |v_main_#t~post6_58|)) (.cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_58|)) (.cse3 (mod v_main_~x~0_130 4294967296))) (or (and .cse0 (= v_main_~x~0_130 v_main_~x~0_129) .cse1 .cse2) (and .cse0 (= v_main_~x~0_129 v_main_~x~0_130) .cse1 (<= .cse3 0) .cse2) (and (< v_main_~y~0_143 v_main_~y~0_142) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_143 v_it_13 1) v_main_~y~0_142)) (< 0 (mod (+ v_main_~x~0_130 (* 4294967295 v_it_13)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_129 (+ v_main_~x~0_130 v_main_~y~0_143 (* (- 1) v_main_~y~0_142)))))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_130, main_#t~post6=|v_main_#t~post6_59|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_129, main_#t~post6=|v_main_#t~post6_58|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {5696#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {5696#true} call #t~ret15 := main(); {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5696#true} {5696#true} #83#return; {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {5696#true} assume true; {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {5696#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); {5696#true} is VALID [2022-04-28 03:42:50,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {5696#true} call ULTIMATE.init(); {5696#true} is VALID [2022-04-28 03:42:50,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:50,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122428964] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:50,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:50,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 14 [2022-04-28 03:42:50,503 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:50,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1157760712] [2022-04-28 03:42:50,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1157760712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:50,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:50,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:42:50,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251785878] [2022-04-28 03:42:50,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:50,504 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:42:50,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:50,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:50,524 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-28 03:42:50,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:42:50,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:50,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:42:50,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:42:50,525 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:51,793 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2022-04-28 03:42:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:42:51,793 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:42:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-28 03:42:51,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2022-04-28 03:42:51,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2022-04-28 03:42:51,867 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-28 03:42:51,868 INFO L225 Difference]: With dead ends: 88 [2022-04-28 03:42:51,868 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:42:51,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:42:51,869 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:51,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 62 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:42:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:42:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2022-04-28 03:42:52,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:52,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 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-28 03:42:52,113 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 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-28 03:42:52,113 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 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-28 03:42:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:52,114 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 03:42:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 03:42:52,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:52,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:52,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 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 65 states. [2022-04-28 03:42:52,115 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 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 65 states. [2022-04-28 03:42:52,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:52,116 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-28 03:42:52,116 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-04-28 03:42:52,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:52,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:52,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:52,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:52,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 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-28 03:42:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2022-04-28 03:42:52,117 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 26 [2022-04-28 03:42:52,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:52,118 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2022-04-28 03:42:52,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 12 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:52,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 78 transitions. [2022-04-28 03:42:54,963 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-28 03:42:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2022-04-28 03:42:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:42:54,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:54,964 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:54,981 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-28 03:42:55,164 WARN L477 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-28 03:42:55,164 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:55,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:55,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1205395922, now seen corresponding path program 5 times [2022-04-28 03:42:55,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:55,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [226313609] [2022-04-28 03:42:59,259 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:59,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-28 03:42:59,347 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1030862093, now seen corresponding path program 1 times [2022-04-28 03:42:59,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:59,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293490673] [2022-04-28 03:42:59,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:59,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:59,358 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-28 03:42:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,369 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-28 03:42:59,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {6327#(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); {6317#true} is VALID [2022-04-28 03:42:59,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 03:42:59,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-28 03:42:59,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:59,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {6327#(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); {6317#true} is VALID [2022-04-28 03:42:59,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 03:42:59,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-28 03:42:59,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret15 := main(); {6317#true} is VALID [2022-04-28 03:42:59,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6317#true} is VALID [2022-04-28 03:42:59,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {6317#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_140 4294967296)) (.cse1 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< v_main_~x~0_139 v_main_~x~0_140) (< 0 .cse0) (= (+ v_main_~x~0_140 (* v_main_~x~0_139 (- 1)) v_main_~y~0_161) v_main_~y~0_160) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_139 v_it_14 1) v_main_~x~0_140))))) (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~x~0_139 v_main_~x~0_140)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_140 v_main_~x~0_139)))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6317#true} is VALID [2022-04-28 03:42:59,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:59,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {6322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6322#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:59,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {6322#(<= 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; {6323#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:59,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {6323#(<= 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; {6324#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {6324#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {6325#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {6325#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {6325#(<= 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; {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6325#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:59,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6325#(<= 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; {6326#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:59,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {6326#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-28 03:42:59,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {6318#false} assume !(~z~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-28 03:42:59,453 INFO L272 TraceCheckUtils]: 20: Hoare triple {6318#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6318#false} is VALID [2022-04-28 03:42:59,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#false} ~cond := #in~cond; {6318#false} is VALID [2022-04-28 03:42:59,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#false} assume 0 == ~cond; {6318#false} is VALID [2022-04-28 03:42:59,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-28 03:42:59,454 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:59,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293490673] [2022-04-28 03:42:59,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293490673] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:59,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990233975] [2022-04-28 03:42:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:59,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:59,455 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-28 03:42:59,456 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-28 03:42:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:42:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:59,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:59,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6317#true} is VALID [2022-04-28 03:42:59,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#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); {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret15 := main(); {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {6317#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_140 4294967296)) (.cse1 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< v_main_~x~0_139 v_main_~x~0_140) (< 0 .cse0) (= (+ v_main_~x~0_140 (* v_main_~x~0_139 (- 1)) v_main_~y~0_161) v_main_~y~0_160) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_139 v_it_14 1) v_main_~x~0_140))))) (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~x~0_139 v_main_~x~0_140)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_140 v_main_~x~0_139)))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6317#true} is VALID [2022-04-28 03:42:59,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#true} ~z~0 := ~y~0; {6355#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:59,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {6355#(= 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; {6359#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:59,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {6359#(and (= main_~y~0 (+ main_~z~0 1)) (< 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; {6363#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:59,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {6363#(and (= main_~y~0 (+ main_~z~0 2)) (< 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; {6367#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:59,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {6367#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6367#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:59,667 INFO L290 TraceCheckUtils]: 13: Hoare triple {6367#(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; {6374#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:42:59,668 INFO L290 TraceCheckUtils]: 14: Hoare triple {6374#(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; {6378#(and (= main_~y~0 (+ (- 1) main_~z~0)) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 03:42:59,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {6378#(and (= main_~y~0 (+ (- 1) main_~z~0)) (< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#(< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-28 03:42:59,670 INFO L272 TraceCheckUtils]: 20: Hoare triple {6318#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6318#false} is VALID [2022-04-28 03:42:59,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#false} ~cond := #in~cond; {6318#false} is VALID [2022-04-28 03:42:59,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#false} assume 0 == ~cond; {6318#false} is VALID [2022-04-28 03:42:59,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-28 03:42:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:59,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:59,788 INFO L290 TraceCheckUtils]: 23: Hoare triple {6318#false} assume !false; {6318#false} is VALID [2022-04-28 03:42:59,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {6318#false} assume 0 == ~cond; {6318#false} is VALID [2022-04-28 03:42:59,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {6318#false} ~cond := #in~cond; {6318#false} is VALID [2022-04-28 03:42:59,789 INFO L272 TraceCheckUtils]: 20: Hoare triple {6318#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {6318#false} is VALID [2022-04-28 03:42:59,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6318#false} is VALID [2022-04-28 03:42:59,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {6382#(< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {6382#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {6431#(< 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; {6382#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:42:59,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {6435#(< 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; {6431#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:59,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {6439#(< 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; {6435#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:59,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {6439#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6439#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:42:59,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {6435#(< 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; {6439#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:42:59,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {6431#(< 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; {6435#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:42:59,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {6317#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; {6431#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:42:59,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#true} ~z~0 := ~y~0; {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#true} [112] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {6317#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_140 4294967296)) (.cse1 (= |v_main_#t~post5_64| |v_main_#t~post5_63|)) (.cse2 (= v_main_~y~0_161 v_main_~y~0_160)) (.cse3 (= |v_main_#t~post6_64| |v_main_#t~post6_63|))) (or (and (< v_main_~x~0_139 v_main_~x~0_140) (< 0 .cse0) (= (+ v_main_~x~0_140 (* v_main_~x~0_139 (- 1)) v_main_~y~0_161) v_main_~y~0_160) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~x~0_139 v_it_14 1) v_main_~x~0_140))))) (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~x~0_139 v_main_~x~0_140)) (and .cse1 .cse2 .cse3 (= v_main_~x~0_140 v_main_~x~0_139)))) InVars {main_~y~0=v_main_~y~0_161, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_64|} OutVars{main_~y~0=v_main_~y~0_160, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_63|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#true} call #t~ret15 := main(); {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#true} {6317#true} #83#return; {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#true} assume true; {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {6317#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); {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {6317#true} call ULTIMATE.init(); {6317#true} is VALID [2022-04-28 03:42:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:42:59,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990233975] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:59,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:59,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 18 [2022-04-28 03:42:59,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:59,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [226313609] [2022-04-28 03:42:59,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [226313609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:59,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:59,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:42:59,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727008047] [2022-04-28 03:42:59,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:59,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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 26 [2022-04-28 03:42:59,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:59,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-28 03:42:59,962 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-28 03:42:59,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:42:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:59,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:42:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:42:59,963 INFO L87 Difference]: Start difference. First operand 57 states and 78 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-28 03:43:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:01,150 INFO L93 Difference]: Finished difference Result 108 states and 159 transitions. [2022-04-28 03:43:01,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:43:01,150 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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 26 [2022-04-28 03:43:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-28 03:43:01,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 03:43:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-28 03:43:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 78 transitions. [2022-04-28 03:43:01,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 78 transitions. [2022-04-28 03:43:01,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:01,261 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:43:01,261 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:43:01,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:43:01,262 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 90 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:01,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 42 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:43:01,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:43:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 71. [2022-04-28 03:43:01,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:01,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,593 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,593 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:01,594 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2022-04-28 03:43:01,594 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2022-04-28 03:43:01,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:01,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:01,594 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 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 95 states. [2022-04-28 03:43:01,595 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 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 95 states. [2022-04-28 03:43:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:01,596 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2022-04-28 03:43:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2022-04-28 03:43:01,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:01,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:01,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:01,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-28 03:43:01,597 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 26 [2022-04-28 03:43:01,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:01,598 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-28 03:43:01,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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-28 03:43:01,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 96 transitions. [2022-04-28 03:43:04,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 95 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-28 03:43:04,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:43:04,623 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:04,623 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:04,640 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-28 03:43:04,823 WARN L477 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-28 03:43:04,824 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 6 times [2022-04-28 03:43:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:04,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1735737692] [2022-04-28 03:43:08,934 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:43:09,016 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-28 03:43:09,018 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:09,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1524035883, now seen corresponding path program 1 times [2022-04-28 03:43:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:09,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29905676] [2022-04-28 03:43:09,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:09,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:09,031 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-28 03:43:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:09,044 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:09,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:09,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:09,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {7062#(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); {7054#true} is VALID [2022-04-28 03:43:09,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-28 03:43:09,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-28 03:43:09,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {7062#(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); {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret15 := main(); {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse2 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (mod v_main_~x~0_153 4294967296)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~x~0_152 (+ v_main_~x~0_153 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (< v_main_~y~0_177 v_main_~y~0_176) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_15 1) v_main_~y~0_176)) (not (<= 1 v_it_15))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {7054#true} ~z~0 := ~y~0; {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {7054#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; {7054#true} is VALID [2022-04-28 03:43:09,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {7054#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; {7054#true} is VALID [2022-04-28 03:43:09,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {7054#true} assume !(~z~0 % 4294967296 > 0); {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:09,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {7059#(<= 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; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:09,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {7060#(<= 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; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:09,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:09,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7055#false} is VALID [2022-04-28 03:43:09,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {7055#false} assume !(~z~0 % 4294967296 > 0); {7055#false} is VALID [2022-04-28 03:43:09,102 INFO L272 TraceCheckUtils]: 22: Hoare triple {7055#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7055#false} is VALID [2022-04-28 03:43:09,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-28 03:43:09,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-28 03:43:09,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-28 03:43:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:09,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29905676] [2022-04-28 03:43:09,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29905676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:09,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483768344] [2022-04-28 03:43:09,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:09,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:09,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:09,104 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-28 03:43:09,106 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-28 03:43:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:09,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:43:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:09,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:09,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7054#true} is VALID [2022-04-28 03:43:09,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#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); {7054#true} is VALID [2022-04-28 03:43:09,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-28 03:43:09,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-28 03:43:09,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret15 := main(); {7054#true} is VALID [2022-04-28 03:43:09,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7054#true} is VALID [2022-04-28 03:43:09,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse2 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (mod v_main_~x~0_153 4294967296)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~x~0_152 (+ v_main_~x~0_153 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (< v_main_~y~0_177 v_main_~y~0_176) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_15 1) v_main_~y~0_176)) (not (<= 1 v_it_15))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7054#true} is VALID [2022-04-28 03:43:09,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7054#true} is VALID [2022-04-28 03:43:09,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {7054#true} ~z~0 := ~y~0; {7090#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:09,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {7090#(= 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; {7094#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:09,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {7094#(= 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; {7098#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:43:09,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {7098#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7098#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:43:09,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {7098#(= (+ main_~z~0 1) (+ (- 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; {7090#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:09,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {7090#(= 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; {7108#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:43:09,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {7108#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:09,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:09,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7055#false} is VALID [2022-04-28 03:43:09,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {7055#false} assume !(~z~0 % 4294967296 > 0); {7055#false} is VALID [2022-04-28 03:43:09,421 INFO L272 TraceCheckUtils]: 22: Hoare triple {7055#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7055#false} is VALID [2022-04-28 03:43:09,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-28 03:43:09,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-28 03:43:09,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-28 03:43:09,421 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:09,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:09,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {7055#false} assume !false; {7055#false} is VALID [2022-04-28 03:43:09,768 INFO L290 TraceCheckUtils]: 24: Hoare triple {7055#false} assume 0 == ~cond; {7055#false} is VALID [2022-04-28 03:43:09,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {7055#false} ~cond := #in~cond; {7055#false} is VALID [2022-04-28 03:43:09,769 INFO L272 TraceCheckUtils]: 22: Hoare triple {7055#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7055#false} is VALID [2022-04-28 03:43:09,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {7055#false} assume !(~z~0 % 4294967296 > 0); {7055#false} is VALID [2022-04-28 03:43:09,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7055#false} is VALID [2022-04-28 03:43:09,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7059#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:09,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7060#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:09,773 INFO L290 TraceCheckUtils]: 17: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {7178#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7061#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:43:09,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {7182#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 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; {7178#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:09,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= 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; {7182#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:09,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:09,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {7193#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {7186#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:09,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {7197#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 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; {7193#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-28 03:43:09,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {7054#true} ~z~0 := ~y~0; {7197#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:43:09,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {7054#true} [114] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {7054#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_153 v_main_~x~0_152)) (.cse1 (= |v_main_#t~post5_69| |v_main_#t~post5_68|)) (.cse2 (= v_main_~y~0_177 v_main_~y~0_176)) (.cse4 (mod v_main_~x~0_153 4294967296)) (.cse3 (= |v_main_#t~post6_69| |v_main_#t~post6_68|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (= v_main_~x~0_152 (+ v_main_~x~0_153 v_main_~y~0_177 (* (- 1) v_main_~y~0_176))) (< v_main_~y~0_177 v_main_~y~0_176) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_153 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_177 v_it_15 1) v_main_~y~0_176)) (not (<= 1 v_it_15))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_177, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_153, main_#t~post6=|v_main_#t~post6_69|} OutVars{main_~y~0=v_main_~y~0_176, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_68|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {7054#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {7054#true} call #t~ret15 := main(); {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7054#true} {7054#true} #83#return; {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {7054#true} assume true; {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {7054#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); {7054#true} is VALID [2022-04-28 03:43:09,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {7054#true} call ULTIMATE.init(); {7054#true} is VALID [2022-04-28 03:43:09,786 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:43:09,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483768344] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:09,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:09,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 15 [2022-04-28 03:43:09,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:09,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1735737692] [2022-04-28 03:43:09,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1735737692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:09,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:09,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:43:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247624492] [2022-04-28 03:43:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:09,836 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 27 [2022-04-28 03:43:09,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:09,836 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-28 03:43:09,855 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-28 03:43:09,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:43:09,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:09,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:43:09,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:43:09,856 INFO L87 Difference]: Start difference. First operand 71 states and 96 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-28 03:43:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,655 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-04-28 03:43:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:43:10,655 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 27 [2022-04-28 03:43:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:10,655 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-28 03:43:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 03:43:10,656 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-28 03:43:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 03:43:10,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-28 03:43:10,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:10,705 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:43:10,705 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:43:10,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:43:10,706 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:10,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 43 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:43:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:43:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 03:43:10,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:10,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,996 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,996 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,997 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-28 03:43:10,997 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-28 03:43:10,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:10,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:10,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 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-28 03:43:10,997 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 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-28 03:43:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:10,998 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2022-04-28 03:43:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-28 03:43:10,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:10,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:10,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:10,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-04-28 03:43:11,000 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 27 [2022-04-28 03:43:11,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:11,000 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-04-28 03:43:11,000 INFO L496 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-28 03:43:11,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 84 transitions. [2022-04-28 03:43:14,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 83 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-04-28 03:43:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:43:14,345 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:14,345 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:14,362 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-28 03:43:14,546 WARN L477 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-28 03:43:14,546 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:14,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:14,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1678337854, now seen corresponding path program 6 times [2022-04-28 03:43:14,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:14,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1147307589] [2022-04-28 03:43:14,752 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-28 03:43:14,753 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1997393475, now seen corresponding path program 1 times [2022-04-28 03:43:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:14,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725978836] [2022-04-28 03:43:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:14,763 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-28 03:43:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:14,775 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-28 03:43:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:14,844 INFO L290 TraceCheckUtils]: 0: Hoare triple {7670#(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); {7659#true} is VALID [2022-04-28 03:43:14,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-28 03:43:14,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-28 03:43:14,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {7659#true} call ULTIMATE.init(); {7670#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:14,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {7670#(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); {7659#true} is VALID [2022-04-28 03:43:14,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-28 03:43:14,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-28 03:43:14,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {7659#true} call #t~ret15 := main(); {7659#true} is VALID [2022-04-28 03:43:14,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {7659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7659#true} is VALID [2022-04-28 03:43:14,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {7659#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~y~0_195 v_main_~y~0_194)) (.cse1 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_194 (+ v_main_~x~0_165 v_main_~y~0_195 (* v_main_~x~0_164 (- 1)))) (< 0 .cse3) (< v_main_~x~0_164 v_main_~x~0_165) (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_164 v_it_16 1) v_main_~x~0_165)) (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_194, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7659#true} is VALID [2022-04-28 03:43:14,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {7659#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:14,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {7664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {7664#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:14,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {7664#(<= 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; {7665#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:14,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {7665#(<= 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; {7666#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {7666#(<= 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; {7667#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {7667#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {7668#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {7668#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {7668#(<= 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; {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7668#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:14,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {7668#(<= 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; {7669#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:14,853 INFO L290 TraceCheckUtils]: 19: Hoare triple {7669#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:14,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#false} assume !(~z~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:14,853 INFO L272 TraceCheckUtils]: 21: Hoare triple {7660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7660#false} is VALID [2022-04-28 03:43:14,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#false} ~cond := #in~cond; {7660#false} is VALID [2022-04-28 03:43:14,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#false} assume 0 == ~cond; {7660#false} is VALID [2022-04-28 03:43:14,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#false} assume !false; {7660#false} is VALID [2022-04-28 03:43:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:14,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725978836] [2022-04-28 03:43:14,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725978836] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:14,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478706012] [2022-04-28 03:43:14,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:14,855 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-28 03:43:14,856 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-28 03:43:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:14,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:43:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:14,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:15,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {7659#true} call ULTIMATE.init(); {7659#true} is VALID [2022-04-28 03:43:15,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {7659#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); {7659#true} is VALID [2022-04-28 03:43:15,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-28 03:43:15,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-28 03:43:15,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {7659#true} call #t~ret15 := main(); {7659#true} is VALID [2022-04-28 03:43:15,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {7659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7659#true} is VALID [2022-04-28 03:43:15,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {7659#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~y~0_195 v_main_~y~0_194)) (.cse1 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_194 (+ v_main_~x~0_165 v_main_~y~0_195 (* v_main_~x~0_164 (- 1)))) (< 0 .cse3) (< v_main_~x~0_164 v_main_~x~0_165) (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_164 v_it_16 1) v_main_~x~0_165)) (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_194, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7659#true} is VALID [2022-04-28 03:43:15,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {7659#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7659#true} is VALID [2022-04-28 03:43:15,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {7659#true} ~z~0 := ~y~0; {7698#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:15,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {7698#(= 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; {7702#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:15,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {7702#(= 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; {7706#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:43:15,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {7706#(= 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; {7710#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:43:15,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {7710#(= (+ (- 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; {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:15,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:15,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {7714#(< 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; {7721#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:15,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {7721#(< 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; {7725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:15,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {7725#(< 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; {7729#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {7729#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#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; {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#false} assume !(~x~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#false} assume !(~z~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L272 TraceCheckUtils]: 21: Hoare triple {7660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#false} ~cond := #in~cond; {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#false} assume 0 == ~cond; {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#false} assume !false; {7660#false} is VALID [2022-04-28 03:43:15,037 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:43:15,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:15,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {7660#false} assume !false; {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {7660#false} assume 0 == ~cond; {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {7660#false} ~cond := #in~cond; {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L272 TraceCheckUtils]: 21: Hoare triple {7660#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {7660#false} assume !(~z~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {7660#false} assume !(~x~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {7660#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; {7660#false} is VALID [2022-04-28 03:43:15,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {7729#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {7660#false} is VALID [2022-04-28 03:43:15,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {7725#(< 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; {7729#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:15,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {7721#(< 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; {7725#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:15,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {7714#(< 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; {7721#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:15,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:15,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {7790#(or (not (< 0 (mod main_~z~0 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; {7714#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:15,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {7794#(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; {7790#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:15,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {7798#(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; {7794#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:15,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {7802#(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; {7798#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:15,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {7659#true} ~z~0 := ~y~0; {7802#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:15,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {7659#true} [116] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7659#true} is VALID [2022-04-28 03:43:15,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {7659#true} [117] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_165 4294967296)) (.cse0 (= v_main_~y~0_195 v_main_~y~0_194)) (.cse1 (= v_main_~x~0_165 v_main_~x~0_164)) (.cse2 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_194 (+ v_main_~x~0_165 v_main_~y~0_195 (* v_main_~x~0_164 (- 1)))) (< 0 .cse3) (< v_main_~x~0_164 v_main_~x~0_165) (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_164 v_it_16 1) v_main_~x~0_165)) (< 0 (mod (+ v_main_~x~0_165 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16))))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_165, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_194, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7659#true} is VALID [2022-04-28 03:43:15,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {7659#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7659#true} is VALID [2022-04-28 03:43:15,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {7659#true} call #t~ret15 := main(); {7659#true} is VALID [2022-04-28 03:43:15,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7659#true} {7659#true} #83#return; {7659#true} is VALID [2022-04-28 03:43:15,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {7659#true} assume true; {7659#true} is VALID [2022-04-28 03:43:15,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {7659#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); {7659#true} is VALID [2022-04-28 03:43:15,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {7659#true} call ULTIMATE.init(); {7659#true} is VALID [2022-04-28 03:43:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:43:15,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478706012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:15,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:15,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2022-04-28 03:43:15,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:15,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1147307589] [2022-04-28 03:43:15,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1147307589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:15,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:15,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:43:15,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344346762] [2022-04-28 03:43:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:15,361 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:15,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:15,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:15,387 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-28 03:43:15,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:43:15,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:15,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:43:15,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:43:15,388 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:16,919 INFO L93 Difference]: Finished difference Result 115 states and 164 transitions. [2022-04-28 03:43:16,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:43:16,919 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:16,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-28 03:43:16,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:16,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 79 transitions. [2022-04-28 03:43:16,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 79 transitions. [2022-04-28 03:43:17,017 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-28 03:43:17,018 INFO L225 Difference]: With dead ends: 115 [2022-04-28 03:43:17,018 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:43:17,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:43:17,020 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:17,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 37 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:43:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 69. [2022-04-28 03:43:17,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:17,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:17,362 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:17,363 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:17,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:17,364 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2022-04-28 03:43:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2022-04-28 03:43:17,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:17,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:17,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 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-28 03:43:17,364 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 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-28 03:43:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:17,366 INFO L93 Difference]: Finished difference Result 101 states and 137 transitions. [2022-04-28 03:43:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 137 transitions. [2022-04-28 03:43:17,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:17,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:17,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:17,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 94 transitions. [2022-04-28 03:43:17,367 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 94 transitions. Word has length 27 [2022-04-28 03:43:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:17,367 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 94 transitions. [2022-04-28 03:43:17,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 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-28 03:43:17,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 94 transitions. [2022-04-28 03:43:20,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 94 transitions. [2022-04-28 03:43:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:43:20,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:20,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:20,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 03:43:21,165 WARN L477 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-28 03:43:21,166 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:21,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1788990354, now seen corresponding path program 7 times [2022-04-28 03:43:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:21,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543847416] [2022-04-28 03:43:24,203 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-28 03:43:24,205 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:24,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1298843955, now seen corresponding path program 1 times [2022-04-28 03:43:24,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:24,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117840743] [2022-04-28 03:43:24,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:24,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:24,214 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-28 03:43:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:24,228 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-28 03:43:24,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:24,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {8440#(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); {8429#true} is VALID [2022-04-28 03:43:24,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-28 03:43:24,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-28 03:43:24,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:24,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#(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); {8429#true} is VALID [2022-04-28 03:43:24,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-28 03:43:24,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-28 03:43:24,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret15 := main(); {8429#true} is VALID [2022-04-28 03:43:24,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {8429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8429#true} is VALID [2022-04-28 03:43:24,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {8429#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_179 v_main_~x~0_178)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (mod v_main_~x~0_179 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_17 Int)) (or (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_179 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_178 v_it_17 1) v_main_~x~0_179)))) (< 0 .cse4) (= v_main_~y~0_210 (+ v_main_~x~0_179 v_main_~y~0_211 (* v_main_~x~0_178 (- 1)))) (< v_main_~x~0_178 v_main_~x~0_179)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_179, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8429#true} is VALID [2022-04-28 03:43:24,323 INFO L290 TraceCheckUtils]: 7: Hoare triple {8429#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8429#true} is VALID [2022-04-28 03:43:24,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#true} ~z~0 := ~y~0; {8429#true} is VALID [2022-04-28 03:43:24,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {8429#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; {8434#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {8434#(<= 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; {8435#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:24,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {8435#(<= 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; {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8436#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {8436#(<= main_~z~0 (+ 4294967292 (* (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; {8437#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:43:24,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {8437#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) 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; {8438#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} is VALID [2022-04-28 03:43:24,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {8438#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:24,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:24,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {8439#(<= (+ 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:24,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {8439#(<= (+ 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:24,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {8439#(<= (+ 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; {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:24,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:24,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {8439#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {8430#false} is VALID [2022-04-28 03:43:24,332 INFO L272 TraceCheckUtils]: 22: Hoare triple {8430#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8430#false} is VALID [2022-04-28 03:43:24,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2022-04-28 03:43:24,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2022-04-28 03:43:24,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2022-04-28 03:43:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:24,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117840743] [2022-04-28 03:43:24,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117840743] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:24,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883380012] [2022-04-28 03:43:24,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:24,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:24,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:24,334 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-28 03:43:24,335 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-28 03:43:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:24,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:43:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:24,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:24,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#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); {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret15 := main(); {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {8429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {8429#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_179 v_main_~x~0_178)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (mod v_main_~x~0_179 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_17 Int)) (or (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_179 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_178 v_it_17 1) v_main_~x~0_179)))) (< 0 .cse4) (= v_main_~y~0_210 (+ v_main_~x~0_179 v_main_~y~0_211 (* v_main_~x~0_178 (- 1)))) (< v_main_~x~0_178 v_main_~x~0_179)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_179, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {8429#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8429#true} is VALID [2022-04-28 03:43:24,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#true} ~z~0 := ~y~0; {8468#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:24,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {8468#(= 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; {8472#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:24,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {8472#(and (= main_~y~0 (+ main_~z~0 1)) (< 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; {8476#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:24,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {8476#(and (= main_~y~0 (+ main_~z~0 2)) (< 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; {8480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:24,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {8480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8480#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:24,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {8480#(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; {8487#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:24,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {8487#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ 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; {8491#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:24,642 INFO L290 TraceCheckUtils]: 15: Hoare triple {8491#(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; {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-28 03:43:24,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-28 03:43:24,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {8495#(and (< 0 (mod (+ main_~y~0 3) 4294967296)) (= 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; {8502#(and (< 0 (mod (+ main_~y~0 2) 4294967296)) (= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-28 03:43:24,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {8502#(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; {8506#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:24,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {8506#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8430#false} is VALID [2022-04-28 03:43:24,645 INFO L272 TraceCheckUtils]: 22: Hoare triple {8430#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8430#false} is VALID [2022-04-28 03:43:24,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2022-04-28 03:43:24,646 INFO L290 TraceCheckUtils]: 24: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2022-04-28 03:43:24,646 INFO L290 TraceCheckUtils]: 25: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2022-04-28 03:43:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:24,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:24,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {8430#false} assume !false; {8430#false} is VALID [2022-04-28 03:43:24,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {8430#false} assume 0 == ~cond; {8430#false} is VALID [2022-04-28 03:43:24,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {8430#false} ~cond := #in~cond; {8430#false} is VALID [2022-04-28 03:43:24,791 INFO L272 TraceCheckUtils]: 22: Hoare triple {8430#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {8430#false} is VALID [2022-04-28 03:43:24,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {8430#false} is VALID [2022-04-28 03:43:24,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {8510#(< 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {8510#(< 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {8510#(< 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {8510#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {8434#(<= 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; {8510#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:43:24,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {8562#(<= 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; {8434#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {8566#(<= 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; {8562#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:24,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {8562#(<= 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; {8566#(<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {8434#(<= 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; {8562#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:24,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {8429#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; {8434#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:24,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#true} ~z~0 := ~y~0; {8429#true} is VALID [2022-04-28 03:43:24,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {8429#true} [118] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8429#true} is VALID [2022-04-28 03:43:24,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {8429#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_179 v_main_~x~0_178)) (.cse1 (= |v_main_#t~post6_79| |v_main_#t~post6_78|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_79| |v_main_#t~post5_78|)) (.cse4 (mod v_main_~x~0_179 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_17 Int)) (or (not (<= 1 v_it_17)) (< 0 (mod (+ v_main_~x~0_179 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_178 v_it_17 1) v_main_~x~0_179)))) (< 0 .cse4) (= v_main_~y~0_210 (+ v_main_~x~0_179 v_main_~y~0_211 (* v_main_~x~0_178 (- 1)))) (< v_main_~x~0_178 v_main_~x~0_179)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_179, main_#t~post6=|v_main_#t~post6_79|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_78|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8429#true} is VALID [2022-04-28 03:43:24,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {8429#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8429#true} is VALID [2022-04-28 03:43:24,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {8429#true} call #t~ret15 := main(); {8429#true} is VALID [2022-04-28 03:43:24,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8429#true} {8429#true} #83#return; {8429#true} is VALID [2022-04-28 03:43:24,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {8429#true} assume true; {8429#true} is VALID [2022-04-28 03:43:24,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {8429#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); {8429#true} is VALID [2022-04-28 03:43:24,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {8429#true} call ULTIMATE.init(); {8429#true} is VALID [2022-04-28 03:43:24,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:24,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883380012] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:24,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:24,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 6] total 21 [2022-04-28 03:43:24,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:24,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543847416] [2022-04-28 03:43:24,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543847416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:24,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:24,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:43:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918018939] [2022-04-28 03:43:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:24,908 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:24,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:24,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:24,937 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-28 03:43:24,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:43:24,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:43:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:43:24,938 INFO L87 Difference]: Start difference. First operand 69 states and 94 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:26,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:26,743 INFO L93 Difference]: Finished difference Result 112 states and 154 transitions. [2022-04-28 03:43:26,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:43:26,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:26,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:26,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2022-04-28 03:43:26,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 70 transitions. [2022-04-28 03:43:26,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 70 transitions. [2022-04-28 03:43:26,850 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-28 03:43:26,851 INFO L225 Difference]: With dead ends: 112 [2022-04-28 03:43:26,851 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 03:43:26,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=1540, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:43:26,852 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 63 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:26,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 38 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:43:26,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 03:43:27,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 82. [2022-04-28 03:43:27,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:27,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:27,318 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:27,318 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:27,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:27,320 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2022-04-28 03:43:27,320 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2022-04-28 03:43:27,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:27,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:27,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 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 107 states. [2022-04-28 03:43:27,320 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 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 107 states. [2022-04-28 03:43:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:27,322 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2022-04-28 03:43:27,322 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 144 transitions. [2022-04-28 03:43:27,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:27,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:27,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:27,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 112 transitions. [2022-04-28 03:43:27,323 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 112 transitions. Word has length 28 [2022-04-28 03:43:27,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:27,323 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 112 transitions. [2022-04-28 03:43:27,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:27,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 112 transitions. [2022-04-28 03:43:31,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 111 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 112 transitions. [2022-04-28 03:43:31,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:43:31,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:31,237 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:31,253 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-28 03:43:31,437 WARN L477 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-28 03:43:31,438 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:31,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:31,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1271884495, now seen corresponding path program 7 times [2022-04-28 03:43:31,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:31,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812758814] [2022-04-28 03:43:31,619 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-28 03:43:31,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:31,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1432698610, now seen corresponding path program 1 times [2022-04-28 03:43:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:31,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964230108] [2022-04-28 03:43:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:31,630 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-28 03:43:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,644 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-28 03:43:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {9263#(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); {9252#true} is VALID [2022-04-28 03:43:31,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-28 03:43:31,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {9252#true} call ULTIMATE.init(); {9263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:31,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {9263#(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); {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {9252#true} call #t~ret15 := main(); {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {9252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_194 4294967296)) (.cse1 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse2 (= v_main_~x~0_194 v_main_~x~0_193)) (.cse3 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_194 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~y~0_232 v_it_18 1) v_main_~y~0_231)) (not (<= 1 v_it_18)))) (= v_main_~x~0_193 (+ v_main_~x~0_194 v_main_~y~0_232 (* (- 1) v_main_~y~0_231))) (< 0 .cse0) (< v_main_~y~0_232 v_main_~y~0_231)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_231, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9252#true} is VALID [2022-04-28 03:43:31,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {9252#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9252#true} is VALID [2022-04-28 03:43:31,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {9252#true} ~z~0 := ~y~0; {9257#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:43:31,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {9257#(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; {9258#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:31,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {9258#(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; {9259#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:31,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {9259#(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; {9260#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:43:31,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {9260#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {9260#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:43:31,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {9260#(<= 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; {9261#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:31,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {9261#(<= 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; {9262#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {9262#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {9253#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; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {9253#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; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {9253#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; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {9253#false} assume !(~x~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {9253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {9253#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 22: Hoare triple {9253#false} assume !(~z~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L272 TraceCheckUtils]: 23: Hoare triple {9253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {9253#false} ~cond := #in~cond; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#false} assume 0 == ~cond; {9253#false} is VALID [2022-04-28 03:43:31,746 INFO L290 TraceCheckUtils]: 26: Hoare triple {9253#false} assume !false; {9253#false} is VALID [2022-04-28 03:43:31,747 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-28 03:43:31,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:31,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964230108] [2022-04-28 03:43:31,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964230108] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:31,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154827040] [2022-04-28 03:43:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:31,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:31,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:31,748 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-28 03:43:31,749 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-28 03:43:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:43:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:31,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:32,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {9252#true} call ULTIMATE.init(); {9252#true} is VALID [2022-04-28 03:43:32,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {9252#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); {9252#true} is VALID [2022-04-28 03:43:32,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-28 03:43:32,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-28 03:43:32,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {9252#true} call #t~ret15 := main(); {9252#true} is VALID [2022-04-28 03:43:32,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {9252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9252#true} is VALID [2022-04-28 03:43:32,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_194 4294967296)) (.cse1 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse2 (= v_main_~x~0_194 v_main_~x~0_193)) (.cse3 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_194 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~y~0_232 v_it_18 1) v_main_~y~0_231)) (not (<= 1 v_it_18)))) (= v_main_~x~0_193 (+ v_main_~x~0_194 v_main_~y~0_232 (* (- 1) v_main_~y~0_231))) (< 0 .cse0) (< v_main_~y~0_232 v_main_~y~0_231)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_231, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9252#true} is VALID [2022-04-28 03:43:32,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {9252#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9252#true} is VALID [2022-04-28 03:43:32,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {9252#true} ~z~0 := ~y~0; {9257#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:43:32,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {9257#(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; {9258#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:32,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {9258#(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; {9259#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:32,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {9259#(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; {9300#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:32,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {9300#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {9300#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:32,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {9300#(and (<= (+ 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; {9258#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:32,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {9258#(and (<= 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; {9310#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:32,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {9310#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} is VALID [2022-04-28 03:43:32,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-28 03:43:32,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {9253#false} assume !(~z~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-28 03:43:32,332 INFO L272 TraceCheckUtils]: 23: Hoare triple {9253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9253#false} is VALID [2022-04-28 03:43:32,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {9253#false} ~cond := #in~cond; {9253#false} is VALID [2022-04-28 03:43:32,332 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#false} assume 0 == ~cond; {9253#false} is VALID [2022-04-28 03:43:32,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {9253#false} assume !false; {9253#false} is VALID [2022-04-28 03:43:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:32,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:32,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {9253#false} assume !false; {9253#false} is VALID [2022-04-28 03:43:32,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {9253#false} assume 0 == ~cond; {9253#false} is VALID [2022-04-28 03:43:32,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {9253#false} ~cond := #in~cond; {9253#false} is VALID [2022-04-28 03:43:32,882 INFO L272 TraceCheckUtils]: 23: Hoare triple {9253#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {9253#false} is VALID [2022-04-28 03:43:32,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {9253#false} assume !(~z~0 % 4294967296 > 0); {9253#false} is VALID [2022-04-28 03:43:32,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9253#false} is VALID [2022-04-28 03:43:32,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9330#(<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296))} is VALID [2022-04-28 03:43:32,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {9382#(or (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9314#(<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296))} is VALID [2022-04-28 03:43:32,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {9386#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div 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; {9382#(or (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:32,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {9390#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ 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; {9386#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} is VALID [2022-04-28 03:43:32,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {9390#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9390#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:43:32,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {9397#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div 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; {9390#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (- 1) (* (- 1) main_~z~0)) (- 4294967296)) (div (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:43:32,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {9401#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) 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; {9397#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (* (- 1) main_~z~0) (- 4294967296)) (div main_~z~0 4294967296)))} is VALID [2022-04-28 03:43:32,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {9405#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~z~0)) (- 4294967296)) (div (+ (- 2) 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; {9401#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ (* (- 1) main_~z~0) 1) (- 4294967296)) (div (+ (- 1) main_~z~0) 4294967296)))} is VALID [2022-04-28 03:43:32,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {9252#true} ~z~0 := ~y~0; {9405#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~z~0)) (- 4294967296)) (div (+ (- 2) main_~z~0) 4294967296)))} is VALID [2022-04-28 03:43:32,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {9252#true} [120] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9252#true} is VALID [2022-04-28 03:43:32,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {9252#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_194 4294967296)) (.cse1 (= v_main_~y~0_232 v_main_~y~0_231)) (.cse2 (= v_main_~x~0_194 v_main_~x~0_193)) (.cse3 (= |v_main_#t~post6_84| |v_main_#t~post6_83|)) (.cse4 (= |v_main_#t~post5_84| |v_main_#t~post5_83|))) (or (and (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_194 (* 4294967295 v_it_18)) 4294967296)) (not (<= (+ v_main_~y~0_232 v_it_18 1) v_main_~y~0_231)) (not (<= 1 v_it_18)))) (= v_main_~x~0_193 (+ v_main_~x~0_194 v_main_~y~0_232 (* (- 1) v_main_~y~0_231))) (< 0 .cse0) (< v_main_~y~0_232 v_main_~y~0_231)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_232, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_194, main_#t~post6=|v_main_#t~post6_84|} OutVars{main_~y~0=v_main_~y~0_231, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_193, main_#t~post6=|v_main_#t~post6_83|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9252#true} is VALID [2022-04-28 03:43:32,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {9252#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9252#true} is VALID [2022-04-28 03:43:32,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {9252#true} call #t~ret15 := main(); {9252#true} is VALID [2022-04-28 03:43:32,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9252#true} {9252#true} #83#return; {9252#true} is VALID [2022-04-28 03:43:32,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {9252#true} assume true; {9252#true} is VALID [2022-04-28 03:43:32,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {9252#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); {9252#true} is VALID [2022-04-28 03:43:32,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {9252#true} call ULTIMATE.init(); {9252#true} is VALID [2022-04-28 03:43:32,895 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:32,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154827040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:32,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:32,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 19 [2022-04-28 03:43:33,037 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:33,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812758814] [2022-04-28 03:43:33,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812758814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:33,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:33,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:43:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759800473] [2022-04-28 03:43:33,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:33,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:33,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:33,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:33,061 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-28 03:43:33,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:43:33,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:33,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:43:33,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:43:33,062 INFO L87 Difference]: Start difference. First operand 82 states and 112 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:35,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:35,123 INFO L93 Difference]: Finished difference Result 109 states and 144 transitions. [2022-04-28 03:43:35,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:43:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:35,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-28 03:43:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-28 03:43:35,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions. [2022-04-28 03:43:35,207 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-28 03:43:35,208 INFO L225 Difference]: With dead ends: 109 [2022-04-28 03:43:35,208 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 03:43:35,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=1109, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:43:35,209 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:35,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 60 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:43:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 03:43:35,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-04-28 03:43:35,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:35,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,562 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,570 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:35,588 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2022-04-28 03:43:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-28 03:43:35,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:35,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:35,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 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 91 states. [2022-04-28 03:43:35,588 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 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 91 states. [2022-04-28 03:43:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:35,589 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2022-04-28 03:43:35,589 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 120 transitions. [2022-04-28 03:43:35,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:35,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:35,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:35,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:35,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 92 transitions. [2022-04-28 03:43:35,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 92 transitions. Word has length 29 [2022-04-28 03:43:35,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:35,591 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 92 transitions. [2022-04-28 03:43:35,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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-28 03:43:35,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 92 transitions. [2022-04-28 03:43:39,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 91 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:39,582 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 92 transitions. [2022-04-28 03:43:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:43:39,583 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:39,583 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:39,601 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-28 03:43:39,783 WARN L477 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-28 03:43:39,783 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:39,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:39,784 INFO L85 PathProgramCache]: Analyzing trace with hash 22222479, now seen corresponding path program 8 times [2022-04-28 03:43:39,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:39,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454243682] [2022-04-28 03:43:39,954 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-28 03:43:39,955 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:39,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1217660046, now seen corresponding path program 1 times [2022-04-28 03:43:39,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:39,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784533095] [2022-04-28 03:43:39,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:39,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:39,965 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-28 03:43:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:39,982 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-28 03:43:40,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:40,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {10020#(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); {10008#true} is VALID [2022-04-28 03:43:40,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-28 03:43:40,092 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-28 03:43:40,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {10008#true} call ULTIMATE.init(); {10020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:40,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {10020#(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); {10008#true} is VALID [2022-04-28 03:43:40,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-28 03:43:40,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-28 03:43:40,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {10008#true} call #t~ret15 := main(); {10008#true} is VALID [2022-04-28 03:43:40,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10008#true} is VALID [2022-04-28 03:43:40,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse3 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse1 (mod v_main_~x~0_209 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~y~0_249 v_main_~y~0_250)) (and .cse0 .cse2 .cse3 (= v_main_~y~0_250 v_main_~y~0_249)) (and (< v_main_~x~0_208 v_main_~x~0_209) (= (+ v_main_~x~0_209 v_main_~y~0_250 (* v_main_~x~0_208 (- 1))) v_main_~y~0_249) (< 0 .cse1) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_208 v_it_19 1) v_main_~x~0_209)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_209 (* 4294967295 v_it_19)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_209, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_208, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10008#true} is VALID [2022-04-28 03:43:40,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {10008#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10008#true} is VALID [2022-04-28 03:43:40,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {10008#true} ~z~0 := ~y~0; {10008#true} is VALID [2022-04-28 03:43:40,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {10008#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; {10013#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:40,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {10013#(<= 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; {10014#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:43:40,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {10014#(<= 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; {10008#true} is VALID [2022-04-28 03:43:40,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {10008#true} assume !(~z~0 % 4294967296 > 0); {10015#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:43:40,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {10015#(<= (* (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; {10016#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:43:40,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {10016#(<= (+ (* (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; {10017#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} is VALID [2022-04-28 03:43:40,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {10017#(<= (+ (* 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; {10018#(<= (+ 3 (* (div (+ 4294967292 main_~z~0) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:43:40,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {10018#(<= (+ 3 (* (div (+ 4294967292 main_~z~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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:43:40,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:43:40,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:43:40,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:43:40,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:43:40,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:43:40,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {10019#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,102 INFO L272 TraceCheckUtils]: 23: Hoare triple {10009#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10009#false} is VALID [2022-04-28 03:43:40,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#false} ~cond := #in~cond; {10009#false} is VALID [2022-04-28 03:43:40,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#false} assume 0 == ~cond; {10009#false} is VALID [2022-04-28 03:43:40,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {10009#false} assume !false; {10009#false} is VALID [2022-04-28 03:43:40,102 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:43:40,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:40,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784533095] [2022-04-28 03:43:40,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784533095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:40,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321614775] [2022-04-28 03:43:40,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:40,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:40,104 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-28 03:43:40,105 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-28 03:43:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:43:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:40,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:40,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {10008#true} call ULTIMATE.init(); {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {10008#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); {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {10008#true} call #t~ret15 := main(); {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse3 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse1 (mod v_main_~x~0_209 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~y~0_249 v_main_~y~0_250)) (and .cse0 .cse2 .cse3 (= v_main_~y~0_250 v_main_~y~0_249)) (and (< v_main_~x~0_208 v_main_~x~0_209) (= (+ v_main_~x~0_209 v_main_~y~0_250 (* v_main_~x~0_208 (- 1))) v_main_~y~0_249) (< 0 .cse1) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_208 v_it_19 1) v_main_~x~0_209)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_209 (* 4294967295 v_it_19)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_209, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_208, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10008#true} is VALID [2022-04-28 03:43:40,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {10008#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10008#true} is VALID [2022-04-28 03:43:40,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {10008#true} ~z~0 := ~y~0; {10048#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:40,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#(= 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; {10052#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:40,344 INFO L290 TraceCheckUtils]: 10: Hoare triple {10052#(= 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; {10056#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:43:40,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {10056#(= (+ 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; {10060#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:43:40,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {10060#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {10064#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:40,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {10064#(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; {10068#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:43:40,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {10068#(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; {10072#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(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; {10076#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {10076#(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; {10009#false} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {10009#false} assume !(~y~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {10009#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; {10009#false} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {10009#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; {10009#false} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {10009#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; {10009#false} is VALID [2022-04-28 03:43:40,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#false} assume !(~x~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {10009#false} assume !(~z~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,349 INFO L272 TraceCheckUtils]: 23: Hoare triple {10009#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10009#false} is VALID [2022-04-28 03:43:40,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#false} ~cond := #in~cond; {10009#false} is VALID [2022-04-28 03:43:40,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#false} assume 0 == ~cond; {10009#false} is VALID [2022-04-28 03:43:40,349 INFO L290 TraceCheckUtils]: 26: Hoare triple {10009#false} assume !false; {10009#false} is VALID [2022-04-28 03:43:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:40,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:40,563 INFO L290 TraceCheckUtils]: 26: Hoare triple {10009#false} assume !false; {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {10009#false} assume 0 == ~cond; {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {10009#false} ~cond := #in~cond; {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L272 TraceCheckUtils]: 23: Hoare triple {10009#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {10009#false} assume !(~z~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {10009#false} assume !(~x~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {10009#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; {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {10009#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; {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {10009#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; {10009#false} is VALID [2022-04-28 03:43:40,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {10009#false} assume !(~y~0 % 4294967296 > 0); {10009#false} is VALID [2022-04-28 03:43:40,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {10076#(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; {10009#false} is VALID [2022-04-28 03:43:40,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {10072#(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; {10076#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:40,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {10068#(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; {10072#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:40,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {10064#(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; {10068#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:43:40,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {10152#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {10064#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:40,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {10156#(or (not (< 0 (mod (+ main_~y~0 4294967293) 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; {10152#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:43:40,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {10160#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 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; {10156#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:40,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {10164#(or (not (< 0 (mod (+ main_~y~0 4294967293) 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; {10160#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:43:40,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {10008#true} ~z~0 := ~y~0; {10164#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:40,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {10008#true} [122] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10008#true} is VALID [2022-04-28 03:43:40,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {10008#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_89| |v_main_#t~post5_88|)) (.cse2 (= |v_main_#t~post6_89| |v_main_#t~post6_88|)) (.cse3 (= v_main_~x~0_209 v_main_~x~0_208)) (.cse1 (mod v_main_~x~0_209 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 (= v_main_~y~0_249 v_main_~y~0_250)) (and .cse0 .cse2 .cse3 (= v_main_~y~0_250 v_main_~y~0_249)) (and (< v_main_~x~0_208 v_main_~x~0_209) (= (+ v_main_~x~0_209 v_main_~y~0_250 (* v_main_~x~0_208 (- 1))) v_main_~y~0_249) (< 0 .cse1) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_208 v_it_19 1) v_main_~x~0_209)) (not (<= 1 v_it_19)) (< 0 (mod (+ v_main_~x~0_209 (* 4294967295 v_it_19)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_250, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_209, main_#t~post6=|v_main_#t~post6_89|} OutVars{main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_208, main_#t~post6=|v_main_#t~post6_88|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10008#true} is VALID [2022-04-28 03:43:40,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {10008#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10008#true} is VALID [2022-04-28 03:43:40,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {10008#true} call #t~ret15 := main(); {10008#true} is VALID [2022-04-28 03:43:40,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10008#true} {10008#true} #83#return; {10008#true} is VALID [2022-04-28 03:43:40,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {10008#true} assume true; {10008#true} is VALID [2022-04-28 03:43:40,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {10008#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); {10008#true} is VALID [2022-04-28 03:43:40,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {10008#true} call ULTIMATE.init(); {10008#true} is VALID [2022-04-28 03:43:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:40,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321614775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:40,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:40,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-28 03:43:40,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:40,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454243682] [2022-04-28 03:43:40,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454243682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:40,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:40,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:43:40,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279911305] [2022-04-28 03:43:40,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:40,700 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-28 03:43:40,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:40,700 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-28 03:43:40,723 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-28 03:43:40,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:43:40,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:43:40,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:43:40,724 INFO L87 Difference]: Start difference. First operand 69 states and 92 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-28 03:43:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:43,454 INFO L93 Difference]: Finished difference Result 155 states and 219 transitions. [2022-04-28 03:43:43,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:43:43,454 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-28 03:43:43,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:43,455 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-28 03:43:43,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 97 transitions. [2022-04-28 03:43:43,457 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-28 03:43:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 97 transitions. [2022-04-28 03:43:43,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 97 transitions. [2022-04-28 03:43:43,642 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-28 03:43:43,644 INFO L225 Difference]: With dead ends: 155 [2022-04-28 03:43:43,644 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 03:43:43,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=512, Invalid=2458, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:43:43,645 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 95 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:43,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 38 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:43:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 03:43:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 95. [2022-04-28 03:43:44,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:44,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,150 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,150 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:44,152 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-28 03:43:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-28 03:43:44,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:44,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:44,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 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 149 states. [2022-04-28 03:43:44,153 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 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 149 states. [2022-04-28 03:43:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:44,154 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-04-28 03:43:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 203 transitions. [2022-04-28 03:43:44,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:44,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:44,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:44,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:44,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2022-04-28 03:43:44,156 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 29 [2022-04-28 03:43:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:44,156 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2022-04-28 03:43:44,156 INFO L496 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-28 03:43:44,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 134 transitions. [2022-04-28 03:43:48,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:48,669 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2022-04-28 03:43:48,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:43:48,669 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:48,669 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:48,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:48,870 WARN L477 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-28 03:43:48,870 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:48,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 723391956, now seen corresponding path program 8 times [2022-04-28 03:43:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:48,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146244911] [2022-04-28 03:43:49,050 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-28 03:43:49,052 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -231192587, now seen corresponding path program 1 times [2022-04-28 03:43:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:49,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136814623] [2022-04-28 03:43:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:49,062 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-28 03:43:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,085 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-28 03:43:49,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {11069#(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); {11056#true} is VALID [2022-04-28 03:43:49,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-28 03:43:49,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {11056#true} call ULTIMATE.init(); {11069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:49,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {11069#(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); {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {11056#true} call #t~ret15 := main(); {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {11056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {11056#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_224 4294967296)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= v_main_~x~0_224 v_main_~x~0_223)) (.cse3 (= |v_main_#t~post6_94| |v_main_#t~post6_93|))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) (<= .cse0 0) .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_224 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268)))) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_223 (+ v_main_~x~0_224 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (< 0 .cse0)) (and .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_224, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_223, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11056#true} is VALID [2022-04-28 03:43:49,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {11056#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11056#true} is VALID [2022-04-28 03:43:49,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {11056#true} ~z~0 := ~y~0; {11061#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:49,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {11061#(= (+ 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; {11062#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:49,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {11062#(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; {11063#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:49,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {11063#(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; {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:49,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11065#(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-28 03:43:49,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {11065#(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; {11066#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:49,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(<= 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; {11067#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:49,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(<= 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; {11068#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= 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; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#false} assume !(~y~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {11057#false} assume !(~x~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {11057#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#false} assume !(~z~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L272 TraceCheckUtils]: 24: Hoare triple {11057#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#false} ~cond := #in~cond; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#false} assume 0 == ~cond; {11057#false} is VALID [2022-04-28 03:43:49,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#false} assume !false; {11057#false} is VALID [2022-04-28 03:43:49,227 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-28 03:43:49,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136814623] [2022-04-28 03:43:49,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136814623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:49,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381769665] [2022-04-28 03:43:49,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:49,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:49,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:49,228 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-28 03:43:49,229 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-28 03:43:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:43:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:49,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:49,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {11056#true} call ULTIMATE.init(); {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#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); {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {11056#true} call #t~ret15 := main(); {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {11056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {11056#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_224 4294967296)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= v_main_~x~0_224 v_main_~x~0_223)) (.cse3 (= |v_main_#t~post6_94| |v_main_#t~post6_93|))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) (<= .cse0 0) .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_224 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268)))) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_223 (+ v_main_~x~0_224 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (< 0 .cse0)) (and .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_224, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_223, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11056#true} is VALID [2022-04-28 03:43:49,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {11056#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11056#true} is VALID [2022-04-28 03:43:49,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {11056#true} ~z~0 := ~y~0; {11061#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:43:49,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {11061#(= (+ 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; {11062#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:49,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {11062#(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; {11063#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:49,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {11063#(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; {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:49,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {11064#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11109#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:43:49,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {11109#(<= (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; {11066#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:49,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(<= 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; {11067#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:49,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(<= 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; {11068#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:49,619 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= 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; {11057#false} is VALID [2022-04-28 03:43:49,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#false} assume !(~y~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:49,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:49,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {11057#false} assume !(~x~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {11057#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#false} assume !(~z~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L272 TraceCheckUtils]: 24: Hoare triple {11057#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#false} ~cond := #in~cond; {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#false} assume 0 == ~cond; {11057#false} is VALID [2022-04-28 03:43:49,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#false} assume !false; {11057#false} is VALID [2022-04-28 03:43:49,620 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-28 03:43:49,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:50,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {11057#false} assume !false; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {11057#false} assume 0 == ~cond; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {11057#false} ~cond := #in~cond; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L272 TraceCheckUtils]: 24: Hoare triple {11057#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {11057#false} assume !(~z~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {11057#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {11057#false} assume !(~x~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 18: Hoare triple {11057#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; {11057#false} is VALID [2022-04-28 03:43:50,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {11057#false} assume !(~y~0 % 4294967296 > 0); {11057#false} is VALID [2022-04-28 03:43:50,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {11068#(<= 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; {11057#false} is VALID [2022-04-28 03:43:50,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {11067#(<= 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; {11068#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:50,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {11066#(<= 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; {11067#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:50,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {11109#(<= (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; {11066#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:50,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {11200#(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); {11109#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:43:50,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {11204#(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; {11200#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:43:50,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {11208#(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; {11204#(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-28 03:43:50,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {11212#(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; {11208#(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-28 03:43:50,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {11056#true} ~z~0 := ~y~0; {11212#(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-28 03:43:50,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {11056#true} [124] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {11056#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_224 4294967296)) (.cse1 (= |v_main_#t~post5_94| |v_main_#t~post5_93|)) (.cse2 (= v_main_~x~0_224 v_main_~x~0_223)) (.cse3 (= |v_main_#t~post6_94| |v_main_#t~post6_93|))) (or (and (= v_main_~y~0_268 v_main_~y~0_269) (<= .cse0 0) .cse1 .cse2 .cse3) (and (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (< 0 (mod (+ v_main_~x~0_224 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~y~0_269 v_it_20 1) v_main_~y~0_268)))) (< v_main_~y~0_269 v_main_~y~0_268) (= v_main_~x~0_223 (+ v_main_~x~0_224 v_main_~y~0_269 (* (- 1) v_main_~y~0_268))) (< 0 .cse0)) (and .cse1 (= v_main_~y~0_269 v_main_~y~0_268) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_269, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_224, main_#t~post6=|v_main_#t~post6_94|} OutVars{main_~y~0=v_main_~y~0_268, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_223, main_#t~post6=|v_main_#t~post6_93|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {11056#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {11056#true} call #t~ret15 := main(); {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11056#true} {11056#true} #83#return; {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {11056#true} assume true; {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {11056#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); {11056#true} is VALID [2022-04-28 03:43:50,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {11056#true} call ULTIMATE.init(); {11056#true} is VALID [2022-04-28 03:43:50,206 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-28 03:43:50,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381769665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:50,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:50,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 03:43:50,353 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:50,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146244911] [2022-04-28 03:43:50,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146244911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:50,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:50,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:43:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14609159] [2022-04-28 03:43:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:50,353 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 30 [2022-04-28 03:43:50,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:50,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:43:50,377 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-28 03:43:50,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:43:50,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:50,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:43:50,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:43:50,378 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:43:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:52,543 INFO L93 Difference]: Finished difference Result 125 states and 167 transitions. [2022-04-28 03:43:52,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:43:52,543 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 30 [2022-04-28 03:43:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:52,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:43:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-28 03:43:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:43:52,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 57 transitions. [2022-04-28 03:43:52,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 57 transitions. [2022-04-28 03:43:52,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:52,636 INFO L225 Difference]: With dead ends: 125 [2022-04-28 03:43:52,636 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 03:43:52,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=905, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:43:52,637 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:52,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 70 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:43:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 03:43:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 91. [2022-04-28 03:43:53,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:53,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:53,136 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:53,137 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:53,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:53,138 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-04-28 03:43:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2022-04-28 03:43:53,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:53,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:53,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 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-28 03:43:53,139 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 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-28 03:43:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:53,140 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2022-04-28 03:43:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 143 transitions. [2022-04-28 03:43:53,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:53,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:53,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:53,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 86 states have internal predecessors, (121), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:53,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2022-04-28 03:43:53,141 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 30 [2022-04-28 03:43:53,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:53,142 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2022-04-28 03:43:53,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:43:53,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 125 transitions. [2022-04-28 03:43:56,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2022-04-28 03:43:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:43:56,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:56,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:56,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 03:43:56,227 WARN L477 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-28 03:43:56,227 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:56,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:56,228 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 9 times [2022-04-28 03:43:56,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:56,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049366733] [2022-04-28 03:44:00,351 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:00,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:44:00,440 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:00,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1657570544, now seen corresponding path program 1 times [2022-04-28 03:44:00,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:00,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514483075] [2022-04-28 03:44:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:00,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:00,450 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-28 03:44:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:00,479 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:00,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {11935#(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); {11919#true} is VALID [2022-04-28 03:44:00,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-28 03:44:00,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {11919#true} call ULTIMATE.init(); {11935#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:00,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {11935#(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); {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {11919#true} call #t~ret15 := main(); {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {11919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {11919#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= v_main_~x~0_239 v_main_~x~0_238)) (.cse3 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse0 (mod v_main_~x~0_239 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= v_main_~y~0_289 v_main_~y~0_290) .cse3) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse1 .cse2 .cse3) (and (< v_main_~y~0_290 v_main_~y~0_289) (= v_main_~x~0_238 (+ v_main_~x~0_239 v_main_~y~0_290 (* (- 1) v_main_~y~0_289))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_290 v_it_21 1) v_main_~y~0_289)) (< 0 (mod (+ v_main_~x~0_239 (* 4294967295 v_it_21)) 4294967296)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_290, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_239, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11919#true} is VALID [2022-04-28 03:44:00,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {11919#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11919#true} is VALID [2022-04-28 03:44:00,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {11919#true} ~z~0 := ~y~0; {11924#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:00,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(= (+ 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; {11925#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:00,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {11925#(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; {11926#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:00,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {11926#(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; {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:00,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11928#(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-28 03:44:00,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {11928#(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; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:00,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {11929#(<= 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; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:00,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {11930#(<= 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; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:00,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:00,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#(<= 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; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:00,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {11930#(<= 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; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:00,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {11929#(<= main_~y~0 (+ 2 (* (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; {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:00,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:00,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:00,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:00,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:00,693 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:00,694 INFO L272 TraceCheckUtils]: 25: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {11933#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:44:00,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {11933#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11934#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:44:00,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {11934#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11920#false} is VALID [2022-04-28 03:44:00,695 INFO L290 TraceCheckUtils]: 28: Hoare triple {11920#false} assume !false; {11920#false} is VALID [2022-04-28 03:44:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514483075] [2022-04-28 03:44:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514483075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849667436] [2022-04-28 03:44:00,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:00,708 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-28 03:44:00,727 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-28 03:44:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:00,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 03:44:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:00,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:01,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {11919#true} call ULTIMATE.init(); {11919#true} is VALID [2022-04-28 03:44:01,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {11919#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); {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {11919#true} call #t~ret15 := main(); {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {11919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {11919#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= v_main_~x~0_239 v_main_~x~0_238)) (.cse3 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse0 (mod v_main_~x~0_239 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= v_main_~y~0_289 v_main_~y~0_290) .cse3) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse1 .cse2 .cse3) (and (< v_main_~y~0_290 v_main_~y~0_289) (= v_main_~x~0_238 (+ v_main_~x~0_239 v_main_~y~0_290 (* (- 1) v_main_~y~0_289))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_290 v_it_21 1) v_main_~y~0_289)) (< 0 (mod (+ v_main_~x~0_239 (* 4294967295 v_it_21)) 4294967296)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_290, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_239, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {11919#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11919#true} is VALID [2022-04-28 03:44:01,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {11919#true} ~z~0 := ~y~0; {11924#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:01,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {11924#(= (+ 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; {11925#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:01,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {11925#(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; {11926#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:01,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {11926#(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; {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:01,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {11927#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:01,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {11927#(and (<= (+ 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; {11925#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:01,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {11925#(and (<= 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; {11981#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:44:01,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {11981#(and (<= (+ main_~y~0 1) main_~z~0) (<= 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; {11985#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-28 03:44:01,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {11985#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} assume !(~y~0 % 4294967296 > 0); {11989#(and (not (< 0 (mod main_~y~0 4294967296))) (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-28 03:44:01,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {11989#(and (not (< 0 (mod main_~y~0 4294967296))) (<= (+ main_~y~0 3) main_~z~0) (<= 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; {11993#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:01,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {11993#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0) (not (< 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; {11997#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:44:01,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {11997#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)) (not (< 0 (mod (+ main_~y~0 4294967294) 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; {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:44:01,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:44:01,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {12001#(and (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12008#(and (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:44:01,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {12008#(and (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12012#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:01,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {12012#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:01,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:01,337 INFO L272 TraceCheckUtils]: 25: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:44:01,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:44:01,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11920#false} is VALID [2022-04-28 03:44:01,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {11920#false} assume !false; {11920#false} is VALID [2022-04-28 03:44:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:44:01,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:01,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {11920#false} assume !false; {11920#false} is VALID [2022-04-28 03:44:01,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {12026#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11920#false} is VALID [2022-04-28 03:44:01,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12026#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:44:01,477 INFO L272 TraceCheckUtils]: 25: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12022#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:44:01,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:01,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:01,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:01,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:01,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:01,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {11929#(<= main_~y~0 (+ 2 (* (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; {11932#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:01,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {11930#(<= 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; {11929#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:01,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {11931#(<= 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; {11930#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {11919#true} assume !(~y~0 % 4294967296 > 0); {11931#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {11919#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; {11919#true} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {11919#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; {11919#true} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {11919#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; {11919#true} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {11919#true} assume !(~z~0 % 4294967296 > 0); {11919#true} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {11919#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; {11919#true} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {11919#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; {11919#true} is VALID [2022-04-28 03:44:01,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {11919#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; {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {11919#true} ~z~0 := ~y~0; {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {11919#true} [126] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {11919#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_99| |v_main_#t~post5_98|)) (.cse2 (= v_main_~x~0_239 v_main_~x~0_238)) (.cse3 (= |v_main_#t~post6_99| |v_main_#t~post6_98|)) (.cse0 (mod v_main_~x~0_239 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= v_main_~y~0_289 v_main_~y~0_290) .cse3) (and (= v_main_~y~0_290 v_main_~y~0_289) .cse1 .cse2 .cse3) (and (< v_main_~y~0_290 v_main_~y~0_289) (= v_main_~x~0_238 (+ v_main_~x~0_239 v_main_~y~0_290 (* (- 1) v_main_~y~0_289))) (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_290 v_it_21 1) v_main_~y~0_289)) (< 0 (mod (+ v_main_~x~0_239 (* 4294967295 v_it_21)) 4294967296)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_290, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_239, main_#t~post6=|v_main_#t~post6_99|} OutVars{main_~y~0=v_main_~y~0_289, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_238, main_#t~post6=|v_main_#t~post6_98|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {11919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {11919#true} call #t~ret15 := main(); {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11919#true} {11919#true} #83#return; {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {11919#true} assume true; {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {11919#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); {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {11919#true} call ULTIMATE.init(); {11919#true} is VALID [2022-04-28 03:44:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:44:01,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849667436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:01,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:01,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 8] total 24 [2022-04-28 03:44:01,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:01,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049366733] [2022-04-28 03:44:01,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049366733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:01,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:01,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:44:01,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508700816] [2022-04-28 03:44:01,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:01,601 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) 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 31 [2022-04-28 03:44:01,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:01,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) 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-28 03:44:01,633 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-28 03:44:01,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:44:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:01,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:44:01,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:44:01,634 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) 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-28 03:44:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:04,654 INFO L93 Difference]: Finished difference Result 201 states and 279 transitions. [2022-04-28 03:44:04,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:44:04,655 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) 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 31 [2022-04-28 03:44:04,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) 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-28 03:44:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 03:44:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) 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-28 03:44:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 03:44:04,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-28 03:44:04,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:04,755 INFO L225 Difference]: With dead ends: 201 [2022-04-28 03:44:04,755 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 03:44:04,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 55 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:44:04,756 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:04,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 84 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:44:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 03:44:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 96. [2022-04-28 03:44:05,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:05,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,292 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,292 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:05,294 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2022-04-28 03:44:05,294 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2022-04-28 03:44:05,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:05,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:05,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 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 109 states. [2022-04-28 03:44:05,295 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 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 109 states. [2022-04-28 03:44:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:05,300 INFO L93 Difference]: Finished difference Result 109 states and 150 transitions. [2022-04-28 03:44:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 150 transitions. [2022-04-28 03:44:05,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:05,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:05,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:05,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 135 transitions. [2022-04-28 03:44:05,302 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 135 transitions. Word has length 31 [2022-04-28 03:44:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:05,303 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 135 transitions. [2022-04-28 03:44:05,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) 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-28 03:44:05,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 135 transitions. [2022-04-28 03:44:09,767 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-28 03:44:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 135 transitions. [2022-04-28 03:44:09,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:44:09,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:09,768 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:09,784 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-28 03:44:09,968 WARN L477 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-28 03:44:09,968 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:09,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash -489644828, now seen corresponding path program 10 times [2022-04-28 03:44:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:09,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133478123] [2022-04-28 03:44:10,128 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-28 03:44:10,129 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1756115184, now seen corresponding path program 1 times [2022-04-28 03:44:10,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:10,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396023970] [2022-04-28 03:44:10,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:10,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:10,147 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-28 03:44:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:10,160 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-28 03:44:10,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:10,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {12989#(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); {12977#true} is VALID [2022-04-28 03:44:10,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-28 03:44:10,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-28 03:44:10,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {12977#true} call ULTIMATE.init(); {12989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:10,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {12989#(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); {12977#true} is VALID [2022-04-28 03:44:10,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-28 03:44:10,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-28 03:44:10,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {12977#true} call #t~ret15 := main(); {12977#true} is VALID [2022-04-28 03:44:10,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {12977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12977#true} is VALID [2022-04-28 03:44:10,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {12977#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_314 v_main_~y~0_313)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_251 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_251 v_main_~y~0_314 (* v_main_~x~0_250 (- 1))) v_main_~y~0_313) (< v_main_~x~0_250 v_main_~x~0_251) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_251 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~x~0_250 v_it_22 1) v_main_~x~0_251)) (not (<= 1 v_it_22)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_314, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_313, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_250, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12977#true} is VALID [2022-04-28 03:44:10,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {12977#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12982#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:10,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {12982#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12982#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:10,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {12982#(<= 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; {12983#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:10,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {12983#(<= 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; {12984#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:10,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {12984#(<= 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; {12985#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:10,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {12985#(<= 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; {12986#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:10,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {12986#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:10,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:10,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {12987#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:10,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {12987#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:10,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {12987#(<= 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; {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:10,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {12987#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:10,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {12987#(<= 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; {12988#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:44:10,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {12988#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#false} assume !(~z~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L272 TraceCheckUtils]: 25: Hoare triple {12978#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {12978#false} ~cond := #in~cond; {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {12978#false} assume 0 == ~cond; {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {12978#false} assume !false; {12978#false} is VALID [2022-04-28 03:44:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:44:10,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396023970] [2022-04-28 03:44:10,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396023970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:10,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296684506] [2022-04-28 03:44:10,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:10,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:10,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:10,298 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-28 03:44:10,301 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-28 03:44:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:10,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:44:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:10,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:10,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {12977#true} call ULTIMATE.init(); {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {12977#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); {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {12977#true} call #t~ret15 := main(); {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {12977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {12977#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_314 v_main_~y~0_313)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_251 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_251 v_main_~y~0_314 (* v_main_~x~0_250 (- 1))) v_main_~y~0_313) (< v_main_~x~0_250 v_main_~x~0_251) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_251 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~x~0_250 v_it_22 1) v_main_~x~0_251)) (not (<= 1 v_it_22)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_314, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_313, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_250, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12977#true} is VALID [2022-04-28 03:44:10,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {12977#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12977#true} is VALID [2022-04-28 03:44:10,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {12977#true} ~z~0 := ~y~0; {13017#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:10,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {13017#(= 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; {13021#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:10,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {13021#(= 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; {13025#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:44:10,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {13025#(= 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; {13029#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:44:10,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {13029#(= 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:10,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {13033#(< 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:10,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:10,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {13033#(< 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; {13043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:10,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {13043#(< 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; {13047#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:10,532 INFO L290 TraceCheckUtils]: 17: Hoare triple {13047#(< 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; {13051#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {13051#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {12978#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; {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {12978#false} assume !(~x~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#false} assume !(~z~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L272 TraceCheckUtils]: 25: Hoare triple {12978#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {12978#false} ~cond := #in~cond; {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {12978#false} assume 0 == ~cond; {12978#false} is VALID [2022-04-28 03:44:10,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {12978#false} assume !false; {12978#false} is VALID [2022-04-28 03:44:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 03:44:10,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:10,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {12978#false} assume !false; {12978#false} is VALID [2022-04-28 03:44:10,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {12978#false} assume 0 == ~cond; {12978#false} is VALID [2022-04-28 03:44:10,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {12978#false} ~cond := #in~cond; {12978#false} is VALID [2022-04-28 03:44:10,752 INFO L272 TraceCheckUtils]: 25: Hoare triple {12978#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {12978#false} is VALID [2022-04-28 03:44:10,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#false} assume !(~z~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {12978#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12978#false} is VALID [2022-04-28 03:44:10,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {12978#false} assume !(~x~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {12978#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; {12978#false} is VALID [2022-04-28 03:44:10,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {13051#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12978#false} is VALID [2022-04-28 03:44:10,754 INFO L290 TraceCheckUtils]: 17: Hoare triple {13047#(< 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; {13051#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:10,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {13043#(< 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; {13047#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:10,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {13033#(< 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; {13043#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:44:10,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:10,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {13033#(< 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:10,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {13133#(or (not (< 0 (mod main_~z~0 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; {13033#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:44:10,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {13137#(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; {13133#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:10,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {13141#(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; {13137#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:10,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {13145#(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; {13141#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:10,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {12977#true} ~z~0 := ~y~0; {13145#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:10,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {12977#true} [128] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {12977#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_314 v_main_~y~0_313)) (.cse1 (= |v_main_#t~post5_104| |v_main_#t~post5_103|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= |v_main_#t~post6_104| |v_main_#t~post6_103|)) (.cse4 (mod v_main_~x~0_251 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_251 v_main_~y~0_314 (* v_main_~x~0_250 (- 1))) v_main_~y~0_313) (< v_main_~x~0_250 v_main_~x~0_251) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_251 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~x~0_250 v_it_22 1) v_main_~x~0_251)) (not (<= 1 v_it_22)))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_314, main_#t~post5=|v_main_#t~post5_104|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_104|} OutVars{main_~y~0=v_main_~y~0_313, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_250, main_#t~post6=|v_main_#t~post6_103|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {12977#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {12977#true} call #t~ret15 := main(); {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12977#true} {12977#true} #83#return; {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {12977#true} assume true; {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {12977#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); {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {12977#true} call ULTIMATE.init(); {12977#true} is VALID [2022-04-28 03:44:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 03:44:10,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296684506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:10,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:10,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-28 03:44:11,032 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:11,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133478123] [2022-04-28 03:44:11,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133478123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:11,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:11,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:44:11,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980422892] [2022-04-28 03:44:11,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:11,033 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:11,033 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:11,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:11,057 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-28 03:44:11,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:44:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:11,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:44:11,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:44:11,058 INFO L87 Difference]: Start difference. First operand 96 states and 135 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:13,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:13,635 INFO L93 Difference]: Finished difference Result 206 states and 315 transitions. [2022-04-28 03:44:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:44:13,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-28 03:44:13,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:13,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 91 transitions. [2022-04-28 03:44:13,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 91 transitions. [2022-04-28 03:44:13,827 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-28 03:44:13,830 INFO L225 Difference]: With dead ends: 206 [2022-04-28 03:44:13,830 INFO L226 Difference]: Without dead ends: 186 [2022-04-28 03:44:13,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=1389, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:44:13,831 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 101 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:13,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 37 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:44:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-28 03:44:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 109. [2022-04-28 03:44:14,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:14,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:14,498 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:14,498 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:14,500 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2022-04-28 03:44:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2022-04-28 03:44:14,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:14,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:14,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 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-28 03:44:14,501 INFO L87 Difference]: Start difference. First operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 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-28 03:44:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:14,503 INFO L93 Difference]: Finished difference Result 186 states and 269 transitions. [2022-04-28 03:44:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 269 transitions. [2022-04-28 03:44:14,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:14,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:14,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:14,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 104 states have internal predecessors, (151), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 155 transitions. [2022-04-28 03:44:14,505 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 155 transitions. Word has length 32 [2022-04-28 03:44:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:14,505 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 155 transitions. [2022-04-28 03:44:14,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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-28 03:44:14,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 155 transitions. [2022-04-28 03:44:21,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 153 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 155 transitions. [2022-04-28 03:44:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:44:21,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:21,770 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:21,787 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 03:44:21,971 WARN L477 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-28 03:44:21,971 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:21,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:21,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1347809343, now seen corresponding path program 11 times [2022-04-28 03:44:21,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:21,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1795968144] [2022-04-28 03:44:22,189 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-28 03:44:22,190 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:22,192 INFO L85 PathProgramCache]: Analyzing trace with hash 401830741, now seen corresponding path program 1 times [2022-04-28 03:44:22,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:22,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649930246] [2022-04-28 03:44:22,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:22,204 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-28 03:44:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:22,237 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-28 03:44:22,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:22,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {14225#(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); {14211#true} is VALID [2022-04-28 03:44:22,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-28 03:44:22,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {14211#true} call ULTIMATE.init(); {14225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:22,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {14225#(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); {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {14211#true} call #t~ret15 := main(); {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {14211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {14211#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_334 v_main_~y~0_333)) (.cse1 (= v_main_~x~0_267 v_main_~x~0_266)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (mod v_main_~x~0_267 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (= v_main_~x~0_266 (+ v_main_~x~0_267 v_main_~y~0_334 (* (- 1) v_main_~y~0_333))) (< v_main_~y~0_334 v_main_~y~0_333) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_267 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~y~0_334 v_it_23 1) v_main_~y~0_333))))))) InVars {main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_267, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_266, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {14211#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14211#true} is VALID [2022-04-28 03:44:22,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {14211#true} ~z~0 := ~y~0; {14211#true} is VALID [2022-04-28 03:44:22,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {14211#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; {14216#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {14216#(<= 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; {14217#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:22,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {14217#(<= 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; {14218#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {14218#(<= 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; {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {14219#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {14219#(<= 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; {14220#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:22,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {14220#(<= 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; {14221#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:44:22,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {14221#(<= 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; {14222#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {14222#(<= 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; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~y~0 % 4294967296 > 0); {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {14223#(<= 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; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {14223#(<= 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; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {14223#(<= 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; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {14223#(<= 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; {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~x~0 % 4294967296 > 0); {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:44:22,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {14223#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14224#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:22,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {14224#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {14212#false} is VALID [2022-04-28 03:44:22,394 INFO L272 TraceCheckUtils]: 26: Hoare triple {14212#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14212#false} is VALID [2022-04-28 03:44:22,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {14212#false} ~cond := #in~cond; {14212#false} is VALID [2022-04-28 03:44:22,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {14212#false} assume 0 == ~cond; {14212#false} is VALID [2022-04-28 03:44:22,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {14212#false} assume !false; {14212#false} is VALID [2022-04-28 03:44:22,395 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-28 03:44:22,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:22,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649930246] [2022-04-28 03:44:22,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649930246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:22,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106949146] [2022-04-28 03:44:22,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:22,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:22,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:22,404 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-28 03:44:22,405 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-28 03:44:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:22,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:44:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:22,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:22,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {14211#true} call ULTIMATE.init(); {14211#true} is VALID [2022-04-28 03:44:22,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {14211#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); {14211#true} is VALID [2022-04-28 03:44:22,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-28 03:44:22,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-28 03:44:22,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {14211#true} call #t~ret15 := main(); {14211#true} is VALID [2022-04-28 03:44:22,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {14211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14211#true} is VALID [2022-04-28 03:44:22,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {14211#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_334 v_main_~y~0_333)) (.cse1 (= v_main_~x~0_267 v_main_~x~0_266)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (mod v_main_~x~0_267 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (= v_main_~x~0_266 (+ v_main_~x~0_267 v_main_~y~0_334 (* (- 1) v_main_~y~0_333))) (< v_main_~y~0_334 v_main_~y~0_333) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_267 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~y~0_334 v_it_23 1) v_main_~y~0_333))))))) InVars {main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_267, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_266, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14211#true} is VALID [2022-04-28 03:44:22,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {14211#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14211#true} is VALID [2022-04-28 03:44:22,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {14211#true} ~z~0 := ~y~0; {14253#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:22,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {14253#(= 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; {14257#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:22,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {14257#(= 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; {14261#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:22,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {14261#(= (+ 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; {14265#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:22,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {14265#(= (+ 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; {14269#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:44:22,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {14269#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {14269#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:44:22,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {14269#(= (+ main_~y~0 (- 3)) (+ 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; {14261#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:22,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {14261#(= (+ main_~z~0 1) (+ (- 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; {14216#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:22,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {14216#(<= 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; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:22,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {14282#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:22,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:22,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14212#false} is VALID [2022-04-28 03:44:22,796 INFO L272 TraceCheckUtils]: 26: Hoare triple {14212#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14212#false} is VALID [2022-04-28 03:44:22,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {14212#false} ~cond := #in~cond; {14212#false} is VALID [2022-04-28 03:44:22,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {14212#false} assume 0 == ~cond; {14212#false} is VALID [2022-04-28 03:44:22,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {14212#false} assume !false; {14212#false} is VALID [2022-04-28 03:44:22,797 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-28 03:44:22,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:23,241 INFO L290 TraceCheckUtils]: 29: Hoare triple {14212#false} assume !false; {14212#false} is VALID [2022-04-28 03:44:23,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {14212#false} assume 0 == ~cond; {14212#false} is VALID [2022-04-28 03:44:23,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {14212#false} ~cond := #in~cond; {14212#false} is VALID [2022-04-28 03:44:23,241 INFO L272 TraceCheckUtils]: 26: Hoare triple {14212#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {14212#false} is VALID [2022-04-28 03:44:23,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14212#false} is VALID [2022-04-28 03:44:23,243 INFO L290 TraceCheckUtils]: 24: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:23,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,244 INFO L290 TraceCheckUtils]: 22: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,244 INFO L290 TraceCheckUtils]: 21: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {14286#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {14282#(<= 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; {14286#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:44:23,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {14216#(<= 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; {14282#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:23,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {14365#(or (not (< 0 (mod main_~y~0 4294967296))) (<= 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; {14216#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:23,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 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; {14365#(or (not (< 0 (mod main_~y~0 4294967296))) (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-28 03:44:23,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:23,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {14376#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)) (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; {14369#(or (<= main_~z~0 (+ 4294967292 (* (div (+ main_~z~0 2) 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:23,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {14380#(or (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 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; {14376#(or (<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:23,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {14384#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 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; {14380#(or (<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:23,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {14388#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {14384#(or (<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)))) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:23,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {14211#true} ~z~0 := ~y~0; {14388#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:44:23,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {14211#true} [130] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14211#true} is VALID [2022-04-28 03:44:23,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {14211#true} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_334 v_main_~y~0_333)) (.cse1 (= v_main_~x~0_267 v_main_~x~0_266)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (mod v_main_~x~0_267 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (= v_main_~x~0_266 (+ v_main_~x~0_267 v_main_~y~0_334 (* (- 1) v_main_~y~0_333))) (< v_main_~y~0_334 v_main_~y~0_333) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_267 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~y~0_334 v_it_23 1) v_main_~y~0_333))))))) InVars {main_~y~0=v_main_~y~0_334, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_267, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_266, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14211#true} is VALID [2022-04-28 03:44:23,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {14211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14211#true} is VALID [2022-04-28 03:44:23,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {14211#true} call #t~ret15 := main(); {14211#true} is VALID [2022-04-28 03:44:23,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14211#true} {14211#true} #83#return; {14211#true} is VALID [2022-04-28 03:44:23,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {14211#true} assume true; {14211#true} is VALID [2022-04-28 03:44:23,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {14211#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); {14211#true} is VALID [2022-04-28 03:44:23,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {14211#true} call ULTIMATE.init(); {14211#true} is VALID [2022-04-28 03:44:23,257 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-28 03:44:23,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106949146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:23,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:23,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 11] total 25 [2022-04-28 03:44:23,465 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:23,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1795968144] [2022-04-28 03:44:23,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1795968144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:23,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:23,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:44:23,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544346558] [2022-04-28 03:44:23,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:23,466 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:23,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:23,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:23,509 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-28 03:44:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:44:23,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:23,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:44:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:44:23,510 INFO L87 Difference]: Start difference. First operand 109 states and 155 transitions. Second operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:27,334 INFO L93 Difference]: Finished difference Result 165 states and 228 transitions. [2022-04-28 03:44:27,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:44:27,334 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2022-04-28 03:44:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 82 transitions. [2022-04-28 03:44:27,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 82 transitions. [2022-04-28 03:44:27,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:27,541 INFO L225 Difference]: With dead ends: 165 [2022-04-28 03:44:27,541 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 03:44:27,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=520, Invalid=2450, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:44:27,542 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:27,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 58 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:44:27,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 03:44:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 119. [2022-04-28 03:44:28,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:28,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,353 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,353 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:28,355 INFO L93 Difference]: Finished difference Result 160 states and 218 transitions. [2022-04-28 03:44:28,355 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-04-28 03:44:28,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:28,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:28,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 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 160 states. [2022-04-28 03:44:28,356 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 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 160 states. [2022-04-28 03:44:28,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:28,358 INFO L93 Difference]: Finished difference Result 160 states and 218 transitions. [2022-04-28 03:44:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 218 transitions. [2022-04-28 03:44:28,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:28,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:28,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:28,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.4210526315789473) internal successors, (162), 114 states have internal predecessors, (162), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:28,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2022-04-28 03:44:28,360 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 33 [2022-04-28 03:44:28,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:28,360 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2022-04-28 03:44:28,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.625) internal successors, (26), 15 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-28 03:44:28,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 166 transitions. [2022-04-28 03:44:35,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 164 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2022-04-28 03:44:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:44:35,635 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:35,635 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:35,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:44:35,836 WARN L477 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-28 03:44:35,836 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:35,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1926224206, now seen corresponding path program 12 times [2022-04-28 03:44:35,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486587831] [2022-04-28 03:44:37,953 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:38,040 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-28 03:44:38,041 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:38,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2116035962, now seen corresponding path program 1 times [2022-04-28 03:44:38,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:38,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292627084] [2022-04-28 03:44:38,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:38,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:38,052 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-28 03:44:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:38,063 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-28 03:44:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:38,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {15376#(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); {15363#true} is VALID [2022-04-28 03:44:38,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-28 03:44:38,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-28 03:44:38,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {15363#true} call ULTIMATE.init(); {15376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:38,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {15376#(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); {15363#true} is VALID [2022-04-28 03:44:38,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-28 03:44:38,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-28 03:44:38,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {15363#true} call #t~ret15 := main(); {15363#true} is VALID [2022-04-28 03:44:38,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {15363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15363#true} is VALID [2022-04-28 03:44:38,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {15363#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse1 (= |v_main_#t~post6_114| |v_main_#t~post6_113|)) (.cse2 (= v_main_~y~0_354 v_main_~y~0_353)) (.cse3 (= v_main_~x~0_285 v_main_~x~0_284)) (.cse4 (mod v_main_~x~0_285 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_354 v_main_~y~0_353) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_285 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~y~0_354 v_it_24 1) v_main_~y~0_353)) (not (<= 1 v_it_24)))) (= v_main_~x~0_284 (+ v_main_~x~0_285 v_main_~y~0_354 (* (- 1) v_main_~y~0_353))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_353, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_284, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15363#true} is VALID [2022-04-28 03:44:38,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:38,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {15368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {15368#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:38,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {15368#(<= 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; {15369#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:38,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {15369#(<= 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; {15370#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {15370#(<= 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; {15371#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {15371#(<= 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; {15372#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {15372#(<= 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; {15373#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:44:38,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {15373#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {15374#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {15374#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(<= 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; {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15374#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:38,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {15374#(<= 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; {15375#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {15375#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {15364#false} assume !(~z~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L272 TraceCheckUtils]: 26: Hoare triple {15364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 27: Hoare triple {15364#false} ~cond := #in~cond; {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 28: Hoare triple {15364#false} assume 0 == ~cond; {15364#false} is VALID [2022-04-28 03:44:38,211 INFO L290 TraceCheckUtils]: 29: Hoare triple {15364#false} assume !false; {15364#false} is VALID [2022-04-28 03:44:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:44:38,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:38,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292627084] [2022-04-28 03:44:38,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292627084] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:38,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076422788] [2022-04-28 03:44:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:38,213 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-28 03:44:38,214 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-28 03:44:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:38,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:44:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:38,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:38,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {15363#true} call ULTIMATE.init(); {15363#true} is VALID [2022-04-28 03:44:38,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {15363#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); {15363#true} is VALID [2022-04-28 03:44:38,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-28 03:44:38,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-28 03:44:38,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {15363#true} call #t~ret15 := main(); {15363#true} is VALID [2022-04-28 03:44:38,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {15363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15363#true} is VALID [2022-04-28 03:44:38,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {15363#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse1 (= |v_main_#t~post6_114| |v_main_#t~post6_113|)) (.cse2 (= v_main_~y~0_354 v_main_~y~0_353)) (.cse3 (= v_main_~x~0_285 v_main_~x~0_284)) (.cse4 (mod v_main_~x~0_285 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_354 v_main_~y~0_353) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_285 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~y~0_354 v_it_24 1) v_main_~y~0_353)) (not (<= 1 v_it_24)))) (= v_main_~x~0_284 (+ v_main_~x~0_285 v_main_~y~0_354 (* (- 1) v_main_~y~0_353))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_353, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_284, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15363#true} is VALID [2022-04-28 03:44:38,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15363#true} is VALID [2022-04-28 03:44:38,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {15363#true} ~z~0 := ~y~0; {15404#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:38,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {15404#(= 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; {15408#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:38,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {15408#(= 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; {15412#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:38,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {15412#(= (+ 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; {15416#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:38,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {15416#(= (+ 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; {15420#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:38,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {15420#(= (+ 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; {15424#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:44:38,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {15424#(= (+ 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; {15428#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:44:38,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {15428#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {15428#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:44:38,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {15428#(= (+ 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; {15420#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:38,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {15420#(= (+ main_~z~0 3) (+ (- 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; {15412#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:44:38,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {15412#(= (+ main_~z~0 1) (+ (- 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; {15404#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:38,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {15404#(= main_~z~0 main_~y~0)} assume !(~y~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:38,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {15444#(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; {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {15364#false} assume !(~z~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-28 03:44:38,519 INFO L272 TraceCheckUtils]: 26: Hoare triple {15364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15364#false} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {15364#false} ~cond := #in~cond; {15364#false} is VALID [2022-04-28 03:44:38,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {15364#false} assume 0 == ~cond; {15364#false} is VALID [2022-04-28 03:44:38,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {15364#false} assume !false; {15364#false} is VALID [2022-04-28 03:44:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:44:38,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {15364#false} assume !false; {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {15364#false} assume 0 == ~cond; {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {15364#false} ~cond := #in~cond; {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L272 TraceCheckUtils]: 26: Hoare triple {15364#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {15364#false} assume !(~z~0 % 4294967296 > 0); {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {15364#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:39,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15364#false} is VALID [2022-04-28 03:44:39,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {15444#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:39,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {15444#(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; {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:39,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {15505#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {15444#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:44:39,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {15509#(or (not (< 0 (mod (+ main_~z~0 1) 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; {15505#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:44:39,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {15513#(or (not (< 0 (mod (+ main_~z~0 2) 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; {15509#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:39,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {15517#(or (not (< 0 (mod (+ main_~z~0 3) 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; {15513#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:44:39,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {15517#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15517#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {15524#(or (not (< 0 (mod (+ main_~z~0 2) 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; {15517#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {15528#(or (not (< 0 (mod (+ main_~z~0 1) 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; {15524#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {15532#(or (not (< 0 (mod main_~z~0 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; {15528#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {15536#(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; {15532#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {15540#(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; {15536#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {15544#(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; {15540#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {15363#true} ~z~0 := ~y~0; {15544#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:44:39,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#true} [132] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {15363#true} is VALID [2022-04-28 03:44:39,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {15363#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_114| |v_main_#t~post5_113|)) (.cse1 (= |v_main_#t~post6_114| |v_main_#t~post6_113|)) (.cse2 (= v_main_~y~0_354 v_main_~y~0_353)) (.cse3 (= v_main_~x~0_285 v_main_~x~0_284)) (.cse4 (mod v_main_~x~0_285 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_354 v_main_~y~0_353) (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_285 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~y~0_354 v_it_24 1) v_main_~y~0_353)) (not (<= 1 v_it_24)))) (= v_main_~x~0_284 (+ v_main_~x~0_285 v_main_~y~0_354 (* (- 1) v_main_~y~0_353))) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_354, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_285, main_#t~post6=|v_main_#t~post6_114|} OutVars{main_~y~0=v_main_~y~0_353, main_#t~post5=|v_main_#t~post5_113|, main_~x~0=v_main_~x~0_284, main_#t~post6=|v_main_#t~post6_113|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L290 TraceCheckUtils]: 5: Hoare triple {15363#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {15363#true} call #t~ret15 := main(); {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15363#true} {15363#true} #83#return; {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {15363#true} assume true; {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {15363#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); {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {15363#true} call ULTIMATE.init(); {15363#true} is VALID [2022-04-28 03:44:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:44:39,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076422788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:39,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:39,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 29 [2022-04-28 03:44:39,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:39,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486587831] [2022-04-28 03:44:39,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486587831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:39,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:39,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:44:39,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753834398] [2022-04-28 03:44:39,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:39,294 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:44:39,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:39,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:39,321 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-28 03:44:39,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:44:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:39,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:44:39,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:44:39,322 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:42,915 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2022-04-28 03:44:42,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:44:42,916 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:44:42,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2022-04-28 03:44:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:42,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 96 transitions. [2022-04-28 03:44:42,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 96 transitions. [2022-04-28 03:44:43,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:43,054 INFO L225 Difference]: With dead ends: 249 [2022-04-28 03:44:43,054 INFO L226 Difference]: Without dead ends: 226 [2022-04-28 03:44:43,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=285, Invalid=2067, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:44:43,055 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 119 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:43,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 40 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:44:43,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-28 03:44:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 132. [2022-04-28 03:44:44,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:44,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:44,000 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:44,000 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:44,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:44,003 INFO L93 Difference]: Finished difference Result 226 states and 320 transitions. [2022-04-28 03:44:44,003 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2022-04-28 03:44:44,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:44,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:44,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 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 226 states. [2022-04-28 03:44:44,004 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 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 226 states. [2022-04-28 03:44:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:44,006 INFO L93 Difference]: Finished difference Result 226 states and 320 transitions. [2022-04-28 03:44:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 320 transitions. [2022-04-28 03:44:44,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:44,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:44,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:44,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 127 states have internal predecessors, (181), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:44,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 185 transitions. [2022-04-28 03:44:44,009 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 185 transitions. Word has length 33 [2022-04-28 03:44:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:44,009 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 185 transitions. [2022-04-28 03:44:44,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:44,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 185 transitions. [2022-04-28 03:44:49,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 184 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:49,656 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 185 transitions. [2022-04-28 03:44:49,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:44:49,657 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:49,657 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:49,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-28 03:44:49,857 WARN L477 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-28 03:44:49,857 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:49,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1099403902, now seen corresponding path program 13 times [2022-04-28 03:44:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:49,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [207243590] [2022-04-28 03:44:50,236 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-28 03:44:50,237 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:50,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1612901358, now seen corresponding path program 1 times [2022-04-28 03:44:50,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:50,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964267537] [2022-04-28 03:44:50,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:50,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:50,248 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-28 03:44:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,271 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-28 03:44:50,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {16837#(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); {16824#true} is VALID [2022-04-28 03:44:50,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:44:50,410 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-28 03:44:50,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:50,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {16837#(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); {16824#true} is VALID [2022-04-28 03:44:50,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:44:50,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-28 03:44:50,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret15 := main(); {16824#true} is VALID [2022-04-28 03:44:50,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16824#true} is VALID [2022-04-28 03:44:50,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {16824#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_302 4294967296)) (.cse1 (= v_main_~y~0_374 v_main_~y~0_373)) (.cse2 (= v_main_~x~0_302 v_main_~x~0_301)) (.cse3 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and (< v_main_~x~0_301 v_main_~x~0_302) (< 0 .cse0) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_302 (* 4294967295 v_it_25)) 4294967296)) (not (<= 1 v_it_25)) (not (<= (+ v_main_~x~0_301 v_it_25 1) v_main_~x~0_302)))) (= v_main_~y~0_373 (+ v_main_~x~0_302 v_main_~y~0_374 (* v_main_~x~0_301 (- 1))))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_119| |v_main_#t~post6_118|)) (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) (<= .cse0 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_374, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_373, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_301, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16824#true} is VALID [2022-04-28 03:44:50,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {16824#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16824#true} is VALID [2022-04-28 03:44:50,411 INFO L290 TraceCheckUtils]: 8: Hoare triple {16824#true} ~z~0 := ~y~0; {16829#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:44:50,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {16829#(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; {16830#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:50,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {16830#(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; {16831#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:50,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {16831#(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; {16832#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:50,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(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; {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:50,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:50,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {16833#(<= 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; {16834#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:50,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {16834#(<= 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; {16835#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {16835#(<= 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; {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,418 INFO L290 TraceCheckUtils]: 22: Hoare triple {16825#false} assume !(~x~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {16825#false} assume !(~z~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L272 TraceCheckUtils]: 27: Hoare triple {16825#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-28 03:44:50,419 INFO L290 TraceCheckUtils]: 30: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-28 03:44:50,419 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-28 03:44:50,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:50,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964267537] [2022-04-28 03:44:50,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964267537] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:50,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133843847] [2022-04-28 03:44:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:50,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:50,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:50,421 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-28 03:44:50,422 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-28 03:44:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 03:44:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:50,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#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); {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret15 := main(); {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {16824#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_302 4294967296)) (.cse1 (= v_main_~y~0_374 v_main_~y~0_373)) (.cse2 (= v_main_~x~0_302 v_main_~x~0_301)) (.cse3 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and (< v_main_~x~0_301 v_main_~x~0_302) (< 0 .cse0) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_302 (* 4294967295 v_it_25)) 4294967296)) (not (<= 1 v_it_25)) (not (<= (+ v_main_~x~0_301 v_it_25 1) v_main_~x~0_302)))) (= v_main_~y~0_373 (+ v_main_~x~0_302 v_main_~y~0_374 (* v_main_~x~0_301 (- 1))))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_119| |v_main_#t~post6_118|)) (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) (<= .cse0 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_374, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_373, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_301, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16824#true} is VALID [2022-04-28 03:44:50,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {16824#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16824#true} is VALID [2022-04-28 03:44:50,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {16824#true} ~z~0 := ~y~0; {16829#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:44:50,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {16829#(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; {16830#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:50,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {16830#(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; {16831#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:50,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {16831#(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; {16832#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:44:50,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {16832#(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; {16877#(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-28 03:44:50,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {16877#(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); {16877#(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-28 03:44:50,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {16877#(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; {16884#(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-28 03:44:50,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {16884#(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; {16888#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:50,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {16888#(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; {16892#(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-28 03:44:50,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {16892#(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); {16825#false} is VALID [2022-04-28 03:44:50,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {16825#false} assume !(~x~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {16825#false} assume !(~z~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L272 TraceCheckUtils]: 27: Hoare triple {16825#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-28 03:44:50,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-28 03:44:50,789 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-28 03:44:50,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:51,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-28 03:44:51,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-28 03:44:51,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-28 03:44:51,181 INFO L272 TraceCheckUtils]: 27: Hoare triple {16825#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {16825#false} is VALID [2022-04-28 03:44:51,181 INFO L290 TraceCheckUtils]: 26: Hoare triple {16825#false} assume !(~z~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 24: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {16825#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {16825#false} assume !(~x~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:51,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {16825#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; {16825#false} is VALID [2022-04-28 03:44:51,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {16825#false} is VALID [2022-04-28 03:44:51,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {16835#(<= 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; {16836#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:51,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {16834#(<= 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; {16835#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:51,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {16833#(<= 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; {16834#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:44:51,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:51,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {16989#(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; {16833#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:44:51,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {16993#(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; {16989#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:44:51,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {16997#(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; {16993#(or (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:44:51,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {17001#(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; {16997#(or (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:44:51,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {16824#true} ~z~0 := ~y~0; {17001#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:44:51,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {16824#true} [134] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {16824#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_302 4294967296)) (.cse1 (= v_main_~y~0_374 v_main_~y~0_373)) (.cse2 (= v_main_~x~0_302 v_main_~x~0_301)) (.cse3 (= |v_main_#t~post5_119| |v_main_#t~post5_118|))) (or (and (< v_main_~x~0_301 v_main_~x~0_302) (< 0 .cse0) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_302 (* 4294967295 v_it_25)) 4294967296)) (not (<= 1 v_it_25)) (not (<= (+ v_main_~x~0_301 v_it_25 1) v_main_~x~0_302)))) (= v_main_~y~0_373 (+ v_main_~x~0_302 v_main_~y~0_374 (* v_main_~x~0_301 (- 1))))) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_119| |v_main_#t~post6_118|)) (and (= |v_main_#t~post6_118| |v_main_#t~post6_119|) (<= .cse0 0) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_374, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_302, main_#t~post6=|v_main_#t~post6_119|} OutVars{main_~y~0=v_main_~y~0_373, main_#t~post5=|v_main_#t~post5_118|, main_~x~0=v_main_~x~0_301, main_#t~post6=|v_main_#t~post6_118|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret15 := main(); {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #83#return; {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#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); {16824#true} is VALID [2022-04-28 03:44:51,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-28 03:44:51,191 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-28 03:44:51,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133843847] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:51,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:51,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 03:44:51,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:51,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [207243590] [2022-04-28 03:44:51,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [207243590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:51,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:51,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:44:51,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059708782] [2022-04-28 03:44:51,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:51,361 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:44:51,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:51,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:51,387 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-28 03:44:51,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:44:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:51,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:44:51,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:44:51,388 INFO L87 Difference]: Start difference. First operand 132 states and 185 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:56,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:56,331 INFO L93 Difference]: Finished difference Result 190 states and 252 transitions. [2022-04-28 03:44:56,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:44:56,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:44:56,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:56,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:56,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 71 transitions. [2022-04-28 03:44:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 71 transitions. [2022-04-28 03:44:56,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 71 transitions. [2022-04-28 03:44:56,497 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-28 03:44:56,499 INFO L225 Difference]: With dead ends: 190 [2022-04-28 03:44:56,499 INFO L226 Difference]: Without dead ends: 168 [2022-04-28 03:44:56,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=328, Invalid=1652, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:44:56,500 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 54 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:56,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 77 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:44:56,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-28 03:44:57,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2022-04-28 03:44:57,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:57,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:57,300 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:57,300 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:57,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:57,301 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2022-04-28 03:44:57,301 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2022-04-28 03:44:57,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:57,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:57,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 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 168 states. [2022-04-28 03:44:57,302 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 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 168 states. [2022-04-28 03:44:57,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:57,304 INFO L93 Difference]: Finished difference Result 168 states and 222 transitions. [2022-04-28 03:44:57,304 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2022-04-28 03:44:57,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:57,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:57,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:57,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:57,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:57,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 159 transitions. [2022-04-28 03:44:57,306 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 159 transitions. Word has length 34 [2022-04-28 03:44:57,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:57,306 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 159 transitions. [2022-04-28 03:44:57,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:57,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 159 transitions. [2022-04-28 03:45:04,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 158 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 159 transitions. [2022-04-28 03:45:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:45:04,314 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:04,314 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:04,334 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-28 03:45:04,527 WARN L477 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-28 03:45:04,527 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:04,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:04,528 INFO L85 PathProgramCache]: Analyzing trace with hash -524795518, now seen corresponding path program 14 times [2022-04-28 03:45:04,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:04,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1695622083] [2022-04-28 03:45:04,788 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-28 03:45:04,791 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2100922450, now seen corresponding path program 1 times [2022-04-28 03:45:04,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:04,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819473351] [2022-04-28 03:45:04,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:04,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:04,802 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-28 03:45:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:04,818 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-28 03:45:04,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:04,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {18041#(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); {18027#true} is VALID [2022-04-28 03:45:04,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-28 03:45:04,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-28 03:45:04,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18041#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:04,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {18041#(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); {18027#true} is VALID [2022-04-28 03:45:04,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-28 03:45:04,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-28 03:45:04,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret15 := main(); {18027#true} is VALID [2022-04-28 03:45:04,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {18027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18027#true} is VALID [2022-04-28 03:45:04,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {18027#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse1 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (mod v_main_~x~0_320 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) (= v_main_~x~0_319 v_main_~x~0_320) .cse3) (and (= v_main_~x~0_320 v_main_~x~0_319) .cse0 .cse1 .cse3) (and (< v_main_~x~0_319 v_main_~x~0_320) (= v_main_~y~0_396 (+ v_main_~x~0_320 (* v_main_~x~0_319 (- 1)) v_main_~y~0_397)) (< 0 .cse2) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (< 0 (mod (+ v_main_~x~0_320 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_319 v_it_26 1) v_main_~x~0_320))))))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_320, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_319, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18027#true} is VALID [2022-04-28 03:45:04,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {18027#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18027#true} is VALID [2022-04-28 03:45:04,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {18027#true} ~z~0 := ~y~0; {18027#true} is VALID [2022-04-28 03:45:04,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {18027#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; {18032#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:04,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {18032#(<= 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; {18033#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:45:04,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {18033#(<= 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; {18034#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:04,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {18034#(<= 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; {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:04,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {18035#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:04,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {18035#(<= 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; {18036#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:45:04,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {18036#(<= 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; {18037#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:45:04,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {18037#(<= 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; {18038#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:04,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {18038#(<= 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; {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:45:04,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:45:05,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {18040#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:45:05,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {18039#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~z~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,003 INFO L272 TraceCheckUtils]: 27: Hoare triple {18028#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18028#false} is VALID [2022-04-28 03:45:05,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2022-04-28 03:45:05,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2022-04-28 03:45:05,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2022-04-28 03:45:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:45:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819473351] [2022-04-28 03:45:05,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819473351] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214148418] [2022-04-28 03:45:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:05,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:05,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:05,005 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-28 03:45:05,006 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-28 03:45:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:05,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:45:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:05,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:05,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18027#true} is VALID [2022-04-28 03:45:05,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {18027#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); {18027#true} is VALID [2022-04-28 03:45:05,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-28 03:45:05,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-28 03:45:05,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret15 := main(); {18027#true} is VALID [2022-04-28 03:45:05,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {18027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18027#true} is VALID [2022-04-28 03:45:05,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {18027#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse1 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (mod v_main_~x~0_320 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) (= v_main_~x~0_319 v_main_~x~0_320) .cse3) (and (= v_main_~x~0_320 v_main_~x~0_319) .cse0 .cse1 .cse3) (and (< v_main_~x~0_319 v_main_~x~0_320) (= v_main_~y~0_396 (+ v_main_~x~0_320 (* v_main_~x~0_319 (- 1)) v_main_~y~0_397)) (< 0 .cse2) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (< 0 (mod (+ v_main_~x~0_320 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_319 v_it_26 1) v_main_~x~0_320))))))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_320, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_319, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18027#true} is VALID [2022-04-28 03:45:05,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {18027#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18027#true} is VALID [2022-04-28 03:45:05,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {18027#true} ~z~0 := ~y~0; {18069#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:05,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {18069#(= 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; {18073#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:05,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {18073#(= 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; {18077#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:45:05,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {18077#(= 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; {18081#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:05,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {18081#(= (+ (- 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; {18085#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:45:05,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {18085#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {18089#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:05,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {18089#(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; {18093#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:05,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {18093#(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; {18097#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:05,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {18097#(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; {18101#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {18101#(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; {18105#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {18105#(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; {18028#false} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {18028#false} assume !(~y~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 20: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,295 INFO L290 TraceCheckUtils]: 24: Hoare triple {18028#false} assume !(~x~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {18028#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18028#false} is VALID [2022-04-28 03:45:05,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {18028#false} assume !(~z~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,296 INFO L272 TraceCheckUtils]: 27: Hoare triple {18028#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18028#false} is VALID [2022-04-28 03:45:05,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2022-04-28 03:45:05,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2022-04-28 03:45:05,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2022-04-28 03:45:05,296 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-28 03:45:05,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {18028#false} assume !false; {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 29: Hoare triple {18028#false} assume 0 == ~cond; {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {18028#false} ~cond := #in~cond; {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L272 TraceCheckUtils]: 27: Hoare triple {18028#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {18028#false} assume !(~z~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {18028#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {18028#false} assume !(~x~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {18028#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; {18028#false} is VALID [2022-04-28 03:45:05,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {18028#false} assume !(~y~0 % 4294967296 > 0); {18028#false} is VALID [2022-04-28 03:45:05,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {18105#(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; {18028#false} is VALID [2022-04-28 03:45:05,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {18101#(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; {18105#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:05,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {18097#(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; {18101#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:05,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {18093#(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; {18097#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:05,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {18089#(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; {18093#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:05,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {18196#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {18089#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:05,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {18200#(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; {18196#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:05,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {18204#(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; {18200#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:05,600 INFO L290 TraceCheckUtils]: 10: Hoare triple {18208#(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; {18204#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:05,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {18212#(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; {18208#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:05,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {18027#true} ~z~0 := ~y~0; {18212#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:05,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {18027#true} [136] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {18027#true} is VALID [2022-04-28 03:45:05,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {18027#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_124| |v_main_#t~post6_123|)) (.cse1 (= |v_main_#t~post5_124| |v_main_#t~post5_123|)) (.cse3 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (mod v_main_~x~0_320 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) (= v_main_~x~0_319 v_main_~x~0_320) .cse3) (and (= v_main_~x~0_320 v_main_~x~0_319) .cse0 .cse1 .cse3) (and (< v_main_~x~0_319 v_main_~x~0_320) (= v_main_~y~0_396 (+ v_main_~x~0_320 (* v_main_~x~0_319 (- 1)) v_main_~y~0_397)) (< 0 .cse2) (forall ((v_it_26 Int)) (or (not (<= 1 v_it_26)) (< 0 (mod (+ v_main_~x~0_320 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_319 v_it_26 1) v_main_~x~0_320))))))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_320, main_#t~post6=|v_main_#t~post6_124|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_319, main_#t~post6=|v_main_#t~post6_123|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18027#true} is VALID [2022-04-28 03:45:05,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {18027#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18027#true} is VALID [2022-04-28 03:45:05,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {18027#true} call #t~ret15 := main(); {18027#true} is VALID [2022-04-28 03:45:05,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18027#true} {18027#true} #83#return; {18027#true} is VALID [2022-04-28 03:45:05,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {18027#true} assume true; {18027#true} is VALID [2022-04-28 03:45:05,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {18027#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); {18027#true} is VALID [2022-04-28 03:45:05,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {18027#true} call ULTIMATE.init(); {18027#true} is VALID [2022-04-28 03:45:05,603 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-28 03:45:05,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214148418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:05,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:05,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-04-28 03:45:05,812 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:05,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1695622083] [2022-04-28 03:45:05,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1695622083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:05,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:45:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517528313] [2022-04-28 03:45:05,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:05,813 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-28 03:45:05,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:05,813 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-28 03:45:05,845 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-28 03:45:05,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:45:05,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:05,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:45:05,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:45:05,847 INFO L87 Difference]: Start difference. First operand 115 states and 159 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-28 03:45:11,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:11,454 INFO L93 Difference]: Finished difference Result 195 states and 261 transitions. [2022-04-28 03:45:11,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:45:11,454 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-28 03:45:11,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:11,454 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-28 03:45:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2022-04-28 03:45:11,455 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-28 03:45:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 90 transitions. [2022-04-28 03:45:11,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 90 transitions. [2022-04-28 03:45:11,646 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-28 03:45:11,647 INFO L225 Difference]: With dead ends: 195 [2022-04-28 03:45:11,648 INFO L226 Difference]: Without dead ends: 190 [2022-04-28 03:45:11,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=616, Invalid=3544, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:45:11,649 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 50 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:11,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:45:11,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-28 03:45:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 125. [2022-04-28 03:45:12,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:12,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:12,558 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:12,559 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:12,560 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2022-04-28 03:45:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-28 03:45:12,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:12,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:12,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 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 190 states. [2022-04-28 03:45:12,561 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 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 190 states. [2022-04-28 03:45:12,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:12,563 INFO L93 Difference]: Finished difference Result 190 states and 250 transitions. [2022-04-28 03:45:12,563 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 250 transitions. [2022-04-28 03:45:12,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:12,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:12,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:12,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.3833333333333333) internal successors, (166), 120 states have internal predecessors, (166), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 170 transitions. [2022-04-28 03:45:12,565 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 170 transitions. Word has length 34 [2022-04-28 03:45:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:12,565 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 170 transitions. [2022-04-28 03:45:12,565 INFO L496 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-28 03:45:12,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 170 transitions. [2022-04-28 03:45:20,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 168 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:20,743 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 170 transitions. [2022-04-28 03:45:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:45:20,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:20,751 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:20,768 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-28 03:45:20,959 WARN L477 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-28 03:45:20,959 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:20,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:20,960 INFO L85 PathProgramCache]: Analyzing trace with hash -781170719, now seen corresponding path program 15 times [2022-04-28 03:45:20,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:20,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [351107618] [2022-04-28 03:45:21,134 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-28 03:45:21,136 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:21,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2101090165, now seen corresponding path program 1 times [2022-04-28 03:45:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:21,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186792340] [2022-04-28 03:45:21,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:21,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:21,148 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-28 03:45:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:21,163 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-28 03:45:21,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:21,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {19348#(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); {19335#true} is VALID [2022-04-28 03:45:21,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-28 03:45:21,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {19335#true} call ULTIMATE.init(); {19348#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {19348#(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); {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {19335#true} call #t~ret15 := main(); {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {19335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {19335#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_421 v_main_~y~0_420)) (.cse3 (= v_main_~x~0_338 v_main_~x~0_337)) (.cse4 (mod v_main_~x~0_338 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_420 (+ v_main_~x~0_338 (* v_main_~x~0_337 (- 1)) v_main_~y~0_421)) (< v_main_~x~0_337 v_main_~x~0_338) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_338 (* 4294967295 v_it_27)) 4294967296)) (not (<= (+ v_main_~x~0_337 v_it_27 1) v_main_~x~0_338))))))) InVars {main_~y~0=v_main_~y~0_421, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_338, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {19335#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {19335#true} ~z~0 := ~y~0; {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {19335#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; {19335#true} is VALID [2022-04-28 03:45:21,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {19335#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; {19335#true} is VALID [2022-04-28 03:45:21,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {19335#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; {19335#true} is VALID [2022-04-28 03:45:21,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {19335#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; {19335#true} is VALID [2022-04-28 03:45:21,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {19335#true} assume !(~z~0 % 4294967296 > 0); {19340#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:21,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {19340#(<= 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; {19341#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:45:21,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {19341#(<= 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; {19342#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:45:21,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {19342#(<= 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; {19343#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {19343#(<= 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; {19344#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:45:21,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {19344#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {19345#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 5))} is VALID [2022-04-28 03:45:21,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {19345#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (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; {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:21,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {19346#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19347#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:45:21,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {19347#(<= (+ 5 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,303 INFO L272 TraceCheckUtils]: 28: Hoare triple {19336#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19336#false} is VALID [2022-04-28 03:45:21,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {19336#false} ~cond := #in~cond; {19336#false} is VALID [2022-04-28 03:45:21,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {19336#false} assume 0 == ~cond; {19336#false} is VALID [2022-04-28 03:45:21,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {19336#false} assume !false; {19336#false} is VALID [2022-04-28 03:45:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 03:45:21,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:21,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186792340] [2022-04-28 03:45:21,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186792340] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:21,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168437745] [2022-04-28 03:45:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:21,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:21,305 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-28 03:45:21,306 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-28 03:45:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:21,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:45:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:21,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:21,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {19335#true} call ULTIMATE.init(); {19335#true} is VALID [2022-04-28 03:45:21,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {19335#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); {19335#true} is VALID [2022-04-28 03:45:21,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-28 03:45:21,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-28 03:45:21,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {19335#true} call #t~ret15 := main(); {19335#true} is VALID [2022-04-28 03:45:21,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {19335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19335#true} is VALID [2022-04-28 03:45:21,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {19335#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_421 v_main_~y~0_420)) (.cse3 (= v_main_~x~0_338 v_main_~x~0_337)) (.cse4 (mod v_main_~x~0_338 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_420 (+ v_main_~x~0_338 (* v_main_~x~0_337 (- 1)) v_main_~y~0_421)) (< v_main_~x~0_337 v_main_~x~0_338) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_338 (* 4294967295 v_it_27)) 4294967296)) (not (<= (+ v_main_~x~0_337 v_it_27 1) v_main_~x~0_338))))))) InVars {main_~y~0=v_main_~y~0_421, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_338, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19335#true} is VALID [2022-04-28 03:45:21,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {19335#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19335#true} is VALID [2022-04-28 03:45:21,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {19335#true} ~z~0 := ~y~0; {19376#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:21,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {19376#(= 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; {19380#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:21,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {19380#(= 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; {19384#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:45:21,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {19384#(= 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; {19388#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:21,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {19388#(= (+ (- 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; {19392#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:45:21,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {19392#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {19396#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:21,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {19396#(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; {19400#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:21,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {19400#(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; {19404#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:21,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {19404#(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; {19408#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:21,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {19408#(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; {19412#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {19412#(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; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {19336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {19336#false} assume !(~y~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {19336#false} assume !(~x~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {19336#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L290 TraceCheckUtils]: 27: Hoare triple {19336#false} assume !(~z~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,618 INFO L272 TraceCheckUtils]: 28: Hoare triple {19336#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19336#false} is VALID [2022-04-28 03:45:21,619 INFO L290 TraceCheckUtils]: 29: Hoare triple {19336#false} ~cond := #in~cond; {19336#false} is VALID [2022-04-28 03:45:21,619 INFO L290 TraceCheckUtils]: 30: Hoare triple {19336#false} assume 0 == ~cond; {19336#false} is VALID [2022-04-28 03:45:21,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {19336#false} assume !false; {19336#false} is VALID [2022-04-28 03:45:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:45:21,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {19336#false} assume !false; {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {19336#false} assume 0 == ~cond; {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {19336#false} ~cond := #in~cond; {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L272 TraceCheckUtils]: 28: Hoare triple {19336#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 27: Hoare triple {19336#false} assume !(~z~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 26: Hoare triple {19336#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {19336#false} assume !(~x~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,942 INFO L290 TraceCheckUtils]: 24: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,943 INFO L290 TraceCheckUtils]: 22: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,943 INFO L290 TraceCheckUtils]: 21: Hoare triple {19336#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; {19336#false} is VALID [2022-04-28 03:45:21,943 INFO L290 TraceCheckUtils]: 20: Hoare triple {19336#false} assume !(~y~0 % 4294967296 > 0); {19336#false} is VALID [2022-04-28 03:45:21,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {19336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19336#false} is VALID [2022-04-28 03:45:21,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {19412#(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; {19336#false} is VALID [2022-04-28 03:45:21,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {19408#(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; {19412#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:21,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {19404#(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; {19408#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:21,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {19400#(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; {19404#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:21,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {19396#(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; {19400#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:21,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {19509#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19396#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:21,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {19513#(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; {19509#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:21,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {19517#(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; {19513#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:21,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {19521#(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; {19517#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:21,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {19525#(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; {19521#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:21,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {19335#true} ~z~0 := ~y~0; {19525#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:45:21,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {19335#true} [138] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {19335#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_129| |v_main_#t~post5_128|)) (.cse1 (= |v_main_#t~post6_129| |v_main_#t~post6_128|)) (.cse2 (= v_main_~y~0_421 v_main_~y~0_420)) (.cse3 (= v_main_~x~0_338 v_main_~x~0_337)) (.cse4 (mod v_main_~x~0_338 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< 0 .cse4) (= v_main_~y~0_420 (+ v_main_~x~0_338 (* v_main_~x~0_337 (- 1)) v_main_~y~0_421)) (< v_main_~x~0_337 v_main_~x~0_338) (forall ((v_it_27 Int)) (or (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_338 (* 4294967295 v_it_27)) 4294967296)) (not (<= (+ v_main_~x~0_337 v_it_27 1) v_main_~x~0_338))))))) InVars {main_~y~0=v_main_~y~0_421, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_338, main_#t~post6=|v_main_#t~post6_129|} OutVars{main_~y~0=v_main_~y~0_420, main_#t~post5=|v_main_#t~post5_128|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_128|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {19335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {19335#true} call #t~ret15 := main(); {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19335#true} {19335#true} #83#return; {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {19335#true} assume true; {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {19335#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); {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {19335#true} call ULTIMATE.init(); {19335#true} is VALID [2022-04-28 03:45:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:45:21,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168437745] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:21,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:21,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 26 [2022-04-28 03:45:22,201 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:22,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [351107618] [2022-04-28 03:45:22,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [351107618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:22,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:22,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:45:22,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126013845] [2022-04-28 03:45:22,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:22,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:45:22,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:22,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:22,234 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-28 03:45:22,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:45:22,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:22,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:45:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:45:22,235 INFO L87 Difference]: Start difference. First operand 125 states and 170 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:27,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:27,292 INFO L93 Difference]: Finished difference Result 217 states and 293 transitions. [2022-04-28 03:45:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:45:27,293 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:45:27,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2022-04-28 03:45:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 110 transitions. [2022-04-28 03:45:27,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 110 transitions. [2022-04-28 03:45:27,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:27,532 INFO L225 Difference]: With dead ends: 217 [2022-04-28 03:45:27,532 INFO L226 Difference]: Without dead ends: 211 [2022-04-28 03:45:27,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=573, Invalid=3209, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:45:27,533 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 74 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:27,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 66 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:45:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-28 03:45:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 143. [2022-04-28 03:45:28,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:28,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:28,614 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:28,614 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:28,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:28,616 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2022-04-28 03:45:28,616 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-04-28 03:45:28,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:28,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:28,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 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 211 states. [2022-04-28 03:45:28,617 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 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 211 states. [2022-04-28 03:45:28,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:28,619 INFO L93 Difference]: Finished difference Result 211 states and 274 transitions. [2022-04-28 03:45:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 274 transitions. [2022-04-28 03:45:28,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:28,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:28,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:28,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:28,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.3768115942028984) internal successors, (190), 138 states have internal predecessors, (190), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:28,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 194 transitions. [2022-04-28 03:45:28,622 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 194 transitions. Word has length 35 [2022-04-28 03:45:28,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:28,622 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 194 transitions. [2022-04-28 03:45:28,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 14 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:28,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 194 transitions. [2022-04-28 03:45:35,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 193 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 194 transitions. [2022-04-28 03:45:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:45:35,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:35,998 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:36,017 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-28 03:45:36,217 WARN L477 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-28 03:45:36,218 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:36,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 16 times [2022-04-28 03:45:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:36,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1069297342] [2022-04-28 03:45:36,378 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-28 03:45:36,379 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:36,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2096057710, now seen corresponding path program 1 times [2022-04-28 03:45:36,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:36,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217992470] [2022-04-28 03:45:36,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:36,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:36,390 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-28 03:45:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:36,408 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-28 03:45:36,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:36,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {20787#(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); {20769#true} is VALID [2022-04-28 03:45:36,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 03:45:36,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 03:45:36,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:36,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {20787#(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); {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret15 := main(); {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {20769#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_356 4294967296)) (.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse3 (= v_main_~y~0_446 v_main_~y~0_445)) (.cse4 (= v_main_~x~0_356 v_main_~x~0_355))) (or (and (= v_main_~y~0_445 (+ v_main_~x~0_356 (* v_main_~x~0_355 (- 1)) v_main_~y~0_446)) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_356 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_355 v_it_28 1) v_main_~x~0_356)) (not (<= 1 v_it_28)))) (< v_main_~x~0_355 v_main_~x~0_356) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_446, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_356, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_445, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_355, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20769#true} is VALID [2022-04-28 03:45:36,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} ~z~0 := ~y~0; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:36,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {20774#(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; {20775#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:45:36,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {20775#(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; {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:45:36,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {20776#(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; {20777#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:45:36,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {20777#(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; {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:45:36,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20779#(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-28 03:45:36,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {20779#(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; {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {20780#(<= 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; {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {20781#(<= 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; {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:45:36,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {20782#(<= 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; {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:36,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:36,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {20783#(<= 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; {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:45:36,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {20782#(<= 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; {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {20781#(<= main_~y~0 (+ 2 (* (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; {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {20780#(<= main_~y~0 (+ 3 (* (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; {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {20784#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {20780#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:36,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {20781#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:45:36,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {20782#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:36,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:36,654 INFO L272 TraceCheckUtils]: 29: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20785#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:45:36,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {20785#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {20786#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:45:36,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {20786#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20770#false} is VALID [2022-04-28 03:45:36,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-28 03:45:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:36,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:36,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217992470] [2022-04-28 03:45:36,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217992470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:36,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801099384] [2022-04-28 03:45:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:36,656 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-28 03:45:36,660 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-28 03:45:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:36,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 03:45:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:36,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:37,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20769#true} is VALID [2022-04-28 03:45:37,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#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); {20769#true} is VALID [2022-04-28 03:45:37,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 03:45:37,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 03:45:37,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret15 := main(); {20769#true} is VALID [2022-04-28 03:45:37,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20769#true} is VALID [2022-04-28 03:45:37,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {20769#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_356 4294967296)) (.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse3 (= v_main_~y~0_446 v_main_~y~0_445)) (.cse4 (= v_main_~x~0_356 v_main_~x~0_355))) (or (and (= v_main_~y~0_445 (+ v_main_~x~0_356 (* v_main_~x~0_355 (- 1)) v_main_~y~0_446)) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_356 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_355 v_it_28 1) v_main_~x~0_356)) (not (<= 1 v_it_28)))) (< v_main_~x~0_355 v_main_~x~0_356) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_446, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_356, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_445, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_355, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20769#true} is VALID [2022-04-28 03:45:37,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20769#true} is VALID [2022-04-28 03:45:37,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} ~z~0 := ~y~0; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {20774#(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; {20775#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:45:37,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {20775#(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; {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:45:37,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {20776#(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; {20777#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:45:37,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {20777#(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; {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:45:37,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:45:37,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {20778#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ 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; {20776#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:45:37,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {20776#(and (<= 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; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= 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; {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-28 03:45:37,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 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; {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-28 03:45:37,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} assume !(~y~0 % 4294967296 > 0); {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) main_~z~0))} is VALID [2022-04-28 03:45:37,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {20843#(and (<= main_~z~0 (+ main_~y~0 4)) (<= (+ main_~y~0 4) 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; {20850#(and (<= (+ main_~y~0 3) main_~z~0) (<= main_~z~0 (+ main_~y~0 3)))} is VALID [2022-04-28 03:45:37,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {20850#(and (<= (+ main_~y~0 3) main_~z~0) (<= 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; {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ main_~y~0 2) main_~z~0))} is VALID [2022-04-28 03:45:37,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {20839#(and (<= main_~z~0 (+ main_~y~0 2)) (<= (+ 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; {20857#(and (<= (+ main_~y~0 1) main_~z~0) (<= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:45:37,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {20857#(and (<= (+ main_~y~0 1) main_~z~0) (<= 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; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:37,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {20774#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:37,287 INFO L272 TraceCheckUtils]: 29: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:37,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:37,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {20886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20770#false} is VALID [2022-04-28 03:45:37,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-28 03:45:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:45:37,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:38,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {20770#false} assume !false; {20770#false} is VALID [2022-04-28 03:45:38,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {20886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20770#false} is VALID [2022-04-28 03:45:38,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:38,339 INFO L272 TraceCheckUtils]: 29: Hoare triple {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {20882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:38,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {20905#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {20783#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:45:38,341 INFO L290 TraceCheckUtils]: 27: Hoare triple {20909#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20905#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:45:38,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {20913#(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~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20909#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:38,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {20917#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:38,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {20917#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {20928#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 3 (* (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; {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {20932#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 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; {20928#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {20936#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 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; {20932#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:45:38,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 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; {20936#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:45:38,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:45:38,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {20947#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~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; {20940#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:45:38,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 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; {20947#(or (<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:38,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {20954#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= 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; {20913#(or (<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:45:38,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= 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; {20954#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {20965#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20958#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {20969#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20965#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:38,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {20973#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20969#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20973#(or (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:38,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {20769#true} ~z~0 := ~y~0; {20921#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:38,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {20769#true} [140] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20769#true} is VALID [2022-04-28 03:45:38,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {20769#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_356 4294967296)) (.cse1 (= |v_main_#t~post5_134| |v_main_#t~post5_133|)) (.cse2 (= |v_main_#t~post6_134| |v_main_#t~post6_133|)) (.cse3 (= v_main_~y~0_446 v_main_~y~0_445)) (.cse4 (= v_main_~x~0_356 v_main_~x~0_355))) (or (and (= v_main_~y~0_445 (+ v_main_~x~0_356 (* v_main_~x~0_355 (- 1)) v_main_~y~0_446)) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_356 (* 4294967295 v_it_28)) 4294967296)) (not (<= (+ v_main_~x~0_355 v_it_28 1) v_main_~x~0_356)) (not (<= 1 v_it_28)))) (< v_main_~x~0_355 v_main_~x~0_356) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_446, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_356, main_#t~post6=|v_main_#t~post6_134|} OutVars{main_~y~0=v_main_~y~0_445, main_#t~post5=|v_main_#t~post5_133|, main_~x~0=v_main_~x~0_355, main_#t~post6=|v_main_#t~post6_133|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {20769#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {20769#true} call #t~ret15 := main(); {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20769#true} {20769#true} #83#return; {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {20769#true} assume true; {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {20769#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); {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {20769#true} call ULTIMATE.init(); {20769#true} is VALID [2022-04-28 03:45:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:38,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801099384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:38,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:38,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 20] total 37 [2022-04-28 03:45:38,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:38,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1069297342] [2022-04-28 03:45:38,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1069297342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:38,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:38,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:45:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815601443] [2022-04-28 03:45:38,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:38,654 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:45:38,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:38,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-28 03:45:38,688 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-28 03:45:38,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:45:38,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:38,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:45:38,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:45:38,689 INFO L87 Difference]: Start difference. First operand 143 states and 194 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-28 03:45:45,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:45,355 INFO L93 Difference]: Finished difference Result 353 states and 472 transitions. [2022-04-28 03:45:45,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:45:45,355 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:45:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:45:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-28 03:45:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-28 03:45:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-28 03:45:45,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-28 03:45:45,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 85 transitions. [2022-04-28 03:45:45,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:45,551 INFO L225 Difference]: With dead ends: 353 [2022-04-28 03:45:45,551 INFO L226 Difference]: Without dead ends: 208 [2022-04-28 03:45:45,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=435, Invalid=3855, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 03:45:45,552 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:45:45,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 101 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:45:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-28 03:45:46,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 144. [2022-04-28 03:45:46,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:45:46,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:46,687 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:46,688 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:46,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:46,690 INFO L93 Difference]: Finished difference Result 208 states and 273 transitions. [2022-04-28 03:45:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2022-04-28 03:45:46,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:46,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:46,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 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 208 states. [2022-04-28 03:45:46,691 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 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 208 states. [2022-04-28 03:45:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:45:46,693 INFO L93 Difference]: Finished difference Result 208 states and 273 transitions. [2022-04-28 03:45:46,693 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 273 transitions. [2022-04-28 03:45:46,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:45:46,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:45:46,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:45:46,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:45:46,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.381294964028777) internal successors, (192), 139 states have internal predecessors, (192), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:45:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 196 transitions. [2022-04-28 03:45:46,695 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 196 transitions. Word has length 36 [2022-04-28 03:45:46,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:45:46,695 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 196 transitions. [2022-04-28 03:45:46,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.6) internal successors, (32), 18 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-28 03:45:46,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 196 transitions. [2022-04-28 03:45:55,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 194 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:45:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 196 transitions. [2022-04-28 03:45:55,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:45:55,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:45:55,217 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:45:55,233 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-28 03:45:55,417 WARN L477 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-28 03:45:55,417 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:45:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:45:55,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1121793873, now seen corresponding path program 17 times [2022-04-28 03:45:55,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:55,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21827435] [2022-04-28 03:45:55,603 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-28 03:45:55,605 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:45:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1126625650, now seen corresponding path program 1 times [2022-04-28 03:45:55,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:45:55,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451016530] [2022-04-28 03:45:55,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:55,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:45:55,616 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-28 03:45:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:55,628 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-28 03:45:55,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:45:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:55,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {22487#(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); {22473#true} is VALID [2022-04-28 03:45:55,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-28 03:45:55,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-28 03:45:55,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {22473#true} call ULTIMATE.init(); {22487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:45:55,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {22487#(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); {22473#true} is VALID [2022-04-28 03:45:55,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-28 03:45:55,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-28 03:45:55,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {22473#true} call #t~ret15 := main(); {22473#true} is VALID [2022-04-28 03:45:55,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {22473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22473#true} is VALID [2022-04-28 03:45:55,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {22473#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_374 v_main_~x~0_373)) (.cse1 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse3 (mod v_main_~x~0_374 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_480 v_main_~y~0_479)) (and .cse0 (= v_main_~y~0_479 v_main_~y~0_480) .cse1 .cse2 (<= .cse3 0)) (and (< v_main_~y~0_480 v_main_~y~0_479) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_480 v_it_29 1) v_main_~y~0_479)) (< 0 (mod (+ v_main_~x~0_374 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< 0 .cse3) (= v_main_~x~0_373 (+ v_main_~x~0_374 v_main_~y~0_480 (* (- 1) v_main_~y~0_479)))))) InVars {main_~y~0=v_main_~y~0_480, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_374, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_479, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22473#true} is VALID [2022-04-28 03:45:55,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {22473#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22478#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:55,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {22478#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {22478#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:45:55,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {22478#(<= 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; {22479#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:45:55,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {22479#(<= 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; {22480#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {22480#(<= 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; {22481#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {22481#(<= 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; {22482#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {22482#(<= 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; {22483#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:45:55,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {22483#(<= 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; {22484#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {22484#(<= 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; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {22485#(<= 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; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {22485#(<= 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; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {22485#(<= 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; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {22485#(<= 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; {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {22485#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:45:55,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {22485#(<= 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; {22486#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:45:55,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {22486#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:55,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 27: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {22474#false} assume !(~z~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L272 TraceCheckUtils]: 29: Hoare triple {22474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {22474#false} ~cond := #in~cond; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {22474#false} assume 0 == ~cond; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {22474#false} assume !false; {22474#false} is VALID [2022-04-28 03:45:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 03:45:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:45:55,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451016530] [2022-04-28 03:45:55,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451016530] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:45:55,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735494137] [2022-04-28 03:45:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:45:55,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:45:55,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:45:55,774 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-28 03:45:55,775 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-28 03:45:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:55,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:45:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:45:55,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:56,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {22473#true} call ULTIMATE.init(); {22473#true} is VALID [2022-04-28 03:45:56,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {22473#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); {22473#true} is VALID [2022-04-28 03:45:56,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-28 03:45:56,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-28 03:45:56,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {22473#true} call #t~ret15 := main(); {22473#true} is VALID [2022-04-28 03:45:56,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {22473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22473#true} is VALID [2022-04-28 03:45:56,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {22473#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_374 v_main_~x~0_373)) (.cse1 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse3 (mod v_main_~x~0_374 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_480 v_main_~y~0_479)) (and .cse0 (= v_main_~y~0_479 v_main_~y~0_480) .cse1 .cse2 (<= .cse3 0)) (and (< v_main_~y~0_480 v_main_~y~0_479) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_480 v_it_29 1) v_main_~y~0_479)) (< 0 (mod (+ v_main_~x~0_374 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< 0 .cse3) (= v_main_~x~0_373 (+ v_main_~x~0_374 v_main_~y~0_480 (* (- 1) v_main_~y~0_479)))))) InVars {main_~y~0=v_main_~y~0_480, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_374, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_479, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22473#true} is VALID [2022-04-28 03:45:56,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {22473#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22473#true} is VALID [2022-04-28 03:45:56,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {22473#true} ~z~0 := ~y~0; {22515#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:45:56,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {22515#(= 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; {22519#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:45:56,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {22519#(= 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; {22523#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:45:56,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {22523#(= (+ 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; {22527#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:45:56,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {22527#(= (+ 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; {22531#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:45:56,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {22531#(= (+ 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {22535#(< 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; {22548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:45:56,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {22548#(< 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; {22552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:45:56,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {22552#(< 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; {22556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {22556#(< 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; {22560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {22560#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {22474#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; {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {22474#false} assume !(~x~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 26: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {22474#false} assume !(~z~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:56,087 INFO L272 TraceCheckUtils]: 29: Hoare triple {22474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22474#false} is VALID [2022-04-28 03:45:56,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {22474#false} ~cond := #in~cond; {22474#false} is VALID [2022-04-28 03:45:56,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {22474#false} assume 0 == ~cond; {22474#false} is VALID [2022-04-28 03:45:56,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {22474#false} assume !false; {22474#false} is VALID [2022-04-28 03:45:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 03:45:56,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:56,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {22474#false} assume !false; {22474#false} is VALID [2022-04-28 03:45:56,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {22474#false} assume 0 == ~cond; {22474#false} is VALID [2022-04-28 03:45:56,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {22474#false} ~cond := #in~cond; {22474#false} is VALID [2022-04-28 03:45:56,367 INFO L272 TraceCheckUtils]: 29: Hoare triple {22474#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {22474#false} is VALID [2022-04-28 03:45:56,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {22474#false} assume !(~z~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:56,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {22474#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {22474#false} is VALID [2022-04-28 03:45:56,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {22474#false} assume !(~x~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:56,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {22474#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; {22474#false} is VALID [2022-04-28 03:45:56,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {22560#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {22474#false} is VALID [2022-04-28 03:45:56,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {22556#(< 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; {22560#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:45:56,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {22552#(< 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; {22556#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:45:56,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {22548#(< 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; {22552#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:45:56,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {22535#(< 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; {22548#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:45:56,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {22535#(< 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {22654#(or (not (< 0 (mod 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; {22535#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:45:56,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {22658#(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; {22654#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:56,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {22662#(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; {22658#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:56,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {22666#(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; {22662#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:56,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {22670#(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; {22666#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:56,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {22473#true} ~z~0 := ~y~0; {22670#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:56,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {22473#true} [142] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {22473#true} is VALID [2022-04-28 03:45:56,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {22473#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_374 v_main_~x~0_373)) (.cse1 (= |v_main_#t~post5_139| |v_main_#t~post5_138|)) (.cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_138|)) (.cse3 (mod v_main_~x~0_374 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_480 v_main_~y~0_479)) (and .cse0 (= v_main_~y~0_479 v_main_~y~0_480) .cse1 .cse2 (<= .cse3 0)) (and (< v_main_~y~0_480 v_main_~y~0_479) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_480 v_it_29 1) v_main_~y~0_479)) (< 0 (mod (+ v_main_~x~0_374 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< 0 .cse3) (= v_main_~x~0_373 (+ v_main_~x~0_374 v_main_~y~0_480 (* (- 1) v_main_~y~0_479)))))) InVars {main_~y~0=v_main_~y~0_480, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_374, main_#t~post6=|v_main_#t~post6_139|} OutVars{main_~y~0=v_main_~y~0_479, main_#t~post5=|v_main_#t~post5_138|, main_~x~0=v_main_~x~0_373, main_#t~post6=|v_main_#t~post6_138|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22473#true} is VALID [2022-04-28 03:45:56,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {22473#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22473#true} is VALID [2022-04-28 03:45:56,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {22473#true} call #t~ret15 := main(); {22473#true} is VALID [2022-04-28 03:45:56,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22473#true} {22473#true} #83#return; {22473#true} is VALID [2022-04-28 03:45:56,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {22473#true} assume true; {22473#true} is VALID [2022-04-28 03:45:56,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {22473#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); {22473#true} is VALID [2022-04-28 03:45:56,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {22473#true} call ULTIMATE.init(); {22473#true} is VALID [2022-04-28 03:45:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-28 03:45:56,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735494137] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:56,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:56,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-04-28 03:45:56,833 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:45:56,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [21827435] [2022-04-28 03:45:56,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [21827435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:45:56,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:45:56,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:45:56,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766232813] [2022-04-28 03:45:56,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:45:56,834 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:45:56,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:45:56,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:45:56,876 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-28 03:45:56,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:45:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:45:56,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:45:56,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:45:56,877 INFO L87 Difference]: Start difference. First operand 144 states and 196 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:46:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:02,319 INFO L93 Difference]: Finished difference Result 332 states and 508 transitions. [2022-04-28 03:46:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:46:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:46:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:02,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:46:02,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-04-28 03:46:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:46:02,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 108 transitions. [2022-04-28 03:46:02,321 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 108 transitions. [2022-04-28 03:46:02,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:02,529 INFO L225 Difference]: With dead ends: 332 [2022-04-28 03:46:02,529 INFO L226 Difference]: Without dead ends: 305 [2022-04-28 03:46:02,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=358, Invalid=2192, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:46:02,530 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 116 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:02,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 65 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:46:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-28 03:46:03,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 160. [2022-04-28 03:46:03,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:03,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:03,889 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:03,889 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:03,893 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2022-04-28 03:46:03,893 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2022-04-28 03:46:03,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:03,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:03,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 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 305 states. [2022-04-28 03:46:03,894 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 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 305 states. [2022-04-28 03:46:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:03,897 INFO L93 Difference]: Finished difference Result 305 states and 428 transitions. [2022-04-28 03:46:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 428 transitions. [2022-04-28 03:46:03,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:03,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:03,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:03,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 219 transitions. [2022-04-28 03:46:03,900 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 219 transitions. Word has length 37 [2022-04-28 03:46:03,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:03,900 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 219 transitions. [2022-04-28 03:46:03,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 16 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-28 03:46:03,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 219 transitions. [2022-04-28 03:46:15,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 216 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:15,578 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 219 transitions. [2022-04-28 03:46:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:46:15,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:15,578 INFO L195 NwaCegarLoop]: trace histogram [8, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:15,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-28 03:46:15,787 WARN L477 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-28 03:46:15,787 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:15,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1797819389, now seen corresponding path program 18 times [2022-04-28 03:46:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:15,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1299885823] [2022-04-28 03:46:15,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-28 03:46:15,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:15,946 INFO L85 PathProgramCache]: Analyzing trace with hash -533849532, now seen corresponding path program 1 times [2022-04-28 03:46:15,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:15,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786153987] [2022-04-28 03:46:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:15,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:15,955 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-28 03:46:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:15,970 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-28 03:46:16,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:16,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {24352#(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); {24337#true} is VALID [2022-04-28 03:46:16,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-28 03:46:16,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-28 03:46:16,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {24337#true} call ULTIMATE.init(); {24352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:16,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {24352#(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); {24337#true} is VALID [2022-04-28 03:46:16,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-28 03:46:16,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-28 03:46:16,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {24337#true} call #t~ret15 := main(); {24337#true} is VALID [2022-04-28 03:46:16,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {24337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24337#true} is VALID [2022-04-28 03:46:16,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {24337#true} [145] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_504 v_main_~y~0_503)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_393 v_main_~x~0_392)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_393 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_503 (+ v_main_~x~0_393 (* v_main_~x~0_392 (- 1)) v_main_~y~0_504)) (< v_main_~x~0_392 v_main_~x~0_393) (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_393 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~x~0_392 v_it_30 1) v_main_~x~0_393))))))) InVars {main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_393, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_503, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_392, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24337#true} is VALID [2022-04-28 03:46:16,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {24337#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24342#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:46:16,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {24342#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {24342#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:46:16,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {24342#(<= 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; {24343#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:46:16,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {24343#(<= 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; {24344#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {24344#(<= 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; {24345#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {24345#(<= 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; {24346#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {24346#(<= 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; {24347#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:46:16,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {24347#(<= 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; {24348#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {24348#(<= 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; {24349#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {24349#(<= 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; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {24350#(<= 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; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {24350#(<= 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; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {24350#(<= 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; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {24350#(<= 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; {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24350#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:16,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {24350#(<= 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; {24351#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {24351#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 28: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 29: Hoare triple {24338#false} assume !(~z~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L272 TraceCheckUtils]: 30: Hoare triple {24338#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 31: Hoare triple {24338#false} ~cond := #in~cond; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 32: Hoare triple {24338#false} assume 0 == ~cond; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {24338#false} assume !false; {24338#false} is VALID [2022-04-28 03:46:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-28 03:46:16,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786153987] [2022-04-28 03:46:16,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786153987] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012811811] [2022-04-28 03:46:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:16,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:16,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:16,139 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-28 03:46:16,140 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-28 03:46:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:16,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:46:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:16,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:16,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {24337#true} call ULTIMATE.init(); {24337#true} is VALID [2022-04-28 03:46:16,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {24337#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); {24337#true} is VALID [2022-04-28 03:46:16,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-28 03:46:16,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-28 03:46:16,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {24337#true} call #t~ret15 := main(); {24337#true} is VALID [2022-04-28 03:46:16,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {24337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24337#true} is VALID [2022-04-28 03:46:16,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {24337#true} [145] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_504 v_main_~y~0_503)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_393 v_main_~x~0_392)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_393 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_503 (+ v_main_~x~0_393 (* v_main_~x~0_392 (- 1)) v_main_~y~0_504)) (< v_main_~x~0_392 v_main_~x~0_393) (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_393 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~x~0_392 v_it_30 1) v_main_~x~0_393))))))) InVars {main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_393, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_503, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_392, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24337#true} is VALID [2022-04-28 03:46:16,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {24337#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24337#true} is VALID [2022-04-28 03:46:16,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {24337#true} ~z~0 := ~y~0; {24380#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:16,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {24380#(= 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; {24384#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:46:16,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {24384#(= 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; {24388#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:16,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {24388#(= 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; {24392#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:46:16,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {24392#(= (+ (- 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; {24396#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:46:16,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {24396#(= (+ (- 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; {24400#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-28 03:46:16,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {24400#(= (+ (- 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; {24404#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:46:16,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {24404#(= (+ 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; {24408#(= (+ main_~z~0 2) (+ main_~y~0 (- 5)))} is VALID [2022-04-28 03:46:16,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {24408#(= (+ main_~z~0 2) (+ main_~y~0 (- 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; {24412#(= (+ main_~y~0 (- 5)) (+ main_~z~0 3))} is VALID [2022-04-28 03:46:16,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {24412#(= (+ main_~y~0 (- 5)) (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {24412#(= (+ main_~y~0 (- 5)) (+ main_~z~0 3))} is VALID [2022-04-28 03:46:16,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {24412#(= (+ main_~y~0 (- 5)) (+ 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; {24404#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:46:16,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {24404#(= (+ 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; {24396#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:46:16,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {24396#(= (+ (- 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; {24388#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:46:16,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {24388#(= 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; {24380#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:46:16,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {24380#(= main_~z~0 main_~y~0)} assume !(~y~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:16,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {24431#(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; {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:16,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 26: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 27: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 28: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {24338#false} assume !(~z~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L272 TraceCheckUtils]: 30: Hoare triple {24338#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 31: Hoare triple {24338#false} ~cond := #in~cond; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {24338#false} assume 0 == ~cond; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {24338#false} assume !false; {24338#false} is VALID [2022-04-28 03:46:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:46:16,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:17,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {24338#false} assume !false; {24338#false} is VALID [2022-04-28 03:46:17,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {24338#false} assume 0 == ~cond; {24338#false} is VALID [2022-04-28 03:46:17,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {24338#false} ~cond := #in~cond; {24338#false} is VALID [2022-04-28 03:46:17,141 INFO L272 TraceCheckUtils]: 30: Hoare triple {24338#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {24338#false} is VALID [2022-04-28 03:46:17,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {24338#false} assume !(~z~0 % 4294967296 > 0); {24338#false} is VALID [2022-04-28 03:46:17,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:17,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:17,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {24338#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:17,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {24338#false} is VALID [2022-04-28 03:46:17,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {24431#(not (< 0 (mod main_~z~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:17,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {24431#(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; {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:17,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {24498#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {24431#(not (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:17,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {24502#(or (not (< 0 (mod (+ main_~z~0 1) 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; {24498#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:46:17,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {24506#(or (not (< 0 (mod (+ main_~z~0 2) 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; {24502#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:17,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {24510#(or (not (< 0 (mod (+ main_~z~0 3) 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; {24506#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:17,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {24514#(or (not (< 0 (mod (+ main_~z~0 4) 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; {24510#(or (not (< 0 (mod (+ main_~z~0 3) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:46:17,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {24521#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (not (< 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; {24514#(or (not (< 0 (mod (+ main_~z~0 4) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {24525#(or (not (< 0 (mod (+ main_~z~0 2) 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; {24521#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (not (< 0 (mod (+ main_~z~0 3) 4294967296))))} is VALID [2022-04-28 03:46:17,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {24529#(or (not (< 0 (mod (+ main_~z~0 1) 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; {24525#(or (not (< 0 (mod (+ main_~z~0 2) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {24533#(or (not (< 0 (mod 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; {24529#(or (not (< 0 (mod (+ main_~z~0 1) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {24537#(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; {24533#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {24541#(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; {24537#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {24545#(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; {24541#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {24549#(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; {24545#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {24337#true} ~z~0 := ~y~0; {24549#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:46:17,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {24337#true} [144] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {24337#true} is VALID [2022-04-28 03:46:17,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {24337#true} [145] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_504 v_main_~y~0_503)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_393 v_main_~x~0_392)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (mod v_main_~x~0_393 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (= v_main_~y~0_503 (+ v_main_~x~0_393 (* v_main_~x~0_392 (- 1)) v_main_~y~0_504)) (< v_main_~x~0_392 v_main_~x~0_393) (forall ((v_it_30 Int)) (or (< 0 (mod (+ v_main_~x~0_393 (* 4294967295 v_it_30)) 4294967296)) (not (<= 1 v_it_30)) (not (<= (+ v_main_~x~0_392 v_it_30 1) v_main_~x~0_393))))))) InVars {main_~y~0=v_main_~y~0_504, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_393, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_503, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_392, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24337#true} is VALID [2022-04-28 03:46:17,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {24337#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24337#true} is VALID [2022-04-28 03:46:17,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {24337#true} call #t~ret15 := main(); {24337#true} is VALID [2022-04-28 03:46:17,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24337#true} {24337#true} #83#return; {24337#true} is VALID [2022-04-28 03:46:17,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {24337#true} assume true; {24337#true} is VALID [2022-04-28 03:46:17,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {24337#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); {24337#true} is VALID [2022-04-28 03:46:17,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {24337#true} call ULTIMATE.init(); {24337#true} is VALID [2022-04-28 03:46:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:46:17,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012811811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:17,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:17,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 16] total 36 [2022-04-28 03:46:17,743 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:17,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1299885823] [2022-04-28 03:46:17,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1299885823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:17,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:17,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:46:17,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501613198] [2022-04-28 03:46:17,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:17,744 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:17,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:17,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:17,780 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-28 03:46:17,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:46:17,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:17,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:46:17,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1489, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:46:17,781 INFO L87 Difference]: Start difference. First operand 160 states and 219 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:25,336 INFO L93 Difference]: Finished difference Result 352 states and 534 transitions. [2022-04-28 03:46:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:46:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 113 transitions. [2022-04-28 03:46:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 113 transitions. [2022-04-28 03:46:25,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 113 transitions. [2022-04-28 03:46:25,580 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-28 03:46:25,585 INFO L225 Difference]: With dead ends: 352 [2022-04-28 03:46:25,585 INFO L226 Difference]: Without dead ends: 325 [2022-04-28 03:46:25,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=400, Invalid=3260, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:46:25,586 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:25,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 58 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:46:25,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-04-28 03:46:27,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 175. [2022-04-28 03:46:27,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:27,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 325 states. Second operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:27,128 INFO L74 IsIncluded]: Start isIncluded. First operand 325 states. Second operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:27,129 INFO L87 Difference]: Start difference. First operand 325 states. Second operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:27,132 INFO L93 Difference]: Finished difference Result 325 states and 454 transitions. [2022-04-28 03:46:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 454 transitions. [2022-04-28 03:46:27,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:27,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:27,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 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 325 states. [2022-04-28 03:46:27,133 INFO L87 Difference]: Start difference. First operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 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 325 states. [2022-04-28 03:46:27,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:27,137 INFO L93 Difference]: Finished difference Result 325 states and 454 transitions. [2022-04-28 03:46:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 454 transitions. [2022-04-28 03:46:27,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:27,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:27,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:27,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:27,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 170 states have (on average 1.388235294117647) internal successors, (236), 170 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 240 transitions. [2022-04-28 03:46:27,140 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 240 transitions. Word has length 38 [2022-04-28 03:46:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:27,140 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 240 transitions. [2022-04-28 03:46:27,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:27,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 240 transitions. [2022-04-28 03:46:39,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 237 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:39,263 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 240 transitions. [2022-04-28 03:46:39,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:46:39,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:39,264 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:39,283 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-28 03:46:39,465 WARN L477 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-28 03:46:39,465 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:39,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:39,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1630133039, now seen corresponding path program 19 times [2022-04-28 03:46:39,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:39,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [399997425] [2022-04-28 03:46:41,573 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:46:41,657 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-28 03:46:41,658 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:41,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1259744050, now seen corresponding path program 1 times [2022-04-28 03:46:41,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:41,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472922745] [2022-04-28 03:46:41,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:41,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:41,673 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-28 03:46:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:41,694 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-28 03:46:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:41,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {26343#(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); {26328#true} is VALID [2022-04-28 03:46:41,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-28 03:46:41,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-28 03:46:41,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {26328#true} call ULTIMATE.init(); {26343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:41,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {26343#(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); {26328#true} is VALID [2022-04-28 03:46:41,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-28 03:46:41,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-28 03:46:41,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {26328#true} call #t~ret15 := main(); {26328#true} is VALID [2022-04-28 03:46:41,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {26328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26328#true} is VALID [2022-04-28 03:46:41,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {26328#true} [147] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_413 v_main_~x~0_412)) (.cse1 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (mod v_main_~x~0_413 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_528 v_it_31 1) v_main_~y~0_527)) (< 0 (mod (+ v_main_~x~0_413 (* 4294967295 v_it_31)) 4294967296)))) (= v_main_~x~0_412 (+ v_main_~x~0_413 v_main_~y~0_528 (* (- 1) v_main_~y~0_527))) (< v_main_~y~0_528 v_main_~y~0_527) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_412, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26328#true} is VALID [2022-04-28 03:46:41,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {26328#true} [146] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26328#true} is VALID [2022-04-28 03:46:41,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {26328#true} ~z~0 := ~y~0; {26333#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:46:41,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {26333#(= (+ 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; {26334#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:41,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {26334#(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; {26335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:41,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {26335#(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; {26336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:41,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {26336#(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; {26337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:41,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {26337#(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; {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:41,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:41,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 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; {26339#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:46:41,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {26339#(<= 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; {26340#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:46:41,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {26340#(<= 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; {26341#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:46:41,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {26341#(<= 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; {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:41,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:41,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {26329#false} assume !(~x~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {26329#false} assume !(~z~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L272 TraceCheckUtils]: 31: Hoare triple {26329#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {26329#false} ~cond := #in~cond; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {26329#false} assume 0 == ~cond; {26329#false} is VALID [2022-04-28 03:46:41,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {26329#false} assume !false; {26329#false} is VALID [2022-04-28 03:46:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 03:46:41,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472922745] [2022-04-28 03:46:41,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472922745] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:41,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641084892] [2022-04-28 03:46:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:41,880 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-28 03:46:41,882 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-28 03:46:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:41,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:46:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:41,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:42,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {26328#true} call ULTIMATE.init(); {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {26328#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); {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {26328#true} call #t~ret15 := main(); {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {26328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {26328#true} [147] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_413 v_main_~x~0_412)) (.cse1 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (mod v_main_~x~0_413 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_528 v_it_31 1) v_main_~y~0_527)) (< 0 (mod (+ v_main_~x~0_413 (* 4294967295 v_it_31)) 4294967296)))) (= v_main_~x~0_412 (+ v_main_~x~0_413 v_main_~y~0_528 (* (- 1) v_main_~y~0_527))) (< v_main_~y~0_528 v_main_~y~0_527) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_412, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26328#true} is VALID [2022-04-28 03:46:42,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {26328#true} [146] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26328#true} is VALID [2022-04-28 03:46:42,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {26328#true} ~z~0 := ~y~0; {26333#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:46:42,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {26333#(= (+ 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; {26334#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:42,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {26334#(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; {26335#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:42,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {26335#(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; {26336#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:42,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {26336#(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; {26337#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:42,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {26337#(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; {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:42,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:42,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 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; {26339#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:46:42,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {26339#(<= 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; {26340#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:46:42,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {26340#(<= 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; {26341#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:46:42,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {26341#(<= 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; {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {26329#false} assume !(~x~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {26329#false} assume !(~z~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L272 TraceCheckUtils]: 31: Hoare triple {26329#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {26329#false} ~cond := #in~cond; {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {26329#false} assume 0 == ~cond; {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {26329#false} assume !false; {26329#false} is VALID [2022-04-28 03:46:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 03:46:42,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:42,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {26329#false} assume !false; {26329#false} is VALID [2022-04-28 03:46:42,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {26329#false} assume 0 == ~cond; {26329#false} is VALID [2022-04-28 03:46:42,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {26329#false} ~cond := #in~cond; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L272 TraceCheckUtils]: 31: Hoare triple {26329#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {26329#false} assume !(~z~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {26329#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {26329#false} assume !(~x~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {26329#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; {26329#false} is VALID [2022-04-28 03:46:42,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {26329#false} is VALID [2022-04-28 03:46:42,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {26341#(<= 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; {26342#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:42,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {26340#(<= 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; {26341#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:46:42,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {26339#(<= 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; {26340#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:46:42,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 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; {26339#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:46:42,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:42,780 INFO L290 TraceCheckUtils]: 13: Hoare triple {26512#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26338#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:42,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {26516#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26512#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:46:42,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {26520#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26516#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-28 03:46:42,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {26524#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26520#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:46:42,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {26528#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26524#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:46:42,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {26328#true} ~z~0 := ~y~0; {26528#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:46:42,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {26328#true} [146] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {26328#true} [147] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_413 v_main_~x~0_412)) (.cse1 (= |v_main_#t~post5_149| |v_main_#t~post5_148|)) (.cse2 (= v_main_~y~0_528 v_main_~y~0_527)) (.cse4 (mod v_main_~x~0_413 4294967296)) (.cse3 (= |v_main_#t~post6_149| |v_main_#t~post6_148|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_31 Int)) (or (not (<= 1 v_it_31)) (not (<= (+ v_main_~y~0_528 v_it_31 1) v_main_~y~0_527)) (< 0 (mod (+ v_main_~x~0_413 (* 4294967295 v_it_31)) 4294967296)))) (= v_main_~x~0_412 (+ v_main_~x~0_413 v_main_~y~0_528 (* (- 1) v_main_~y~0_527))) (< v_main_~y~0_528 v_main_~y~0_527) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_528, main_#t~post5=|v_main_#t~post5_149|, main_~x~0=v_main_~x~0_413, main_#t~post6=|v_main_#t~post6_149|} OutVars{main_~y~0=v_main_~y~0_527, main_#t~post5=|v_main_#t~post5_148|, main_~x~0=v_main_~x~0_412, main_#t~post6=|v_main_#t~post6_148|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {26328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {26328#true} call #t~ret15 := main(); {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26328#true} {26328#true} #83#return; {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {26328#true} assume true; {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {26328#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); {26328#true} is VALID [2022-04-28 03:46:42,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {26328#true} call ULTIMATE.init(); {26328#true} is VALID [2022-04-28 03:46:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-28 03:46:42,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641084892] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:42,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:42,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-28 03:46:43,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:43,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [399997425] [2022-04-28 03:46:43,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [399997425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:43,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:43,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:46:43,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947803596] [2022-04-28 03:46:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 39 [2022-04-28 03:46:43,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:43,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:43,221 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-28 03:46:43,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:46:43,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:43,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:46:43,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:46:43,222 INFO L87 Difference]: Start difference. First operand 175 states and 240 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:53,858 INFO L93 Difference]: Finished difference Result 307 states and 391 transitions. [2022-04-28 03:46:53,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:46:53,858 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 39 [2022-04-28 03:46:53,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 89 transitions. [2022-04-28 03:46:53,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:53,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 89 transitions. [2022-04-28 03:46:53,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 89 transitions. [2022-04-28 03:46:54,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:54,230 INFO L225 Difference]: With dead ends: 307 [2022-04-28 03:46:54,230 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 03:46:54,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 78 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=487, Invalid=2269, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:46:54,231 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 71 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:54,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 90 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:46:54,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 03:46:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 159. [2022-04-28 03:46:55,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:55,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:55,650 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:55,650 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:55,653 INFO L93 Difference]: Finished difference Result 281 states and 355 transitions. [2022-04-28 03:46:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 355 transitions. [2022-04-28 03:46:55,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:55,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:55,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 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 281 states. [2022-04-28 03:46:55,654 INFO L87 Difference]: Start difference. First operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 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 281 states. [2022-04-28 03:46:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:55,657 INFO L93 Difference]: Finished difference Result 281 states and 355 transitions. [2022-04-28 03:46:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 355 transitions. [2022-04-28 03:46:55,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:55,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:55,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:55,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 154 states have (on average 1.3571428571428572) internal successors, (209), 154 states have internal predecessors, (209), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 213 transitions. [2022-04-28 03:46:55,660 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 213 transitions. Word has length 39 [2022-04-28 03:46:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:55,660 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 213 transitions. [2022-04-28 03:46:55,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:46:55,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 213 transitions. [2022-04-28 03:47:11,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 210 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 213 transitions. [2022-04-28 03:47:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:47:11,237 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:11,237 INFO L195 NwaCegarLoop]: trace histogram [7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:11,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 03:47:11,438 WARN L477 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-28 03:47:11,438 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:11,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:11,438 INFO L85 PathProgramCache]: Analyzing trace with hash -638241519, now seen corresponding path program 20 times [2022-04-28 03:47:11,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:11,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1207794963] [2022-04-28 03:47:11,643 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-28 03:47:11,645 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:11,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1643578992, now seen corresponding path program 1 times [2022-04-28 03:47:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:11,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014876079] [2022-04-28 03:47:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:11,656 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-28 03:47:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:11,674 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-28 03:47:11,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:11,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {28136#(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); {28119#true} is VALID [2022-04-28 03:47:11,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-28 03:47:11,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-28 03:47:11,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {28119#true} call ULTIMATE.init(); {28136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:11,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {28136#(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); {28119#true} is VALID [2022-04-28 03:47:11,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-28 03:47:11,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-28 03:47:11,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {28119#true} call #t~ret15 := main(); {28119#true} is VALID [2022-04-28 03:47:11,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {28119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28119#true} is VALID [2022-04-28 03:47:11,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {28119#true} [149] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_434 4294967296)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse3 (= v_main_~y~0_556 v_main_~y~0_555)) (.cse4 (= v_main_~x~0_434 v_main_~x~0_433))) (or (and (= v_main_~x~0_433 (+ v_main_~x~0_434 (* (- 1) v_main_~y~0_555) v_main_~y~0_556)) (< 0 .cse0) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_434 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~y~0_556 v_it_32 1) v_main_~y~0_555)) (not (<= 1 v_it_32)))) (< v_main_~y~0_556 v_main_~y~0_555)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_556, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_555, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28119#true} is VALID [2022-04-28 03:47:11,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {28119#true} [148] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28119#true} is VALID [2022-04-28 03:47:11,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {28119#true} ~z~0 := ~y~0; {28124#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:47:11,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {28124#(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; {28125#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:47:11,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {28125#(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; {28126#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:47:11,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {28126#(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; {28127#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:47:11,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {28127#(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; {28128#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:47:11,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {28128#(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; {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:47:11,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {28130#(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-28 03:47:11,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {28130#(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; {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:11,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {28131#(<= 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; {28132#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:11,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {28132#(<= 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; {28133#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:11,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {28133#(<= 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; {28134#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:47:11,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {28134#(<= 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; {28135#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {28135#(<= 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; {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {28120#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {28120#false} assume !(~y~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:11,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {28120#false} assume !(~x~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {28120#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {28120#false} assume !(~z~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L272 TraceCheckUtils]: 31: Hoare triple {28120#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {28120#false} ~cond := #in~cond; {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {28120#false} assume 0 == ~cond; {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {28120#false} assume !false; {28120#false} is VALID [2022-04-28 03:47:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 03:47:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:11,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014876079] [2022-04-28 03:47:11,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014876079] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:11,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396450234] [2022-04-28 03:47:11,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:11,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:11,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:11,898 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-28 03:47:11,898 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-28 03:47:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:11,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:47:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:11,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:12,334 INFO L272 TraceCheckUtils]: 0: Hoare triple {28119#true} call ULTIMATE.init(); {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {28119#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); {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {28119#true} call #t~ret15 := main(); {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {28119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {28119#true} [149] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_434 4294967296)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse3 (= v_main_~y~0_556 v_main_~y~0_555)) (.cse4 (= v_main_~x~0_434 v_main_~x~0_433))) (or (and (= v_main_~x~0_433 (+ v_main_~x~0_434 (* (- 1) v_main_~y~0_555) v_main_~y~0_556)) (< 0 .cse0) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_434 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~y~0_556 v_it_32 1) v_main_~y~0_555)) (not (<= 1 v_it_32)))) (< v_main_~y~0_556 v_main_~y~0_555)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_556, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_555, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28119#true} is VALID [2022-04-28 03:47:12,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {28119#true} [148] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28119#true} is VALID [2022-04-28 03:47:12,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {28119#true} ~z~0 := ~y~0; {28124#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:47:12,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {28124#(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; {28125#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:47:12,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {28125#(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; {28126#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:47:12,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {28126#(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; {28127#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:47:12,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {28127#(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; {28128#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:47:12,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {28128#(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; {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:47:12,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {28129#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-28 03:47:12,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:12,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {28131#(<= 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; {28132#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:12,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {28132#(<= 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; {28133#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:12,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {28133#(<= 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; {28134#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:47:12,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {28134#(<= 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; {28135#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {28135#(<= 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; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {28120#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {28120#false} assume !(~y~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 27: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {28120#false} assume !(~x~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:12,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {28120#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28120#false} is VALID [2022-04-28 03:47:12,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {28120#false} assume !(~z~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:12,346 INFO L272 TraceCheckUtils]: 31: Hoare triple {28120#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28120#false} is VALID [2022-04-28 03:47:12,346 INFO L290 TraceCheckUtils]: 32: Hoare triple {28120#false} ~cond := #in~cond; {28120#false} is VALID [2022-04-28 03:47:12,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {28120#false} assume 0 == ~cond; {28120#false} is VALID [2022-04-28 03:47:12,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {28120#false} assume !false; {28120#false} is VALID [2022-04-28 03:47:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 03:47:12,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:13,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {28120#false} assume !false; {28120#false} is VALID [2022-04-28 03:47:13,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {28120#false} assume 0 == ~cond; {28120#false} is VALID [2022-04-28 03:47:13,019 INFO L290 TraceCheckUtils]: 32: Hoare triple {28120#false} ~cond := #in~cond; {28120#false} is VALID [2022-04-28 03:47:13,019 INFO L272 TraceCheckUtils]: 31: Hoare triple {28120#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {28120#false} is VALID [2022-04-28 03:47:13,019 INFO L290 TraceCheckUtils]: 30: Hoare triple {28120#false} assume !(~z~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:13,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {28120#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 28: Hoare triple {28120#false} assume !(~x~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 27: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {28120#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; {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {28120#false} assume !(~y~0 % 4294967296 > 0); {28120#false} is VALID [2022-04-28 03:47:13,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {28120#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28120#false} is VALID [2022-04-28 03:47:13,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {28135#(<= 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; {28120#false} is VALID [2022-04-28 03:47:13,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {28134#(<= 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; {28135#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:47:13,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {28133#(<= 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; {28134#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:47:13,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {28132#(<= 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; {28133#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:13,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {28131#(<= 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; {28132#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:13,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {28131#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:13,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {28303#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {28182#(<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296))} is VALID [2022-04-28 03:47:13,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {28307#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28303#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-28 03:47:13,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {28311#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28307#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-28 03:47:13,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {28315#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28311#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-28 03:47:13,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {28319#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28315#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-28 03:47:13,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {28323#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {28319#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-28 03:47:13,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {28119#true} ~z~0 := ~y~0; {28323#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= (div (+ 5 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 5)) 4294967296)))} is VALID [2022-04-28 03:47:13,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {28119#true} [148] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {28119#true} [149] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_434 4294967296)) (.cse1 (= |v_main_#t~post5_154| |v_main_#t~post5_153|)) (.cse2 (= |v_main_#t~post6_154| |v_main_#t~post6_153|)) (.cse3 (= v_main_~y~0_556 v_main_~y~0_555)) (.cse4 (= v_main_~x~0_434 v_main_~x~0_433))) (or (and (= v_main_~x~0_433 (+ v_main_~x~0_434 (* (- 1) v_main_~y~0_555) v_main_~y~0_556)) (< 0 .cse0) (forall ((v_it_32 Int)) (or (< 0 (mod (+ v_main_~x~0_434 (* 4294967295 v_it_32)) 4294967296)) (not (<= (+ v_main_~y~0_556 v_it_32 1) v_main_~y~0_555)) (not (<= 1 v_it_32)))) (< v_main_~y~0_556 v_main_~y~0_555)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_556, main_#t~post5=|v_main_#t~post5_154|, main_~x~0=v_main_~x~0_434, main_#t~post6=|v_main_#t~post6_154|} OutVars{main_~y~0=v_main_~y~0_555, main_#t~post5=|v_main_#t~post5_153|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_153|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {28119#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {28119#true} call #t~ret15 := main(); {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28119#true} {28119#true} #83#return; {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {28119#true} assume true; {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {28119#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); {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {28119#true} call ULTIMATE.init(); {28119#true} is VALID [2022-04-28 03:47:13,032 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-04-28 03:47:13,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396450234] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:13,033 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:13,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2022-04-28 03:47:13,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:13,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1207794963] [2022-04-28 03:47:13,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1207794963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:13,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:13,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:47:13,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160304498] [2022-04-28 03:47:13,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:13,411 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 39 [2022-04-28 03:47:13,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:13,412 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-28 03:47:13,444 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-28 03:47:13,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:47:13,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:13,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:47:13,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=622, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:47:13,445 INFO L87 Difference]: Start difference. First operand 159 states and 213 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-28 03:47:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:21,599 INFO L93 Difference]: Finished difference Result 271 states and 335 transitions. [2022-04-28 03:47:21,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:47:21,599 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 39 [2022-04-28 03:47:21,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:21,600 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-28 03:47:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2022-04-28 03:47:21,600 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-28 03:47:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 73 transitions. [2022-04-28 03:47:21,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 73 transitions. [2022-04-28 03:47:21,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:21,730 INFO L225 Difference]: With dead ends: 271 [2022-04-28 03:47:21,730 INFO L226 Difference]: Without dead ends: 236 [2022-04-28 03:47:21,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=264, Invalid=2088, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:47:21,731 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 48 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:21,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 87 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:47:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-28 03:47:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 156. [2022-04-28 03:47:23,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:23,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:23,141 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:23,141 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:23,143 INFO L93 Difference]: Finished difference Result 236 states and 296 transitions. [2022-04-28 03:47:23,143 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2022-04-28 03:47:23,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:23,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:23,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 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 236 states. [2022-04-28 03:47:23,144 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 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 236 states. [2022-04-28 03:47:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:23,147 INFO L93 Difference]: Finished difference Result 236 states and 296 transitions. [2022-04-28 03:47:23,147 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 296 transitions. [2022-04-28 03:47:23,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:23,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:23,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:23,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:23,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.3377483443708609) internal successors, (202), 151 states have internal predecessors, (202), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:23,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 206 transitions. [2022-04-28 03:47:23,149 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 206 transitions. Word has length 39 [2022-04-28 03:47:23,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:23,149 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 206 transitions. [2022-04-28 03:47:23,149 INFO L496 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-28 03:47:23,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 206 transitions. [2022-04-28 03:47:39,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 202 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 206 transitions. [2022-04-28 03:47:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:47:39,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:39,049 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:39,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:47:39,249 WARN L477 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-28 03:47:39,250 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:39,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:39,250 INFO L85 PathProgramCache]: Analyzing trace with hash -274625873, now seen corresponding path program 9 times [2022-04-28 03:47:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:39,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320479033] [2022-04-28 03:47:39,441 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-28 03:47:39,442 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1411042354, now seen corresponding path program 1 times [2022-04-28 03:47:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:39,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531810371] [2022-04-28 03:47:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:39,456 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-28 03:47:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,484 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-28 03:47:39,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {29746#(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); {29730#true} is VALID [2022-04-28 03:47:39,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-28 03:47:39,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-28 03:47:39,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {29730#true} call ULTIMATE.init(); {29746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:39,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {29746#(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); {29730#true} is VALID [2022-04-28 03:47:39,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-28 03:47:39,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-28 03:47:39,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {29730#true} call #t~ret15 := main(); {29730#true} is VALID [2022-04-28 03:47:39,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {29730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29730#true} is VALID [2022-04-28 03:47:39,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {29730#true} [151] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_455 4294967296)) (.cse1 (= v_main_~y~0_586 v_main_~y~0_585)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~x~0_455 v_main_~x~0_454))) (or (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~x~0_454 v_it_33 1) v_main_~x~0_455)) (< 0 (mod (+ v_main_~x~0_455 (* 4294967295 v_it_33)) 4294967296)))) (< v_main_~x~0_454 v_main_~x~0_455) (< 0 .cse0) (= v_main_~y~0_585 (+ v_main_~x~0_455 v_main_~y~0_586 (* v_main_~x~0_454 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_586, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_455, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29730#true} is VALID [2022-04-28 03:47:39,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {29730#true} [150] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29735#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:39,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {29735#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {29735#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:39,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {29735#(<= 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; {29736#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:47:39,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {29736#(<= 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; {29737#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {29737#(<= 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; {29738#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {29738#(<= 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; {29739#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {29739#(<= 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; {29740#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:47:39,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {29740#(<= 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; {29741#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {29741#(<= 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; {29742#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {29742#(<= 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; {29743#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {29743#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~z~0 % 4294967296 > 0); {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {29744#(<= 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; {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} assume !(~y~0 % 4294967296 > 0); {29744#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:47:39,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {29744#(<= 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; {29745#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:47:39,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {29745#(<= (+ 8 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-28 03:47:39,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {29731#false} assume !(~z~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-28 03:47:39,693 INFO L272 TraceCheckUtils]: 31: Hoare triple {29731#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29731#false} is VALID [2022-04-28 03:47:39,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {29731#false} ~cond := #in~cond; {29731#false} is VALID [2022-04-28 03:47:39,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {29731#false} assume 0 == ~cond; {29731#false} is VALID [2022-04-28 03:47:39,693 INFO L290 TraceCheckUtils]: 34: Hoare triple {29731#false} assume !false; {29731#false} is VALID [2022-04-28 03:47:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 03:47:39,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:39,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531810371] [2022-04-28 03:47:39,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531810371] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:39,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725675526] [2022-04-28 03:47:39,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:39,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:39,695 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-28 03:47:39,696 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-28 03:47:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 03:47:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:40,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {29730#true} call ULTIMATE.init(); {29730#true} is VALID [2022-04-28 03:47:40,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {29730#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); {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {29730#true} call #t~ret15 := main(); {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {29730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {29730#true} [151] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_455 4294967296)) (.cse1 (= v_main_~y~0_586 v_main_~y~0_585)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~x~0_455 v_main_~x~0_454))) (or (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~x~0_454 v_it_33 1) v_main_~x~0_455)) (< 0 (mod (+ v_main_~x~0_455 (* 4294967295 v_it_33)) 4294967296)))) (< v_main_~x~0_454 v_main_~x~0_455) (< 0 .cse0) (= v_main_~y~0_585 (+ v_main_~x~0_455 v_main_~y~0_586 (* v_main_~x~0_454 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_586, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_455, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {29730#true} [150] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29730#true} is VALID [2022-04-28 03:47:40,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {29730#true} ~z~0 := ~y~0; {29774#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:40,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {29774#(= 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; {29778#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:47:40,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {29778#(= 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; {29782#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-28 03:47:40,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {29782#(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; {29786#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {29786#(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; {29790#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {29790#(and (= (+ main_~y~0 (- 3)) (+ 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; {29794#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 03:47:40,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {29794#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ 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; {29798#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {29798#(and (= (+ main_~y~0 (- 5)) (+ 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; {29802#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-28 03:47:40,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {29802#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ 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; {29806#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-28 03:47:40,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {29806#(and (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~y~0 (- 6)) (+ 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; {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:47:40,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {29810#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 3)) (< 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; {29817#(and (= (+ main_~z~0 8) (+ main_~y~0 1)) (< 0 (mod (+ 7 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:47:40,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {29817#(and (= (+ main_~z~0 8) (+ main_~y~0 1)) (< 0 (mod (+ 7 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; {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:47:40,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {29821#(< 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; {29825#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:40,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {29825#(< 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; {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:47:40,398 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(< 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; {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:47:40,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {29833#(< 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; {29837#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:47:40,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {29837#(< 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; {29841#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:47:40,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {29841#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,400 INFO L290 TraceCheckUtils]: 27: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {29845#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-28 03:47:40,401 INFO L272 TraceCheckUtils]: 31: Hoare triple {29731#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29731#false} is VALID [2022-04-28 03:47:40,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {29731#false} ~cond := #in~cond; {29731#false} is VALID [2022-04-28 03:47:40,402 INFO L290 TraceCheckUtils]: 33: Hoare triple {29731#false} assume 0 == ~cond; {29731#false} is VALID [2022-04-28 03:47:40,402 INFO L290 TraceCheckUtils]: 34: Hoare triple {29731#false} assume !false; {29731#false} is VALID [2022-04-28 03:47:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:47:40,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:40,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {29731#false} assume !false; {29731#false} is VALID [2022-04-28 03:47:40,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {29731#false} assume 0 == ~cond; {29731#false} is VALID [2022-04-28 03:47:40,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {29731#false} ~cond := #in~cond; {29731#false} is VALID [2022-04-28 03:47:40,602 INFO L272 TraceCheckUtils]: 31: Hoare triple {29731#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {29731#false} is VALID [2022-04-28 03:47:40,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {29731#false} is VALID [2022-04-28 03:47:40,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {29845#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,603 INFO L290 TraceCheckUtils]: 27: Hoare triple {29845#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,604 INFO L290 TraceCheckUtils]: 26: Hoare triple {29841#(< 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; {29845#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:47:40,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {29837#(< 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; {29841#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:47:40,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {29833#(< 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; {29837#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:47:40,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {29829#(< 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; {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:47:40,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {29825#(< 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; {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:47:40,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {29821#(< 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; {29825#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:40,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {29912#(< 0 (mod (+ 7 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; {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:47:40,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29912#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:40,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} assume !(~z~0 % 4294967296 > 0); {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 03:47:40,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {29912#(< 0 (mod (+ 7 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; {29916#(< 0 (mod (+ main_~z~0 8) 4294967296))} is VALID [2022-04-28 03:47:40,610 INFO L290 TraceCheckUtils]: 16: Hoare triple {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29912#(< 0 (mod (+ 7 main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:40,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {29825#(< 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; {29821#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:47:40,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {29829#(< 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; {29825#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:47:40,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {29833#(< 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; {29829#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:47:40,613 INFO L290 TraceCheckUtils]: 12: Hoare triple {29837#(< 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; {29833#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:47:40,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {29841#(< 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; {29837#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:47:40,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {29730#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; {29841#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:47:40,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {29730#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; {29730#true} is VALID [2022-04-28 03:47:40,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {29730#true} ~z~0 := ~y~0; {29730#true} is VALID [2022-04-28 03:47:40,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {29730#true} [150] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {29730#true} is VALID [2022-04-28 03:47:40,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {29730#true} [151] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_455 4294967296)) (.cse1 (= v_main_~y~0_586 v_main_~y~0_585)) (.cse2 (= |v_main_#t~post6_159| |v_main_#t~post6_158|)) (.cse3 (= |v_main_#t~post5_159| |v_main_#t~post5_158|)) (.cse4 (= v_main_~x~0_455 v_main_~x~0_454))) (or (and (forall ((v_it_33 Int)) (or (not (<= 1 v_it_33)) (not (<= (+ v_main_~x~0_454 v_it_33 1) v_main_~x~0_455)) (< 0 (mod (+ v_main_~x~0_455 (* 4294967295 v_it_33)) 4294967296)))) (< v_main_~x~0_454 v_main_~x~0_455) (< 0 .cse0) (= v_main_~y~0_585 (+ v_main_~x~0_455 v_main_~y~0_586 (* v_main_~x~0_454 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_586, main_#t~post5=|v_main_#t~post5_159|, main_~x~0=v_main_~x~0_455, main_#t~post6=|v_main_#t~post6_159|} OutVars{main_~y~0=v_main_~y~0_585, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_454, main_#t~post6=|v_main_#t~post6_158|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29730#true} is VALID [2022-04-28 03:47:40,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {29730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29730#true} is VALID [2022-04-28 03:47:40,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {29730#true} call #t~ret15 := main(); {29730#true} is VALID [2022-04-28 03:47:40,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29730#true} {29730#true} #83#return; {29730#true} is VALID [2022-04-28 03:47:40,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {29730#true} assume true; {29730#true} is VALID [2022-04-28 03:47:40,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {29730#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); {29730#true} is VALID [2022-04-28 03:47:40,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {29730#true} call ULTIMATE.init(); {29730#true} is VALID [2022-04-28 03:47:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 16 proven. 64 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:47:40,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725675526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:40,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:40,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20, 11] total 34 [2022-04-28 03:47:41,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:41,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320479033] [2022-04-28 03:47:41,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320479033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:41,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:41,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:47:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739501859] [2022-04-28 03:47:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 39 [2022-04-28 03:47:41,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:41,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 03:47:41,174 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-28 03:47:41,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:47:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:41,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:47:41,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:47:41,176 INFO L87 Difference]: Start difference. First operand 156 states and 206 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 03:47:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:47,635 INFO L93 Difference]: Finished difference Result 327 states and 480 transitions. [2022-04-28 03:47:47,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:47:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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 39 [2022-04-28 03:47:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 03:47:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 119 transitions. [2022-04-28 03:47:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 03:47:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 119 transitions. [2022-04-28 03:47:47,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 119 transitions. [2022-04-28 03:47:47,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:47,902 INFO L225 Difference]: With dead ends: 327 [2022-04-28 03:47:47,902 INFO L226 Difference]: Without dead ends: 301 [2022-04-28 03:47:47,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=409, Invalid=3131, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:47:47,903 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 144 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:47,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 56 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:47:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-04-28 03:47:49,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 170. [2022-04-28 03:47:49,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:49,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 301 states. Second operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,458 INFO L74 IsIncluded]: Start isIncluded. First operand 301 states. Second operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,458 INFO L87 Difference]: Start difference. First operand 301 states. Second operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:49,462 INFO L93 Difference]: Finished difference Result 301 states and 406 transitions. [2022-04-28 03:47:49,462 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 406 transitions. [2022-04-28 03:47:49,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:49,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:49,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 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 301 states. [2022-04-28 03:47:49,463 INFO L87 Difference]: Start difference. First operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 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 301 states. [2022-04-28 03:47:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:49,466 INFO L93 Difference]: Finished difference Result 301 states and 406 transitions. [2022-04-28 03:47:49,466 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 406 transitions. [2022-04-28 03:47:49,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:49,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:49,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:49,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 165 states have (on average 1.3393939393939394) internal successors, (221), 165 states have internal predecessors, (221), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:47:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 225 transitions. [2022-04-28 03:47:49,469 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 225 transitions. Word has length 39 [2022-04-28 03:47:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:49,469 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 225 transitions. [2022-04-28 03:47:49,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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-28 03:47:49,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 225 transitions. [2022-04-28 03:48:08,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 222 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 225 transitions. [2022-04-28 03:48:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:48:08,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:08,956 INFO L195 NwaCegarLoop]: trace histogram [10, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:08,973 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-28 03:48:09,156 WARN L477 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-28 03:48:09,156 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:09,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1395085053, now seen corresponding path program 10 times [2022-04-28 03:48:09,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:09,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [697577273] [2022-04-28 03:48:13,574 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:13,669 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-28 03:48:13,670 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:13,672 INFO L85 PathProgramCache]: Analyzing trace with hash -855421948, now seen corresponding path program 1 times [2022-04-28 03:48:13,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:13,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550407487] [2022-04-28 03:48:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:13,682 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-28 03:48:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:13,708 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_34.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:13,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {31636#(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); {31619#true} is VALID [2022-04-28 03:48:13,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 03:48:13,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-28 03:48:13,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:13,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {31636#(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); {31619#true} is VALID [2022-04-28 03:48:13,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 03:48:13,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-28 03:48:13,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret15 := main(); {31619#true} is VALID [2022-04-28 03:48:13,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31619#true} is VALID [2022-04-28 03:48:13,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} [153] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~x~0_475 v_main_~x~0_474)) (.cse3 (= v_main_~y~0_608 v_main_~y~0_607)) (.cse4 (mod v_main_~x~0_475 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_474 v_main_~x~0_475) (= (+ v_main_~x~0_475 (* v_main_~x~0_474 (- 1)) v_main_~y~0_608) v_main_~y~0_607) (< 0 .cse4) (forall ((v_it_34 Int)) (or (< 0 (mod (+ v_main_~x~0_475 (* 4294967295 v_it_34)) 4294967296)) (not (<= 1 v_it_34)) (not (<= (+ v_main_~x~0_474 v_it_34 1) v_main_~x~0_475))))))) InVars {main_~y~0=v_main_~y~0_608, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_607, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_474, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31619#true} is VALID [2022-04-28 03:48:13,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} [152] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {31624#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:13,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {31624#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {31624#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:13,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {31624#(<= 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; {31625#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:13,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {31625#(<= 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; {31626#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:13,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {31626#(<= 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; {31627#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:13,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {31627#(<= 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; {31628#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:13,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {31628#(<= 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; {31629#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:48:13,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {31629#(<= 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; {31630#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:13,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {31630#(<= 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; {31631#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:13,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {31631#(<= 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; {31632#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:13,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {31632#(<= 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; {31633#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:48:13,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {31633#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~z~0 % 4294967296 > 0); {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {31634#(<= 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; {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} assume !(~y~0 % 4294967296 > 0); {31634#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:48:13,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {31634#(<= 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; {31635#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:48:13,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {31635#(<= (+ 9 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:13,957 INFO L290 TraceCheckUtils]: 31: Hoare triple {31620#false} assume !(~z~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:13,957 INFO L272 TraceCheckUtils]: 32: Hoare triple {31620#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31620#false} is VALID [2022-04-28 03:48:13,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-28 03:48:13,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-28 03:48:13,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-28 03:48:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 03:48:13,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:13,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550407487] [2022-04-28 03:48:13,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550407487] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:13,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748227985] [2022-04-28 03:48:13,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:13,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:13,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:13,959 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-28 03:48:13,991 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-28 03:48:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:14,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:48:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:14,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:14,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#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); {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret15 := main(); {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} [153] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~x~0_475 v_main_~x~0_474)) (.cse3 (= v_main_~y~0_608 v_main_~y~0_607)) (.cse4 (mod v_main_~x~0_475 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_474 v_main_~x~0_475) (= (+ v_main_~x~0_475 (* v_main_~x~0_474 (- 1)) v_main_~y~0_608) v_main_~y~0_607) (< 0 .cse4) (forall ((v_it_34 Int)) (or (< 0 (mod (+ v_main_~x~0_475 (* 4294967295 v_it_34)) 4294967296)) (not (<= 1 v_it_34)) (not (<= (+ v_main_~x~0_474 v_it_34 1) v_main_~x~0_475))))))) InVars {main_~y~0=v_main_~y~0_608, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_607, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_474, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} [152] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {31619#true} is VALID [2022-04-28 03:48:14,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} ~z~0 := ~y~0; {31664#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:14,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {31664#(= 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; {31668#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:48:14,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {31668#(= 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; {31672#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:14,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {31672#(= (+ 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; {31676#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:14,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {31676#(= (+ 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; {31680#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:14,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {31680#(= (+ 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; {31684#(= (+ (- 1) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-28 03:48:14,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {31684#(= (+ (- 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; {31688#(= (+ 5 main_~z~0) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:14,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {31688#(= (+ 5 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; {31692#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:48:14,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {31692#(= (+ 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; {31696#(= (+ main_~y~0 (- 6)) (+ main_~z~0 2))} is VALID [2022-04-28 03:48:14,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {31696#(= (+ main_~y~0 (- 6)) (+ 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; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:14,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {31700#(< 0 (mod (+ 4294967288 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; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:14,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:14,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {31700#(< 0 (mod (+ 4294967288 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; {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 03:48:14,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31714#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:14,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {31714#(< 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; {31718#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:14,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {31718#(< 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; {31722#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:14,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {31722#(< 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; {31726#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:48:14,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {31726#(< 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; {31730#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:48:14,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {31730#(< 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; {31734#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:14,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {31734#(< 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; {31738#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {31738#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {31620#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; {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 30: Hoare triple {31620#false} assume !(~x~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 31: Hoare triple {31620#false} assume !(~z~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L272 TraceCheckUtils]: 32: Hoare triple {31620#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L290 TraceCheckUtils]: 35: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-28 03:48:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:14,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:15,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {31620#false} assume !false; {31620#false} is VALID [2022-04-28 03:48:15,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {31620#false} assume 0 == ~cond; {31620#false} is VALID [2022-04-28 03:48:15,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {31620#false} ~cond := #in~cond; {31620#false} is VALID [2022-04-28 03:48:15,273 INFO L272 TraceCheckUtils]: 32: Hoare triple {31620#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {31620#false} is VALID [2022-04-28 03:48:15,274 INFO L290 TraceCheckUtils]: 31: Hoare triple {31620#false} assume !(~z~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:15,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {31620#false} assume !(~x~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:15,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {31620#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; {31620#false} is VALID [2022-04-28 03:48:15,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {31738#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {31620#false} is VALID [2022-04-28 03:48:15,275 INFO L290 TraceCheckUtils]: 27: Hoare triple {31734#(< 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; {31738#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:48:15,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {31730#(< 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; {31734#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:15,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {31726#(< 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; {31730#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:48:15,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {31722#(< 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; {31726#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:48:15,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {31718#(< 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; {31722#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:15,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {31714#(< 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; {31718#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:15,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31714#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:15,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {31700#(< 0 (mod (+ 4294967288 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; {31710#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 03:48:15,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:15,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {31700#(< 0 (mod (+ 4294967288 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; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:15,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {31817#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 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; {31700#(< 0 (mod (+ 4294967288 main_~y~0) 4294967296))} is VALID [2022-04-28 03:48:15,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {31821#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 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; {31817#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {31825#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 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; {31821#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {31829#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 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; {31825#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {31833#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 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; {31829#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {31837#(or (< 0 (mod (+ 4294967288 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; {31833#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {31841#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 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; {31837#(or (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:15,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {31845#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 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; {31841#(or (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {31849#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 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; {31845#(or (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {31619#true} ~z~0 := ~y~0; {31849#(or (not (< 0 (mod (+ 4294967288 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:48:15,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {31619#true} [152] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {31619#true} [153] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_164| |v_main_#t~post5_163|)) (.cse1 (= |v_main_#t~post6_164| |v_main_#t~post6_163|)) (.cse2 (= v_main_~x~0_475 v_main_~x~0_474)) (.cse3 (= v_main_~y~0_608 v_main_~y~0_607)) (.cse4 (mod v_main_~x~0_475 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_474 v_main_~x~0_475) (= (+ v_main_~x~0_475 (* v_main_~x~0_474 (- 1)) v_main_~y~0_608) v_main_~y~0_607) (< 0 .cse4) (forall ((v_it_34 Int)) (or (< 0 (mod (+ v_main_~x~0_475 (* 4294967295 v_it_34)) 4294967296)) (not (<= 1 v_it_34)) (not (<= (+ v_main_~x~0_474 v_it_34 1) v_main_~x~0_475))))))) InVars {main_~y~0=v_main_~y~0_608, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_475, main_#t~post6=|v_main_#t~post6_164|} OutVars{main_~y~0=v_main_~y~0_607, main_#t~post5=|v_main_#t~post5_163|, main_~x~0=v_main_~x~0_474, main_#t~post6=|v_main_#t~post6_163|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {31619#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {31619#true} call #t~ret15 := main(); {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31619#true} {31619#true} #83#return; {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {31619#true} assume true; {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {31619#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); {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {31619#true} call ULTIMATE.init(); {31619#true} is VALID [2022-04-28 03:48:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:15,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748227985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:15,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:15,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 20] total 42 [2022-04-28 03:48:15,986 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:15,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [697577273] [2022-04-28 03:48:15,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [697577273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:15,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:15,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:48:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533628785] [2022-04-28 03:48:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:15,987 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 40 [2022-04-28 03:48:15,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:15,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-28 03:48:16,038 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-28 03:48:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:48:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:48:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1986, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:48:16,039 INFO L87 Difference]: Start difference. First operand 170 states and 225 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-28 03:48:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:23,775 INFO L93 Difference]: Finished difference Result 345 states and 507 transitions. [2022-04-28 03:48:23,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:48:23,775 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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 40 [2022-04-28 03:48:23,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-28 03:48:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 125 transitions. [2022-04-28 03:48:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-28 03:48:23,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 125 transitions. [2022-04-28 03:48:23,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 125 transitions. [2022-04-28 03:48:23,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:24,001 INFO L225 Difference]: With dead ends: 345 [2022-04-28 03:48:24,001 INFO L226 Difference]: Without dead ends: 319 [2022-04-28 03:48:24,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=453, Invalid=4239, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:48:24,002 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 200 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:24,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 49 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:48:24,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-04-28 03:48:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 184. [2022-04-28 03:48:25,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:25,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 319 states. Second operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:25,736 INFO L74 IsIncluded]: Start isIncluded. First operand 319 states. Second operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:25,736 INFO L87 Difference]: Start difference. First operand 319 states. Second operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:25,740 INFO L93 Difference]: Finished difference Result 319 states and 429 transitions. [2022-04-28 03:48:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2022-04-28 03:48:25,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:25,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:25,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 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 319 states. [2022-04-28 03:48:25,741 INFO L87 Difference]: Start difference. First operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 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 319 states. [2022-04-28 03:48:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:25,745 INFO L93 Difference]: Finished difference Result 319 states and 429 transitions. [2022-04-28 03:48:25,745 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 429 transitions. [2022-04-28 03:48:25,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:25,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:25,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:25,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 179 states have internal predecessors, (240), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:25,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2022-04-28 03:48:25,748 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 40 [2022-04-28 03:48:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:25,748 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2022-04-28 03:48:25,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 19 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-28 03:48:25,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 244 transitions. [2022-04-28 03:48:45,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 240 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2022-04-28 03:48:45,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:48:45,153 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:45,153 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:45,170 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-28 03:48:45,370 WARN L477 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-28 03:48:45,370 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:45,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:45,371 INFO L85 PathProgramCache]: Analyzing trace with hash -264974095, now seen corresponding path program 21 times [2022-04-28 03:48:45,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:45,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280469229] [2022-04-28 03:48:47,787 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-28 03:48:47,788 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:47,790 INFO L85 PathProgramCache]: Analyzing trace with hash 8945104, now seen corresponding path program 1 times [2022-04-28 03:48:47,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:47,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699554284] [2022-04-28 03:48:47,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:47,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:47,809 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-28 03:48:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:47,846 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-28 03:48:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:47,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {33637#(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); {33624#true} is VALID [2022-04-28 03:48:47,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-28 03:48:47,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-28 03:48:47,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {33624#true} call ULTIMATE.init(); {33637#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:47,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {33637#(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); {33624#true} is VALID [2022-04-28 03:48:47,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {33624#true} call #t~ret15 := main(); {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {33624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {33624#true} [155] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_636 v_main_~y~0_635)) (.cse1 (= |v_main_#t~post6_169| |v_main_#t~post6_168|)) (.cse2 (= |v_main_#t~post5_169| |v_main_#t~post5_168|)) (.cse4 (mod v_main_~x~0_497 4294967296)) (.cse3 (= v_main_~x~0_497 v_main_~x~0_496))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_496 v_it_35 1) v_main_~x~0_497)) (not (<= 1 v_it_35)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_35)) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_635 (+ v_main_~x~0_497 v_main_~y~0_636 (* v_main_~x~0_496 (- 1)))) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_636, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_169|} OutVars{main_~y~0=v_main_~y~0_635, main_#t~post5=|v_main_#t~post5_168|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_168|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {33624#true} [154] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {33624#true} ~z~0 := ~y~0; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#true} assume !(~z~0 % 4294967296 > 0); {33624#true} is VALID [2022-04-28 03:48:47,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:47,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {33624#true} assume !(~y~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:47,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {33629#(<= 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; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:47,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {33630#(<= 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; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (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; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,987 INFO L290 TraceCheckUtils]: 24: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (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; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:47,992 INFO L290 TraceCheckUtils]: 30: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:47,993 INFO L290 TraceCheckUtils]: 31: Hoare triple {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:47,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:47,994 INFO L272 TraceCheckUtils]: 33: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {33635#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:48:47,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {33635#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33636#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:48:47,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {33636#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33625#false} is VALID [2022-04-28 03:48:47,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {33625#false} assume !false; {33625#false} is VALID [2022-04-28 03:48:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 03:48:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:47,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699554284] [2022-04-28 03:48:47,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699554284] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:47,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542500147] [2022-04-28 03:48:47,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:47,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:47,997 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-28 03:48:47,997 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-28 03:48:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:48,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:48:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:48,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:48,300 INFO L272 TraceCheckUtils]: 0: Hoare triple {33624#true} call ULTIMATE.init(); {33624#true} is VALID [2022-04-28 03:48:48,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#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); {33624#true} is VALID [2022-04-28 03:48:48,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {33624#true} call #t~ret15 := main(); {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {33624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {33624#true} [155] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_636 v_main_~y~0_635)) (.cse1 (= |v_main_#t~post6_169| |v_main_#t~post6_168|)) (.cse2 (= |v_main_#t~post5_169| |v_main_#t~post5_168|)) (.cse4 (mod v_main_~x~0_497 4294967296)) (.cse3 (= v_main_~x~0_497 v_main_~x~0_496))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_496 v_it_35 1) v_main_~x~0_497)) (not (<= 1 v_it_35)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_35)) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_635 (+ v_main_~x~0_497 v_main_~y~0_636 (* v_main_~x~0_496 (- 1)))) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_636, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_169|} OutVars{main_~y~0=v_main_~y~0_635, main_#t~post5=|v_main_#t~post5_168|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_168|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {33624#true} [154] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {33624#true} ~z~0 := ~y~0; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#true} assume !(~z~0 % 4294967296 > 0); {33624#true} is VALID [2022-04-28 03:48:48,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {33624#true} assume !(~y~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:48,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {33629#(<= 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; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:48,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {33630#(<= 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; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (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; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (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; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:48,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:48,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:48,313 INFO L272 TraceCheckUtils]: 33: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:48:48,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33744#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:48:48,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {33744#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33625#false} is VALID [2022-04-28 03:48:48,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {33625#false} assume !false; {33625#false} is VALID [2022-04-28 03:48:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 03:48:48,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:48,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {33625#false} assume !false; {33625#false} is VALID [2022-04-28 03:48:48,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {33744#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {33625#false} is VALID [2022-04-28 03:48:48,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {33744#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:48:48,473 INFO L272 TraceCheckUtils]: 33: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {33740#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:48:48,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:48,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:48,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:48,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {33634#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {33632#(<= main_~y~0 (+ 3 (* (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; {33633#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {33631#(<= main_~y~0 (+ 2 (* (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; {33632#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,483 INFO L290 TraceCheckUtils]: 22: Hoare triple {33630#(<= 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; {33631#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:48,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {33629#(<= 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; {33630#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:48,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {33624#true} assume !(~y~0 % 4294967296 > 0); {33629#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:48,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {33624#true} assume !(~z~0 % 4294967296 > 0); {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {33624#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; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {33624#true} ~z~0 := ~y~0; {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {33624#true} [154] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {33624#true} [155] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_636 v_main_~y~0_635)) (.cse1 (= |v_main_#t~post6_169| |v_main_#t~post6_168|)) (.cse2 (= |v_main_#t~post5_169| |v_main_#t~post5_168|)) (.cse4 (mod v_main_~x~0_497 4294967296)) (.cse3 (= v_main_~x~0_497 v_main_~x~0_496))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_35 Int)) (or (not (<= (+ v_main_~x~0_496 v_it_35 1) v_main_~x~0_497)) (not (<= 1 v_it_35)) (< 0 (mod (+ v_main_~x~0_497 (* 4294967295 v_it_35)) 4294967296)))) (< 0 .cse4) (= v_main_~y~0_635 (+ v_main_~x~0_497 v_main_~y~0_636 (* v_main_~x~0_496 (- 1)))) (< v_main_~x~0_496 v_main_~x~0_497)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_636, main_#t~post5=|v_main_#t~post5_169|, main_~x~0=v_main_~x~0_497, main_#t~post6=|v_main_#t~post6_169|} OutVars{main_~y~0=v_main_~y~0_635, main_#t~post5=|v_main_#t~post5_168|, main_~x~0=v_main_~x~0_496, main_#t~post6=|v_main_#t~post6_168|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33624#true} is VALID [2022-04-28 03:48:48,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {33624#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33624#true} is VALID [2022-04-28 03:48:48,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {33624#true} call #t~ret15 := main(); {33624#true} is VALID [2022-04-28 03:48:48,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33624#true} {33624#true} #83#return; {33624#true} is VALID [2022-04-28 03:48:48,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {33624#true} assume true; {33624#true} is VALID [2022-04-28 03:48:48,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {33624#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); {33624#true} is VALID [2022-04-28 03:48:48,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {33624#true} call ULTIMATE.init(); {33624#true} is VALID [2022-04-28 03:48:48,486 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-04-28 03:48:48,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542500147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:48,486 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:48,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2022-04-28 03:48:48,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280469229] [2022-04-28 03:48:48,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280469229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:48,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:48,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:48:48,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962415611] [2022-04-28 03:48:48,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:48,769 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 41 [2022-04-28 03:48:48,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:48,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 03:48:48,845 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-28 03:48:48,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:48:48,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:48,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:48:48,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:48:48,846 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 03:48:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:58,003 INFO L93 Difference]: Finished difference Result 503 states and 642 transitions. [2022-04-28 03:48:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:48:58,003 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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 41 [2022-04-28 03:48:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 03:48:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2022-04-28 03:48:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 03:48:58,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2022-04-28 03:48:58,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 90 transitions. [2022-04-28 03:48:58,247 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-28 03:48:58,252 INFO L225 Difference]: With dead ends: 503 [2022-04-28 03:48:58,252 INFO L226 Difference]: Without dead ends: 384 [2022-04-28 03:48:58,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=303, Invalid=1677, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:48:58,253 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:58,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 74 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:48:58,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-04-28 03:49:00,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 250. [2022-04-28 03:49:00,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:00,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 384 states. Second operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:00,687 INFO L74 IsIncluded]: Start isIncluded. First operand 384 states. Second operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:00,687 INFO L87 Difference]: Start difference. First operand 384 states. Second operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:00,692 INFO L93 Difference]: Finished difference Result 384 states and 474 transitions. [2022-04-28 03:49:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 474 transitions. [2022-04-28 03:49:00,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:00,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:00,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 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-28 03:49:00,693 INFO L87 Difference]: Start difference. First operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 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-28 03:49:00,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:00,698 INFO L93 Difference]: Finished difference Result 384 states and 474 transitions. [2022-04-28 03:49:00,698 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 474 transitions. [2022-04-28 03:49:00,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:00,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:00,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:00,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 245 states have (on average 1.3306122448979592) internal successors, (326), 245 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 330 transitions. [2022-04-28 03:49:00,702 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 330 transitions. Word has length 41 [2022-04-28 03:49:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:00,702 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 330 transitions. [2022-04-28 03:49:00,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 14 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-28 03:49:00,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 330 transitions. [2022-04-28 03:49:25,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 325 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:25,713 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 330 transitions. [2022-04-28 03:49:25,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:49:25,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:25,713 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:25,730 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-28 03:49:25,914 WARN L477 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-28 03:49:25,914 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:25,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:25,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1853630146, now seen corresponding path program 22 times [2022-04-28 03:49:25,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:25,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [232911385] [2022-04-28 03:49:28,115 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-28 03:49:28,116 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:28,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1409460274, now seen corresponding path program 1 times [2022-04-28 03:49:28,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:28,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088029735] [2022-04-28 03:49:28,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:28,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:28,129 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-28 03:49:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:28,148 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_36.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:28,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:28,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {36216#(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); {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {36197#true} call ULTIMATE.init(); {36216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:28,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {36216#(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); {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {36197#true} call #t~ret15 := main(); {36197#true} is VALID [2022-04-28 03:49:28,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {36197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36197#true} is VALID [2022-04-28 03:49:28,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {36197#true} [157] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_513 4294967296)) (.cse1 (= |v_main_#t~post5_174| |v_main_#t~post5_173|)) (.cse2 (= v_main_~y~0_671 v_main_~y~0_670)) (.cse3 (= v_main_~x~0_513 v_main_~x~0_512)) (.cse4 (= |v_main_#t~post6_174| |v_main_#t~post6_173|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_513 (* 4294967295 v_it_36)) 4294967296)) (not (<= (+ v_main_~y~0_671 v_it_36 1) v_main_~y~0_670)) (not (<= 1 v_it_36)))) (= v_main_~x~0_512 (+ v_main_~x~0_513 v_main_~y~0_671 (* (- 1) v_main_~y~0_670))) (< v_main_~y~0_671 v_main_~y~0_670)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_513, main_#t~post6=|v_main_#t~post6_174|} OutVars{main_~y~0=v_main_~y~0_670, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_512, main_#t~post6=|v_main_#t~post6_173|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36197#true} is VALID [2022-04-28 03:49:28,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {36197#true} [156] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {36197#true} is VALID [2022-04-28 03:49:28,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {36197#true} ~z~0 := ~y~0; {36202#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:49:28,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {36202#(= (+ 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; {36203#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:49:28,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {36203#(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; {36204#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:49:28,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {36204#(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; {36205#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:49:28,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {36205#(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; {36206#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:49:28,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {36206#(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; {36207#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:49:28,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {36207#(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; {36208#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:49:28,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {36208#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {36209#(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-28 03:49:28,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {36209#(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; {36210#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:28,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {36210#(<= 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; {36211#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:28,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {36211#(<= 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; {36212#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:28,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {36212#(<= 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; {36213#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:49:28,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {36213#(<= 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; {36214#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:49:28,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {36214#(<= 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; {36215#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {36215#(<= 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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {36198#false} assume !(~y~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {36198#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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {36198#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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {36198#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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {36198#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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {36198#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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {36198#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; {36198#false} is VALID [2022-04-28 03:49:28,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {36198#false} assume !(~x~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-28 03:49:28,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {36198#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36198#false} is VALID [2022-04-28 03:49:28,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {36198#false} assume !(~z~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-28 03:49:28,413 INFO L272 TraceCheckUtils]: 33: Hoare triple {36198#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36198#false} is VALID [2022-04-28 03:49:28,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {36198#false} ~cond := #in~cond; {36198#false} is VALID [2022-04-28 03:49:28,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {36198#false} assume 0 == ~cond; {36198#false} is VALID [2022-04-28 03:49:28,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {36198#false} assume !false; {36198#false} is VALID [2022-04-28 03:49:28,413 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-28 03:49:28,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088029735] [2022-04-28 03:49:28,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088029735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:28,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587256419] [2022-04-28 03:49:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:28,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:28,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:28,414 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-28 03:49:28,415 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-28 03:49:28,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:28,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:49:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:28,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:28,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {36197#true} call ULTIMATE.init(); {36197#true} is VALID [2022-04-28 03:49:28,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {36197#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); {36197#true} is VALID [2022-04-28 03:49:28,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-28 03:49:28,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-28 03:49:28,787 INFO L272 TraceCheckUtils]: 4: Hoare triple {36197#true} call #t~ret15 := main(); {36197#true} is VALID [2022-04-28 03:49:28,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {36197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36197#true} is VALID [2022-04-28 03:49:28,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {36197#true} [157] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_513 4294967296)) (.cse1 (= |v_main_#t~post5_174| |v_main_#t~post5_173|)) (.cse2 (= v_main_~y~0_671 v_main_~y~0_670)) (.cse3 (= v_main_~x~0_513 v_main_~x~0_512)) (.cse4 (= |v_main_#t~post6_174| |v_main_#t~post6_173|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_513 (* 4294967295 v_it_36)) 4294967296)) (not (<= (+ v_main_~y~0_671 v_it_36 1) v_main_~y~0_670)) (not (<= 1 v_it_36)))) (= v_main_~x~0_512 (+ v_main_~x~0_513 v_main_~y~0_671 (* (- 1) v_main_~y~0_670))) (< v_main_~y~0_671 v_main_~y~0_670)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_513, main_#t~post6=|v_main_#t~post6_174|} OutVars{main_~y~0=v_main_~y~0_670, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_512, main_#t~post6=|v_main_#t~post6_173|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36197#true} is VALID [2022-04-28 03:49:28,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {36197#true} [156] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {36197#true} is VALID [2022-04-28 03:49:28,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {36197#true} ~z~0 := ~y~0; {36197#true} is VALID [2022-04-28 03:49:28,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {36197#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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:28,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {36247#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:28,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {36251#(< 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; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:28,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {36255#(< 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; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:28,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {36259#(< 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; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:28,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {36263#(< 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; {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:49:28,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:49:28,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {36267#(< 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; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:28,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {36263#(< 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; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:28,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {36259#(< 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; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:28,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {36255#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:28,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {36251#(< 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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:28,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {36247#(< 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; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:28,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {36289#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,800 INFO L290 TraceCheckUtils]: 28: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:28,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {36289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-28 03:49:28,802 INFO L272 TraceCheckUtils]: 33: Hoare triple {36198#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36198#false} is VALID [2022-04-28 03:49:28,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {36198#false} ~cond := #in~cond; {36198#false} is VALID [2022-04-28 03:49:28,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {36198#false} assume 0 == ~cond; {36198#false} is VALID [2022-04-28 03:49:28,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {36198#false} assume !false; {36198#false} is VALID [2022-04-28 03:49:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 03:49:28,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:28,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {36198#false} assume !false; {36198#false} is VALID [2022-04-28 03:49:28,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {36198#false} assume 0 == ~cond; {36198#false} is VALID [2022-04-28 03:49:28,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {36198#false} ~cond := #in~cond; {36198#false} is VALID [2022-04-28 03:49:28,930 INFO L272 TraceCheckUtils]: 33: Hoare triple {36198#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {36198#false} is VALID [2022-04-28 03:49:28,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {36289#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {36198#false} is VALID [2022-04-28 03:49:28,931 INFO L290 TraceCheckUtils]: 31: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:28,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {36293#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {36289#(< 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; {36293#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:49:28,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {36247#(< 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; {36289#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:49:28,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {36251#(< 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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:28,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {36255#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:28,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {36259#(< 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; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:28,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {36263#(< 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; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:28,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {36267#(< 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; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:28,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} assume !(~z~0 % 4294967296 > 0); {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:49:28,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {36263#(< 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; {36267#(< 0 (mod (+ main_~z~0 6) 4294967296))} is VALID [2022-04-28 03:49:28,941 INFO L290 TraceCheckUtils]: 13: Hoare triple {36259#(< 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; {36263#(< 0 (mod (+ 5 main_~z~0) 4294967296))} is VALID [2022-04-28 03:49:28,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {36255#(< 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; {36259#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:49:28,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {36251#(< 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; {36255#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:49:28,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {36247#(< 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; {36251#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {36197#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; {36247#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {36197#true} ~z~0 := ~y~0; {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {36197#true} [156] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {36197#true} [157] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_513 4294967296)) (.cse1 (= |v_main_#t~post5_174| |v_main_#t~post5_173|)) (.cse2 (= v_main_~y~0_671 v_main_~y~0_670)) (.cse3 (= v_main_~x~0_513 v_main_~x~0_512)) (.cse4 (= |v_main_#t~post6_174| |v_main_#t~post6_173|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (forall ((v_it_36 Int)) (or (< 0 (mod (+ v_main_~x~0_513 (* 4294967295 v_it_36)) 4294967296)) (not (<= (+ v_main_~y~0_671 v_it_36 1) v_main_~y~0_670)) (not (<= 1 v_it_36)))) (= v_main_~x~0_512 (+ v_main_~x~0_513 v_main_~y~0_671 (* (- 1) v_main_~y~0_670))) (< v_main_~y~0_671 v_main_~y~0_670)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_671, main_#t~post5=|v_main_#t~post5_174|, main_~x~0=v_main_~x~0_513, main_#t~post6=|v_main_#t~post6_174|} OutVars{main_~y~0=v_main_~y~0_670, main_#t~post5=|v_main_#t~post5_173|, main_~x~0=v_main_~x~0_512, main_#t~post6=|v_main_#t~post6_173|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {36197#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {36197#true} call #t~ret15 := main(); {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36197#true} {36197#true} #83#return; {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {36197#true} assume true; {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {36197#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); {36197#true} is VALID [2022-04-28 03:49:28,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {36197#true} call ULTIMATE.init(); {36197#true} is VALID [2022-04-28 03:49:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 6 proven. 44 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 03:49:28,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587256419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:28,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:28,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10, 10] total 25 [2022-04-28 03:49:29,707 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:29,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [232911385] [2022-04-28 03:49:29,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [232911385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:29,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:29,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:49:29,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825963955] [2022-04-28 03:49:29,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:29,708 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:29,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:29,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:29,784 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-28 03:49:29,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:49:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:29,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:49:29,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=856, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:49:29,785 INFO L87 Difference]: Start difference. First operand 250 states and 330 transitions. Second operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:44,953 INFO L93 Difference]: Finished difference Result 407 states and 499 transitions. [2022-04-28 03:49:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:49:44,953 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 92 transitions. [2022-04-28 03:49:44,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 92 transitions. [2022-04-28 03:49:44,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 92 transitions. [2022-04-28 03:49:45,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:45,137 INFO L225 Difference]: With dead ends: 407 [2022-04-28 03:49:45,137 INFO L226 Difference]: Without dead ends: 298 [2022-04-28 03:49:45,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=415, Invalid=3491, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 03:49:45,138 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:45,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 107 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-28 03:49:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2022-04-28 03:49:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 187. [2022-04-28 03:49:46,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:46,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states. Second operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,959 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,959 INFO L87 Difference]: Start difference. First operand 298 states. Second operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:46,962 INFO L93 Difference]: Finished difference Result 298 states and 367 transitions. [2022-04-28 03:49:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2022-04-28 03:49:46,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:46,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:46,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 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 298 states. [2022-04-28 03:49:46,963 INFO L87 Difference]: Start difference. First operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 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 298 states. [2022-04-28 03:49:46,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:46,966 INFO L93 Difference]: Finished difference Result 298 states and 367 transitions. [2022-04-28 03:49:46,966 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 367 transitions. [2022-04-28 03:49:46,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:46,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:46,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:46,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 182 states have (on average 1.3516483516483517) internal successors, (246), 182 states have internal predecessors, (246), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 250 transitions. [2022-04-28 03:49:46,969 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 250 transitions. Word has length 42 [2022-04-28 03:49:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:46,969 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 250 transitions. [2022-04-28 03:49:46,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.434782608695652) internal successors, (33), 22 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-28 03:49:46,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 187 states and 250 transitions. [2022-04-28 03:50:08,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 246 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 250 transitions. [2022-04-28 03:50:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:50:08,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:08,362 INFO L195 NwaCegarLoop]: trace histogram [11, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:08,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:08,562 WARN L477 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-28 03:50:08,562 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1803306814, now seen corresponding path program 11 times [2022-04-28 03:50:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:08,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882842398] [2022-04-28 03:50:08,774 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-28 03:50:08,777 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash -47197810, now seen corresponding path program 1 times [2022-04-28 03:50:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:08,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449056762] [2022-04-28 03:50:08,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:08,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:08,792 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-28 03:50:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:08,818 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-28 03:50:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:09,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,043 INFO L290 TraceCheckUtils]: 0: Hoare triple {38320#(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); {38302#true} is VALID [2022-04-28 03:50:09,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-28 03:50:09,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-28 03:50:09,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {38302#true} call ULTIMATE.init(); {38320#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:09,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {38320#(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); {38302#true} is VALID [2022-04-28 03:50:09,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-28 03:50:09,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-28 03:50:09,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {38302#true} call #t~ret15 := main(); {38302#true} is VALID [2022-04-28 03:50:09,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {38302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38302#true} is VALID [2022-04-28 03:50:09,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {38302#true} [159] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_537 4294967296)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_698 v_main_~y~0_697)) (.cse4 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and (= v_main_~x~0_536 (+ v_main_~x~0_537 v_main_~y~0_698 (* (- 1) v_main_~y~0_697))) (< v_main_~y~0_698 v_main_~y~0_697) (forall ((v_it_37 Int)) (or (not (<= (+ v_main_~y~0_698 v_it_37 1) v_main_~y~0_697)) (not (<= 1 v_it_37)) (< 0 (mod (+ v_main_~x~0_537 (* 4294967295 v_it_37)) 4294967296)))) (< 0 .cse0)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_698, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_697, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_536, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38302#true} is VALID [2022-04-28 03:50:09,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {38302#true} [158] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {38307#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:50:09,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {38307#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {38307#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:50:09,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {38307#(<= 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; {38308#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:50:09,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {38308#(<= 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; {38309#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:09,048 INFO L290 TraceCheckUtils]: 11: Hoare triple {38309#(<= 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; {38310#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:09,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {38310#(<= 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; {38311#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:09,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {38311#(<= 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; {38312#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:50:09,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {38312#(<= 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; {38313#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:09,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {38313#(<= 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; {38314#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:09,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {38314#(<= 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; {38315#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:09,053 INFO L290 TraceCheckUtils]: 17: Hoare triple {38315#(<= 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; {38316#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:50:09,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {38316#(<= 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; {38317#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:50:09,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {38317#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,055 INFO L290 TraceCheckUtils]: 20: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~z~0 % 4294967296 > 0); {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {38318#(<= 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; {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} assume !(~y~0 % 4294967296 > 0); {38318#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:09,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {38318#(<= 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; {38319#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} is VALID [2022-04-28 03:50:09,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {38319#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 10) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-28 03:50:09,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {38303#false} assume !(~z~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-28 03:50:09,060 INFO L272 TraceCheckUtils]: 33: Hoare triple {38303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38303#false} is VALID [2022-04-28 03:50:09,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {38303#false} ~cond := #in~cond; {38303#false} is VALID [2022-04-28 03:50:09,060 INFO L290 TraceCheckUtils]: 35: Hoare triple {38303#false} assume 0 == ~cond; {38303#false} is VALID [2022-04-28 03:50:09,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {38303#false} assume !false; {38303#false} is VALID [2022-04-28 03:50:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 03:50:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:09,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449056762] [2022-04-28 03:50:09,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449056762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:09,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114495574] [2022-04-28 03:50:09,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:09,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:09,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:09,062 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-28 03:50:09,063 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-28 03:50:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 03:50:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:09,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {38302#true} call ULTIMATE.init(); {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {38302#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); {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {38302#true} call #t~ret15 := main(); {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {38302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {38302#true} [159] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_537 4294967296)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_698 v_main_~y~0_697)) (.cse4 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and (= v_main_~x~0_536 (+ v_main_~x~0_537 v_main_~y~0_698 (* (- 1) v_main_~y~0_697))) (< v_main_~y~0_698 v_main_~y~0_697) (forall ((v_it_37 Int)) (or (not (<= (+ v_main_~y~0_698 v_it_37 1) v_main_~y~0_697)) (not (<= 1 v_it_37)) (< 0 (mod (+ v_main_~x~0_537 (* 4294967295 v_it_37)) 4294967296)))) (< 0 .cse0)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_698, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_697, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_536, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38302#true} is VALID [2022-04-28 03:50:09,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {38302#true} [158] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {38302#true} is VALID [2022-04-28 03:50:09,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {38302#true} ~z~0 := ~y~0; {38348#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:09,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {38348#(= 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; {38352#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:50:09,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {38352#(= 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; {38356#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:50:09,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {38356#(= 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; {38360#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:09,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {38360#(= (+ (- 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; {38364#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:09,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {38364#(= (+ 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; {38368#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:09,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {38368#(= (+ 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; {38372#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:09,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {38372#(= (+ 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; {38376#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:09,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {38376#(= (+ 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; {38380#(= (+ main_~y~0 (- 6)) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:09,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {38380#(= (+ main_~y~0 (- 6)) (+ 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; {38384#(= (+ main_~y~0 (- 6)) (+ main_~z~0 3))} is VALID [2022-04-28 03:50:09,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {38384#(= (+ main_~y~0 (- 6)) (+ 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; {38388#(= (+ main_~y~0 (- 6)) (+ main_~z~0 4))} is VALID [2022-04-28 03:50:09,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {38388#(= (+ main_~y~0 (- 6)) (+ 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; {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} is VALID [2022-04-28 03:50:09,732 INFO L290 TraceCheckUtils]: 20: Hoare triple {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} assume !(~z~0 % 4294967296 > 0); {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 10)))} is VALID [2022-04-28 03:50:09,732 INFO L290 TraceCheckUtils]: 21: Hoare triple {38392#(= (+ main_~z~0 1) (+ main_~y~0 (- 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; {38384#(= (+ main_~y~0 (- 6)) (+ main_~z~0 3))} is VALID [2022-04-28 03:50:09,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {38384#(= (+ main_~y~0 (- 6)) (+ 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; {38376#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:09,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {38376#(= (+ main_~y~0 (- 6)) (+ 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; {38368#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:09,734 INFO L290 TraceCheckUtils]: 24: Hoare triple {38368#(= (+ main_~y~0 (- 3)) (+ 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; {38408#(and (= (+ main_~y~0 (- 3)) main_~z~0) (< 0 (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-28 03:50:09,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {38408#(and (= (+ main_~y~0 (- 3)) main_~z~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; {38412#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-28 03:50:09,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {38412#(and (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ 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; {38416#(and (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ main_~y~0 3) 4294967296)))} is VALID [2022-04-28 03:50:09,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {38416#(and (= main_~z~0 (+ main_~y~0 1)) (< 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; {38420#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:50:09,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {38420#(and (= (+ (- 2) main_~z~0) (+ main_~y~0 1)) (< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:09,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:09,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {38424#(< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:09,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:09,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-28 03:50:09,739 INFO L272 TraceCheckUtils]: 33: Hoare triple {38303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38303#false} is VALID [2022-04-28 03:50:09,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {38303#false} ~cond := #in~cond; {38303#false} is VALID [2022-04-28 03:50:09,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {38303#false} assume 0 == ~cond; {38303#false} is VALID [2022-04-28 03:50:09,739 INFO L290 TraceCheckUtils]: 36: Hoare triple {38303#false} assume !false; {38303#false} is VALID [2022-04-28 03:50:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:50:09,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:10,912 INFO L290 TraceCheckUtils]: 36: Hoare triple {38303#false} assume !false; {38303#false} is VALID [2022-04-28 03:50:10,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {38303#false} assume 0 == ~cond; {38303#false} is VALID [2022-04-28 03:50:10,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {38303#false} ~cond := #in~cond; {38303#false} is VALID [2022-04-28 03:50:10,913 INFO L272 TraceCheckUtils]: 33: Hoare triple {38303#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {38303#false} is VALID [2022-04-28 03:50:10,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38303#false} is VALID [2022-04-28 03:50:10,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:10,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {38424#(< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:10,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {38424#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:10,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {38473#(< 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; {38424#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:10,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {38477#(< 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; {38473#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:50:10,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {38481#(< 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; {38477#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:50:10,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {38485#(< 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; {38481#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:50:10,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {38489#(or (<= (mod main_~y~0 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; {38485#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:50:10,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {38493#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 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; {38489#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:50:10,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {38497#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 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; {38493#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 03:50:10,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38497#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 03:50:10,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} is VALID [2022-04-28 03:50:10,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {38508#(or (< 0 (mod (+ 7 main_~z~0) 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; {38501#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 8) 4294967296)))} is VALID [2022-04-28 03:50:10,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {38512#(or (< 0 (mod (+ main_~z~0 6) 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; {38508#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:50:10,926 INFO L290 TraceCheckUtils]: 17: Hoare triple {38516#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 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; {38512#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:50:10,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {38520#(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; {38516#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:50:10,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {38524#(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; {38520#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:50:10,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {38528#(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; {38524#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:50:10,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {38532#(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; {38528#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:50:10,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {38536#(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; {38532#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:50:10,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {38540#(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; {38536#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:50:10,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {38544#(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; {38540#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:50:10,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {38548#(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; {38544#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:50:10,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {38302#true} ~z~0 := ~y~0; {38548#(or (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:50:10,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {38302#true} [158] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {38302#true} [159] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_537 4294967296)) (.cse1 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse2 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse3 (= v_main_~y~0_698 v_main_~y~0_697)) (.cse4 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and (= v_main_~x~0_536 (+ v_main_~x~0_537 v_main_~y~0_698 (* (- 1) v_main_~y~0_697))) (< v_main_~y~0_698 v_main_~y~0_697) (forall ((v_it_37 Int)) (or (not (<= (+ v_main_~y~0_698 v_it_37 1) v_main_~y~0_697)) (not (<= 1 v_it_37)) (< 0 (mod (+ v_main_~x~0_537 (* 4294967295 v_it_37)) 4294967296)))) (< 0 .cse0)) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_698, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_697, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_536, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {38302#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {38302#true} call #t~ret15 := main(); {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38302#true} {38302#true} #83#return; {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {38302#true} assume true; {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {38302#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); {38302#true} is VALID [2022-04-28 03:50:10,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {38302#true} call ULTIMATE.init(); {38302#true} is VALID [2022-04-28 03:50:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:50:10,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114495574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:10,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:10,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 22] total 52 [2022-04-28 03:50:11,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:11,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882842398] [2022-04-28 03:50:11,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882842398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:11,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:11,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:50:11,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219165630] [2022-04-28 03:50:11,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 42 [2022-04-28 03:50:11,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:11,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-28 03:50:12,020 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-28 03:50:12,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:50:12,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:12,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:50:12,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3072, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:50:12,021 INFO L87 Difference]: Start difference. First operand 187 states and 250 transitions. Second operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-28 03:50:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:22,721 INFO L93 Difference]: Finished difference Result 403 states and 606 transitions. [2022-04-28 03:50:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:50:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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 42 [2022-04-28 03:50:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:22,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-28 03:50:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 137 transitions. [2022-04-28 03:50:22,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-28 03:50:22,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 137 transitions. [2022-04-28 03:50:22,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 137 transitions. [2022-04-28 03:50:22,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:22,962 INFO L225 Difference]: With dead ends: 403 [2022-04-28 03:50:22,962 INFO L226 Difference]: Without dead ends: 375 [2022-04-28 03:50:22,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=587, Invalid=6219, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:50:22,963 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 198 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:22,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 44 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:50:22,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-04-28 03:50:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 202. [2022-04-28 03:50:25,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:25,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,047 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,047 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:25,052 INFO L93 Difference]: Finished difference Result 375 states and 518 transitions. [2022-04-28 03:50:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 518 transitions. [2022-04-28 03:50:25,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:25,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:25,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 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 375 states. [2022-04-28 03:50:25,053 INFO L87 Difference]: Start difference. First operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 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 375 states. [2022-04-28 03:50:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:25,057 INFO L93 Difference]: Finished difference Result 375 states and 518 transitions. [2022-04-28 03:50:25,058 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 518 transitions. [2022-04-28 03:50:25,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:25,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:25,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:25,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 1.3553299492385786) internal successors, (267), 197 states have internal predecessors, (267), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 271 transitions. [2022-04-28 03:50:25,061 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 271 transitions. Word has length 42 [2022-04-28 03:50:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:25,061 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 271 transitions. [2022-04-28 03:50:25,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 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-28 03:50:25,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 202 states and 271 transitions. [2022-04-28 03:50:48,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 266 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 271 transitions. [2022-04-28 03:50:48,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:50:48,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:48,609 INFO L195 NwaCegarLoop]: trace histogram [12, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:48,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:48,809 WARN L477 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-28 03:50:48,809 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1539553968, now seen corresponding path program 12 times [2022-04-28 03:50:48,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:48,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062790816] [2022-04-28 03:50:49,010 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-28 03:50:49,011 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1958390204, now seen corresponding path program 1 times [2022-04-28 03:50:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:49,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508954402] [2022-04-28 03:50:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:49,023 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-28 03:50:49,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:49,052 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-28 03:50:49,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:49,353 INFO L290 TraceCheckUtils]: 0: Hoare triple {40613#(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); {40594#true} is VALID [2022-04-28 03:50:49,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-28 03:50:49,354 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-28 03:50:49,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {40594#true} call ULTIMATE.init(); {40613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:49,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {40613#(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); {40594#true} is VALID [2022-04-28 03:50:49,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-28 03:50:49,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-28 03:50:49,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {40594#true} call #t~ret15 := main(); {40594#true} is VALID [2022-04-28 03:50:49,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {40594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40594#true} is VALID [2022-04-28 03:50:49,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#true} [161] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_727 v_main_~y~0_726)) (.cse1 (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) (.cse2 (= |v_main_#t~post6_184| |v_main_#t~post6_183|)) (.cse3 (= v_main_~x~0_561 v_main_~x~0_560)) (.cse4 (mod v_main_~x~0_561 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_727 v_main_~y~0_726) (< 0 .cse4) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (< 0 (mod (+ v_main_~x~0_561 (* 4294967295 v_it_38)) 4294967296)) (not (<= (+ v_main_~y~0_727 v_it_38 1) v_main_~y~0_726)))) (= v_main_~x~0_560 (+ v_main_~x~0_561 (* (- 1) v_main_~y~0_726) v_main_~y~0_727))))) InVars {main_~y~0=v_main_~y~0_727, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_561, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_726, main_#t~post5=|v_main_#t~post5_183|, main_~x~0=v_main_~x~0_560, main_#t~post6=|v_main_#t~post6_183|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40594#true} is VALID [2022-04-28 03:50:49,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#true} [160] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {40599#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:50:49,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {40599#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {40599#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:50:49,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {40599#(<= 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; {40600#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:50:49,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {40600#(<= 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; {40601#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:49,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {40601#(<= 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; {40602#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:49,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {40602#(<= 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; {40603#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:49,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {40603#(<= 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; {40604#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:50:49,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {40604#(<= 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; {40605#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:49,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {40605#(<= 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; {40606#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:49,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {40606#(<= 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; {40607#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:50:49,364 INFO L290 TraceCheckUtils]: 17: Hoare triple {40607#(<= 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; {40608#(<= main_~x~0 (+ (* 4294967296 (div (+ (- 9) main_~x~0) 4294967296)) 9))} is VALID [2022-04-28 03:50:49,365 INFO L290 TraceCheckUtils]: 18: Hoare triple {40608#(<= 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; {40609#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 10)) 4294967296) 4294967296) 10))} is VALID [2022-04-28 03:50:49,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {40609#(<= 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; {40610#(<= main_~x~0 (+ (* (div (+ (- 11) main_~x~0) 4294967296) 4294967296) 11))} is VALID [2022-04-28 03:50:49,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {40610#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~z~0 % 4294967296 > 0); {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,369 INFO L290 TraceCheckUtils]: 24: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {40611#(<= 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; {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} assume !(~y~0 % 4294967296 > 0); {40611#(<= main_~x~0 (+ (* (div (+ main_~x~0 (- 12)) 4294967296) 4294967296) 12))} is VALID [2022-04-28 03:50:49,372 INFO L290 TraceCheckUtils]: 31: Hoare triple {40611#(<= 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; {40612#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} is VALID [2022-04-28 03:50:49,372 INFO L290 TraceCheckUtils]: 32: Hoare triple {40612#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 11) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-28 03:50:49,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {40595#false} assume !(~z~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-28 03:50:49,373 INFO L272 TraceCheckUtils]: 34: Hoare triple {40595#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40595#false} is VALID [2022-04-28 03:50:49,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {40595#false} ~cond := #in~cond; {40595#false} is VALID [2022-04-28 03:50:49,373 INFO L290 TraceCheckUtils]: 36: Hoare triple {40595#false} assume 0 == ~cond; {40595#false} is VALID [2022-04-28 03:50:49,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {40595#false} assume !false; {40595#false} is VALID [2022-04-28 03:50:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 03:50:49,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:49,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508954402] [2022-04-28 03:50:49,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508954402] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:49,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563904963] [2022-04-28 03:50:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:49,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:49,376 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-28 03:50:49,377 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-28 03:50:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:49,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 03:50:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:49,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:50,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {40594#true} call ULTIMATE.init(); {40594#true} is VALID [2022-04-28 03:50:50,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {40594#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); {40594#true} is VALID [2022-04-28 03:50:50,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-28 03:50:50,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-28 03:50:50,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {40594#true} call #t~ret15 := main(); {40594#true} is VALID [2022-04-28 03:50:50,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {40594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40594#true} is VALID [2022-04-28 03:50:50,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#true} [161] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_727 v_main_~y~0_726)) (.cse1 (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) (.cse2 (= |v_main_#t~post6_184| |v_main_#t~post6_183|)) (.cse3 (= v_main_~x~0_561 v_main_~x~0_560)) (.cse4 (mod v_main_~x~0_561 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_727 v_main_~y~0_726) (< 0 .cse4) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (< 0 (mod (+ v_main_~x~0_561 (* 4294967295 v_it_38)) 4294967296)) (not (<= (+ v_main_~y~0_727 v_it_38 1) v_main_~y~0_726)))) (= v_main_~x~0_560 (+ v_main_~x~0_561 (* (- 1) v_main_~y~0_726) v_main_~y~0_727))))) InVars {main_~y~0=v_main_~y~0_727, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_561, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_726, main_#t~post5=|v_main_#t~post5_183|, main_~x~0=v_main_~x~0_560, main_#t~post6=|v_main_#t~post6_183|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40594#true} is VALID [2022-04-28 03:50:50,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#true} [160] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {40594#true} is VALID [2022-04-28 03:50:50,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {40594#true} ~z~0 := ~y~0; {40641#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:50:50,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {40641#(= 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; {40645#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {40645#(= 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; {40649#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:50:50,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {40649#(= (+ 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; {40653#(= (+ main_~z~0 2) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:50:50,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {40653#(= (+ 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; {40657#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:50:50,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {40657#(= (+ 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; {40661#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {40661#(= (+ 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; {40665#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:50,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {40665#(= (+ 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; {40669#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {40669#(= (+ 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; {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:50:50,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40677#(= (+ main_~z~0 1) (+ main_~y~0 (- 8)))} is VALID [2022-04-28 03:50:50,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {40677#(= (+ main_~z~0 1) (+ main_~y~0 (- 8)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {40681#(= (+ (- 9) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,168 INFO L290 TraceCheckUtils]: 19: Hoare triple {40681#(= (+ (- 9) 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; {40685#(= (+ (- 9) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:50,168 INFO L290 TraceCheckUtils]: 20: Hoare triple {40685#(= (+ (- 9) 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; {40689#(= (+ (- 11) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {40689#(= (+ (- 11) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {40689#(= (+ (- 11) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {40689#(= (+ (- 11) 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; {40681#(= (+ (- 9) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:50:50,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {40681#(= (+ (- 9) 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; {40673#(= (+ main_~z~0 1) (+ main_~y~0 (- 7)))} is VALID [2022-04-28 03:50:50,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {40673#(= (+ 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; {40665#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-28 03:50:50,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {40665#(= (+ main_~y~0 (- 4)) (+ 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; {40657#(= (+ main_~z~0 3) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:50:50,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {40657#(= (+ main_~z~0 3) (+ (- 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; {40708#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ (- 2) main_~y~0) main_~z~0))} is VALID [2022-04-28 03:50:50,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {40708#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= (+ (- 2) main_~y~0) 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; {40712#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-28 03:50:50,174 INFO L290 TraceCheckUtils]: 28: Hoare triple {40712#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 1) (+ 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; {40716#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 0 (mod (+ main_~z~0 1) 4294967296)))} is VALID [2022-04-28 03:50:50,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {40716#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:50,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:50,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {40720#(< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:50,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:50,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-28 03:50:50,176 INFO L272 TraceCheckUtils]: 34: Hoare triple {40595#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40595#false} is VALID [2022-04-28 03:50:50,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {40595#false} ~cond := #in~cond; {40595#false} is VALID [2022-04-28 03:50:50,176 INFO L290 TraceCheckUtils]: 36: Hoare triple {40595#false} assume 0 == ~cond; {40595#false} is VALID [2022-04-28 03:50:50,176 INFO L290 TraceCheckUtils]: 37: Hoare triple {40595#false} assume !false; {40595#false} is VALID [2022-04-28 03:50:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:50:50,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:51,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {40595#false} assume !false; {40595#false} is VALID [2022-04-28 03:50:51,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {40595#false} assume 0 == ~cond; {40595#false} is VALID [2022-04-28 03:50:51,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {40595#false} ~cond := #in~cond; {40595#false} is VALID [2022-04-28 03:50:51,508 INFO L272 TraceCheckUtils]: 34: Hoare triple {40595#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {40595#false} is VALID [2022-04-28 03:50:51,508 INFO L290 TraceCheckUtils]: 33: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40595#false} is VALID [2022-04-28 03:50:51,508 INFO L290 TraceCheckUtils]: 32: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:51,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {40720#(< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:51,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {40720#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:51,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {40769#(< 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; {40720#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:50:51,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {40773#(< 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; {40769#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:50:51,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {40777#(< 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; {40773#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:50:51,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {40781#(or (<= (mod main_~y~0 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; {40777#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:50:51,513 INFO L290 TraceCheckUtils]: 25: Hoare triple {40785#(or (<= (mod (+ main_~y~0 4294967295) 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; {40781#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:50:51,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {40789#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 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; {40785#(or (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:50:51,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {40793#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 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; {40789#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 03:50:51,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 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; {40793#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:50:51,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {40804#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40797#(or (< 0 (mod (+ main_~z~0 8) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {40808#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40804#(or (< 0 (mod (+ 7 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {40812#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40808#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {40816#(or (<= (mod (+ 4294967292 main_~y~0) 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; {40812#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {40820#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40816#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:50:51,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {40824#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40820#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {40828#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40824#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {40832#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40828#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {40836#(or (<= (mod (+ 4294967292 main_~y~0) 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; {40832#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {40840#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40836#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:50:51,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {40844#(or (<= (mod (+ 4294967292 main_~y~0) 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; {40840#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {40848#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~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; {40844#(or (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:50:51,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {40594#true} ~z~0 := ~y~0; {40848#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0))} is VALID [2022-04-28 03:50:51,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {40594#true} [160] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {40594#true} is VALID [2022-04-28 03:50:51,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {40594#true} [161] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_727 v_main_~y~0_726)) (.cse1 (= |v_main_#t~post5_184| |v_main_#t~post5_183|)) (.cse2 (= |v_main_#t~post6_184| |v_main_#t~post6_183|)) (.cse3 (= v_main_~x~0_561 v_main_~x~0_560)) (.cse4 (mod v_main_~x~0_561 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_727 v_main_~y~0_726) (< 0 .cse4) (forall ((v_it_38 Int)) (or (not (<= 1 v_it_38)) (< 0 (mod (+ v_main_~x~0_561 (* 4294967295 v_it_38)) 4294967296)) (not (<= (+ v_main_~y~0_727 v_it_38 1) v_main_~y~0_726)))) (= v_main_~x~0_560 (+ v_main_~x~0_561 (* (- 1) v_main_~y~0_726) v_main_~y~0_727))))) InVars {main_~y~0=v_main_~y~0_727, main_#t~post5=|v_main_#t~post5_184|, main_~x~0=v_main_~x~0_561, main_#t~post6=|v_main_#t~post6_184|} OutVars{main_~y~0=v_main_~y~0_726, main_#t~post5=|v_main_#t~post5_183|, main_~x~0=v_main_~x~0_560, main_#t~post6=|v_main_#t~post6_183|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40594#true} is VALID [2022-04-28 03:50:51,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {40594#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40594#true} is VALID [2022-04-28 03:50:51,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {40594#true} call #t~ret15 := main(); {40594#true} is VALID [2022-04-28 03:50:51,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40594#true} {40594#true} #83#return; {40594#true} is VALID [2022-04-28 03:50:51,529 INFO L290 TraceCheckUtils]: 2: Hoare triple {40594#true} assume true; {40594#true} is VALID [2022-04-28 03:50:51,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {40594#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); {40594#true} is VALID [2022-04-28 03:50:51,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {40594#true} call ULTIMATE.init(); {40594#true} is VALID [2022-04-28 03:50:51,530 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:50:51,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563904963] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:51,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:51,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 23] total 54 [2022-04-28 03:50:52,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:52,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062790816] [2022-04-28 03:50:52,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062790816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:52,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:52,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:50:52,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279520688] [2022-04-28 03:50:52,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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 43 [2022-04-28 03:50:52,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:52,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-28 03:50:52,819 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-28 03:50:52,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:50:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:52,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:50:52,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3297, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:50:52,820 INFO L87 Difference]: Start difference. First operand 202 states and 271 transitions. Second operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-28 03:51:03,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:03,733 INFO L93 Difference]: Finished difference Result 421 states and 629 transitions. [2022-04-28 03:51:03,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:51:03,733 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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 43 [2022-04-28 03:51:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-28 03:51:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2022-04-28 03:51:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-28 03:51:03,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 142 transitions. [2022-04-28 03:51:03,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 142 transitions. [2022-04-28 03:51:04,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:04,184 INFO L225 Difference]: With dead ends: 421 [2022-04-28 03:51:04,184 INFO L226 Difference]: Without dead ends: 393 [2022-04-28 03:51:04,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=612, Invalid=6698, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:51:04,185 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 194 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:04,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 67 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:51:04,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-04-28 03:51:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 216. [2022-04-28 03:51:06,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:06,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:06,437 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:06,437 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:06,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:06,442 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2022-04-28 03:51:06,443 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 541 transitions. [2022-04-28 03:51:06,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:06,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:06,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 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 393 states. [2022-04-28 03:51:06,445 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 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 393 states. [2022-04-28 03:51:06,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:06,450 INFO L93 Difference]: Finished difference Result 393 states and 541 transitions. [2022-04-28 03:51:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 541 transitions. [2022-04-28 03:51:06,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:06,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:06,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:06,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.3554502369668247) internal successors, (286), 211 states have internal predecessors, (286), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:51:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 290 transitions. [2022-04-28 03:51:06,461 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 290 transitions. Word has length 43 [2022-04-28 03:51:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:06,461 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 290 transitions. [2022-04-28 03:51:06,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.391304347826087) internal successors, (32), 22 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-28 03:51:06,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 290 transitions. [2022-04-28 03:51:31,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 285 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:31,560 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 290 transitions. [2022-04-28 03:51:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:51:31,560 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:31,561 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:31,579 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-28 03:51:31,777 WARN L477 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-28 03:51:31,777 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:31,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1786865828, now seen corresponding path program 23 times [2022-04-28 03:51:31,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:31,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154699071] [2022-04-28 03:51:31,978 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-28 03:51:31,979 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:31,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1890217456, now seen corresponding path program 1 times [2022-04-28 03:51:31,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:31,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596793627] [2022-04-28 03:51:31,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:31,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:31,994 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-28 03:51:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:32,022 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_39.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:51:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:32,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {43020#(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); {42996#true} is VALID [2022-04-28 03:51:32,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-28 03:51:32,419 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-28 03:51:32,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {42996#true} call ULTIMATE.init(); {43020#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:32,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {43020#(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); {42996#true} is VALID [2022-04-28 03:51:32,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-28 03:51:32,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-28 03:51:32,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {42996#true} call #t~ret15 := main(); {42996#true} is VALID [2022-04-28 03:51:32,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {42996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43001#(= main_~y~0 0)} is VALID [2022-04-28 03:51:32,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {43001#(= main_~y~0 0)} [163] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_756 v_main_~y~0_755)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|)) (.cse3 (= |v_main_#t~post6_189| |v_main_#t~post6_188|)) (.cse0 (mod v_main_~x~0_586 4294967296)) (.cse4 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (= (+ v_main_~x~0_586 v_main_~y~0_756 (* (- 1) v_main_~y~0_755)) v_main_~x~0_585) (forall ((v_it_39 Int)) (or (not (<= 1 v_it_39)) (< 0 (mod (+ v_main_~x~0_586 (* 4294967295 v_it_39)) 4294967296)) (not (<= (+ v_main_~y~0_756 v_it_39 1) v_main_~y~0_755)))) (< 0 .cse0) (< v_main_~y~0_756 v_main_~y~0_755)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_756, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_586, main_#t~post6=|v_main_#t~post6_189|} OutVars{main_~y~0=v_main_~y~0_755, main_#t~post5=|v_main_#t~post5_188|, main_~x~0=v_main_~x~0_585, main_#t~post6=|v_main_#t~post6_188|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43002#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:51:32,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {43002#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} [162] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {43003#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 03:51:32,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {43003#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {43004#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-28 03:51:32,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {43004#(or (<= (+ (* (div (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43005#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {43005#(<= 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; {43006#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:51:32,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {43006#(<= 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; {43007#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {43007#(<= 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; {43008#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {43008#(<= 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; {43009#(<= main_~z~0 (+ 4294967290 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {43009#(<= 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; {43010#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} is VALID [2022-04-28 03:51:32,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {43010#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967289))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43011#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {43011#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {43011#(<= main_~z~0 (+ 4294967288 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {43011#(<= main_~z~0 (+ 4294967288 (* (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; {43012#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967289))} is VALID [2022-04-28 03:51:32,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {43012#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {43013#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967290))} is VALID [2022-04-28 03:51:32,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {43013#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967290))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43014#(<= main_~z~0 (+ 4294967291 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {43014#(<= main_~z~0 (+ 4294967291 (* (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; {43015#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967292))} is VALID [2022-04-28 03:51:32,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {43015#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967292))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43016#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:51:32,438 INFO L290 TraceCheckUtils]: 22: Hoare triple {43016#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 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; {43017#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:32,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {43017#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,440 INFO L290 TraceCheckUtils]: 24: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !(~y~0 % 4294967296 > 0); {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,441 INFO L290 TraceCheckUtils]: 28: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,442 INFO L290 TraceCheckUtils]: 30: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,442 INFO L290 TraceCheckUtils]: 31: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 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; {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !(~x~0 % 4294967296 > 0); {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:51:32,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {43018#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296) 4294967295))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {43019#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:51:32,445 INFO L290 TraceCheckUtils]: 34: Hoare triple {43019#(<= (+ 6 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {42997#false} is VALID [2022-04-28 03:51:32,445 INFO L272 TraceCheckUtils]: 35: Hoare triple {42997#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42997#false} is VALID [2022-04-28 03:51:32,445 INFO L290 TraceCheckUtils]: 36: Hoare triple {42997#false} ~cond := #in~cond; {42997#false} is VALID [2022-04-28 03:51:32,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {42997#false} assume 0 == ~cond; {42997#false} is VALID [2022-04-28 03:51:32,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {42997#false} assume !false; {42997#false} is VALID [2022-04-28 03:51:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 21 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 03:51:32,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:32,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596793627] [2022-04-28 03:51:32,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596793627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:32,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694886878] [2022-04-28 03:51:32,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:32,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:32,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:32,447 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-28 03:51:32,448 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-28 03:51:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:32,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:51:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:32,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:33,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {42996#true} call ULTIMATE.init(); {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {42996#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); {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {42996#true} call #t~ret15 := main(); {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {42996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {42996#true} [163] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_756 v_main_~y~0_755)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|)) (.cse3 (= |v_main_#t~post6_189| |v_main_#t~post6_188|)) (.cse0 (mod v_main_~x~0_586 4294967296)) (.cse4 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (= (+ v_main_~x~0_586 v_main_~y~0_756 (* (- 1) v_main_~y~0_755)) v_main_~x~0_585) (forall ((v_it_39 Int)) (or (not (<= 1 v_it_39)) (< 0 (mod (+ v_main_~x~0_586 (* 4294967295 v_it_39)) 4294967296)) (not (<= (+ v_main_~y~0_756 v_it_39 1) v_main_~y~0_755)))) (< 0 .cse0) (< v_main_~y~0_756 v_main_~y~0_755)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_756, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_586, main_#t~post6=|v_main_#t~post6_189|} OutVars{main_~y~0=v_main_~y~0_755, main_#t~post5=|v_main_#t~post5_188|, main_~x~0=v_main_~x~0_585, main_#t~post6=|v_main_#t~post6_188|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42996#true} is VALID [2022-04-28 03:51:33,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {42996#true} [162] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {42996#true} is VALID [2022-04-28 03:51:33,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {42996#true} ~z~0 := ~y~0; {43048#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:51:33,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {43048#(= 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; {43052#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:51:33,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {43052#(= 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; {43056#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:51:33,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {43056#(= 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; {43060#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:51:33,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {43060#(= 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; {43064#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-28 03:51:33,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {43064#(= 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; {43068#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:51:33,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {43068#(= (+ 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; {43072#(= (+ main_~y~0 (- 5)) (+ main_~z~0 1))} is VALID [2022-04-28 03:51:33,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {43072#(= (+ 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; {43076#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:51:33,092 INFO L290 TraceCheckUtils]: 16: Hoare triple {43076#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {43076#(= (+ main_~y~0 (- 6)) (+ main_~z~0 1))} is VALID [2022-04-28 03:51:33,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {43076#(= (+ main_~y~0 (- 6)) (+ 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; {43068#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:51:33,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {43068#(= (+ 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; {43086#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:51:33,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {43086#(< 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; {43090#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:51:33,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {43090#(< 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; {43094#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:51:33,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {43094#(< 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; {43005#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:33,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {43005#(<= 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; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:51:33,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {43101#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:51:33,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {42997#false} is VALID [2022-04-28 03:51:33,103 INFO L272 TraceCheckUtils]: 35: Hoare triple {42997#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42997#false} is VALID [2022-04-28 03:51:33,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {42997#false} ~cond := #in~cond; {42997#false} is VALID [2022-04-28 03:51:33,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {42997#false} assume 0 == ~cond; {42997#false} is VALID [2022-04-28 03:51:33,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {42997#false} assume !false; {42997#false} is VALID [2022-04-28 03:51:33,103 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 03:51:33,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:33,683 INFO L290 TraceCheckUtils]: 38: Hoare triple {42997#false} assume !false; {42997#false} is VALID [2022-04-28 03:51:33,684 INFO L290 TraceCheckUtils]: 37: Hoare triple {42997#false} assume 0 == ~cond; {42997#false} is VALID [2022-04-28 03:51:33,684 INFO L290 TraceCheckUtils]: 36: Hoare triple {42997#false} ~cond := #in~cond; {42997#false} is VALID [2022-04-28 03:51:33,684 INFO L272 TraceCheckUtils]: 35: Hoare triple {42997#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {42997#false} is VALID [2022-04-28 03:51:33,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {42997#false} is VALID [2022-04-28 03:51:33,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:51:33,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {43105#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} assume !(~y~0 % 4294967296 > 0); {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {43101#(<= 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; {43105#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967296))} is VALID [2022-04-28 03:51:33,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {43005#(<= 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; {43101#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:51:33,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {43094#(< 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; {43005#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:51:33,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {43090#(< 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; {43094#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:51:33,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {43086#(< 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; {43090#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:51:33,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {43211#(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; {43086#(< 0 (mod (+ main_~z~0 4) 4294967296))} is VALID [2022-04-28 03:51:33,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {43215#(or (< 0 (mod (+ main_~z~0 6) 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; {43211#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ 5 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:51:33,696 INFO L290 TraceCheckUtils]: 16: Hoare triple {43215#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {43215#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {43222#(or (< 0 (mod (+ 5 main_~z~0) 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; {43215#(or (< 0 (mod (+ main_~z~0 6) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {43226#(or (not (< 0 (mod (+ main_~y~0 4294967295) 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; {43222#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {43230#(or (< 0 (mod (+ main_~z~0 3) 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; {43226#(or (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:51:33,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {43234#(or (< 0 (mod (+ main_~z~0 2) 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; {43230#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {43238#(or (< 0 (mod (+ main_~z~0 1) 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; {43234#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {43242#(or (< 0 (mod main_~z~0 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; {43238#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {43246#(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; {43242#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {42996#true} ~z~0 := ~y~0; {43246#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:51:33,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {42996#true} [162] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {42996#true} [163] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_756 v_main_~y~0_755)) (.cse2 (= |v_main_#t~post5_189| |v_main_#t~post5_188|)) (.cse3 (= |v_main_#t~post6_189| |v_main_#t~post6_188|)) (.cse0 (mod v_main_~x~0_586 4294967296)) (.cse4 (= v_main_~x~0_586 v_main_~x~0_585))) (or (and (= (+ v_main_~x~0_586 v_main_~y~0_756 (* (- 1) v_main_~y~0_755)) v_main_~x~0_585) (forall ((v_it_39 Int)) (or (not (<= 1 v_it_39)) (< 0 (mod (+ v_main_~x~0_586 (* 4294967295 v_it_39)) 4294967296)) (not (<= (+ v_main_~y~0_756 v_it_39 1) v_main_~y~0_755)))) (< 0 .cse0) (< v_main_~y~0_756 v_main_~y~0_755)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4))) InVars {main_~y~0=v_main_~y~0_756, main_#t~post5=|v_main_#t~post5_189|, main_~x~0=v_main_~x~0_586, main_#t~post6=|v_main_#t~post6_189|} OutVars{main_~y~0=v_main_~y~0_755, main_#t~post5=|v_main_#t~post5_188|, main_~x~0=v_main_~x~0_585, main_#t~post6=|v_main_#t~post6_188|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {42996#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {42996#true} call #t~ret15 := main(); {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42996#true} {42996#true} #83#return; {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {42996#true} assume true; {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {42996#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); {42996#true} is VALID [2022-04-28 03:51:33,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {42996#true} call ULTIMATE.init(); {42996#true} is VALID [2022-04-28 03:51:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 03:51:33,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694886878] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:33,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:33,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 17] total 44 [2022-04-28 03:51:46,577 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (or (= (+ (- 4) c_main_~y~0) 0) (and (forall ((v_it_39 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_39) c_main_~x~0 c_main_~y~0) 4294967296)) (not (<= 1 v_it_39)) (not (<= (+ 5 v_it_39) c_main_~y~0)))) (< 0 (mod (+ c_main_~x~0 c_main_~y~0) 4294967296)) (< 4 c_main_~y~0))) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296))) is different from false [2022-04-28 03:52:06,906 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod (+ c_main_~x~0 1) 4294967296)) (or (and (< 6 c_main_~y~0) (< 0 (mod (+ c_main_~x~0 c_main_~y~0) 4294967296)) (forall ((v_it_39 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_39) c_main_~x~0 c_main_~y~0) 4294967296)) (not (<= (+ 7 v_it_39) c_main_~y~0)) (not (<= 1 v_it_39))))) (= (+ (- 6) c_main_~y~0) 0)) (< 0 (mod (+ 3 c_main_~x~0) 4294967296)) (< 0 (mod (+ 5 c_main_~x~0) 4294967296)) (< 0 (mod (+ 6 c_main_~x~0) 4294967296)) (< 0 (mod (+ 4 c_main_~x~0) 4294967296)) (< 0 (mod (+ 2 c_main_~x~0) 4294967296))) is different from false [2022-04-28 03:52:06,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:06,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154699071] [2022-04-28 03:52:06,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154699071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:06,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:06,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:52:06,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273814298] [2022-04-28 03:52:06,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:52:06,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:06,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:52:11,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 36 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:11,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:52:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:11,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:52:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2055, Unknown=5, NotChecked=190, Total=2550 [2022-04-28 03:52:11,661 INFO L87 Difference]: Start difference. First operand 216 states and 290 transitions. Second operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:52:58,099 WARN L232 SmtUtils]: Spent 12.99s on a formula simplification. DAG size of input: 74 DAG size of output: 48 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:53:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:02,147 INFO L93 Difference]: Finished difference Result 265 states and 371 transitions. [2022-04-28 03:53:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:53:02,148 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:53:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:53:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-28 03:53:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:53:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-28 03:53:02,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 83 transitions. [2022-04-28 03:53:09,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 80 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:09,601 INFO L225 Difference]: With dead ends: 265 [2022-04-28 03:53:09,601 INFO L226 Difference]: Without dead ends: 260 [2022-04-28 03:53:09,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 80.6s TimeCoverageRelationStatistics Valid=590, Invalid=3831, Unknown=9, NotChecked=262, Total=4692 [2022-04-28 03:53:09,602 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:09,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 70 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 249 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-04-28 03:53:09,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-04-28 03:53:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2022-04-28 03:53:11,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:11,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,946 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,947 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:11,950 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2022-04-28 03:53:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2022-04-28 03:53:11,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:11,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:11,950 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 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 260 states. [2022-04-28 03:53:11,951 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 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 260 states. [2022-04-28 03:53:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:11,953 INFO L93 Difference]: Finished difference Result 260 states and 351 transitions. [2022-04-28 03:53:11,953 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 351 transitions. [2022-04-28 03:53:11,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:11,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:11,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:11,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.3349514563106797) internal successors, (275), 206 states have internal predecessors, (275), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:11,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 279 transitions. [2022-04-28 03:53:11,956 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 279 transitions. Word has length 44 [2022-04-28 03:53:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:11,956 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 279 transitions. [2022-04-28 03:53:11,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 26 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-28 03:53:11,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 279 transitions. [2022-04-28 03:53:34,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 276 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:34,210 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 279 transitions. [2022-04-28 03:53:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:53:34,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:34,211 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:34,227 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-28 03:53:34,411 WARN L477 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-28 03:53:34,411 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:34,412 INFO L85 PathProgramCache]: Analyzing trace with hash -107841918, now seen corresponding path program 13 times [2022-04-28 03:53:34,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:34,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144770910] [2022-04-28 03:53:36,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-28 03:53:36,640 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:36,642 INFO L85 PathProgramCache]: Analyzing trace with hash 197882766, now seen corresponding path program 1 times [2022-04-28 03:53:36,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:36,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18271364] [2022-04-28 03:53:36,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:36,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:36,661 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-28 03:53:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:36,692 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-28 03:53:36,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:36,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {44806#(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); {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44792#true} {44792#true} #83#return; {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44806#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:36,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {44806#(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); {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #83#return; {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret15 := main(); {44792#true} is VALID [2022-04-28 03:53:36,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} [165] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_612 4294967296)) (.cse1 (= |v_main_#t~post5_194| |v_main_#t~post5_193|)) (.cse2 (= v_main_~x~0_612 v_main_~x~0_611)) (.cse3 (= v_main_~y~0_784 v_main_~y~0_783)) (.cse4 (= |v_main_#t~post6_194| |v_main_#t~post6_193|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= (+ v_main_~x~0_612 (* v_main_~x~0_611 (- 1)) v_main_~y~0_784) v_main_~y~0_783) (< v_main_~x~0_611 v_main_~x~0_612) (forall ((v_it_40 Int)) (or (not (<= 1 v_it_40)) (not (<= (+ v_main_~x~0_611 v_it_40 1) v_main_~x~0_612)) (< 0 (mod (+ v_main_~x~0_612 (* 4294967295 v_it_40)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_784, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_783, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#true} [164] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} ~z~0 := ~y~0; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {44792#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; {44792#true} is VALID [2022-04-28 03:53:36,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {44792#true} assume !(~z~0 % 4294967296 > 0); {44797#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:53:36,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {44797#(<= 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; {44798#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:53:36,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {44798#(<= 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; {44799#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:53:36,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {44799#(<= 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; {44800#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:36,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {44800#(<= 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; {44801#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:53:36,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {44801#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {44802#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 5))} is VALID [2022-04-28 03:53:36,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {44802#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {44803#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:36,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {44803#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {44804#(<= main_~z~0 (+ 7 (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:36,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {44804#(<= main_~z~0 (+ 7 (* (div (+ main_~z~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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,875 INFO L290 TraceCheckUtils]: 27: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {44805#(<= (+ 8 (* (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; {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:36,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {44805#(<= (+ 8 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:36,878 INFO L272 TraceCheckUtils]: 35: Hoare triple {44793#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44793#false} is VALID [2022-04-28 03:53:36,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {44793#false} ~cond := #in~cond; {44793#false} is VALID [2022-04-28 03:53:36,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {44793#false} assume 0 == ~cond; {44793#false} is VALID [2022-04-28 03:53:36,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-28 03:53:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 03:53:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:36,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18271364] [2022-04-28 03:53:36,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18271364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:36,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787064668] [2022-04-28 03:53:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:36,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:36,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:36,880 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-28 03:53:36,881 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-28 03:53:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:36,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:53:36,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:36,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:37,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44792#true} is VALID [2022-04-28 03:53:37,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#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); {44792#true} is VALID [2022-04-28 03:53:37,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 03:53:37,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #83#return; {44792#true} is VALID [2022-04-28 03:53:37,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret15 := main(); {44792#true} is VALID [2022-04-28 03:53:37,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44792#true} is VALID [2022-04-28 03:53:37,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} [165] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_612 4294967296)) (.cse1 (= |v_main_#t~post5_194| |v_main_#t~post5_193|)) (.cse2 (= v_main_~x~0_612 v_main_~x~0_611)) (.cse3 (= v_main_~y~0_784 v_main_~y~0_783)) (.cse4 (= |v_main_#t~post6_194| |v_main_#t~post6_193|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= (+ v_main_~x~0_612 (* v_main_~x~0_611 (- 1)) v_main_~y~0_784) v_main_~y~0_783) (< v_main_~x~0_611 v_main_~x~0_612) (forall ((v_it_40 Int)) (or (not (<= 1 v_it_40)) (not (<= (+ v_main_~x~0_611 v_it_40 1) v_main_~x~0_612)) (< 0 (mod (+ v_main_~x~0_612 (* 4294967295 v_it_40)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_784, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_783, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44792#true} is VALID [2022-04-28 03:53:37,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#true} [164] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {44792#true} is VALID [2022-04-28 03:53:37,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} ~z~0 := ~y~0; {44834#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:53:37,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {44834#(= 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; {44838#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:53:37,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {44838#(= 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; {44842#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:53:37,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {44842#(= (+ 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; {44846#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:53:37,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {44846#(= (+ (- 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; {44850#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:53:37,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {44850#(= (+ 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; {44854#(= (+ main_~y~0 (- 3)) (+ main_~z~0 2))} is VALID [2022-04-28 03:53:37,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {44854#(= (+ 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; {44858#(= (+ main_~y~0 (- 3)) (+ main_~z~0 3))} is VALID [2022-04-28 03:53:37,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {44858#(= (+ 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; {44862#(= (+ main_~y~0 (- 3)) (+ main_~z~0 4))} is VALID [2022-04-28 03:53:37,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {44862#(= (+ main_~y~0 (- 3)) (+ main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {44866#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:53:37,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {44866#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44870#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:37,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {44870#(not (< 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; {44874#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:37,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {44874#(not (< 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; {44878#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:37,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {44878#(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; {44882#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:53:37,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {44882#(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; {44886#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:53:37,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {44886#(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; {44890#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:53:37,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {44890#(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; {44894#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:37,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {44894#(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; {44793#false} is VALID [2022-04-28 03:53:37,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {44793#false} assume !(~y~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:37,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {44793#false} assume !(~x~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {44793#false} assume !(~z~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L272 TraceCheckUtils]: 35: Hoare triple {44793#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {44793#false} ~cond := #in~cond; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {44793#false} assume 0 == ~cond; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-28 03:53:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 03:53:37,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {44793#false} assume !false; {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {44793#false} assume 0 == ~cond; {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {44793#false} ~cond := #in~cond; {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L272 TraceCheckUtils]: 35: Hoare triple {44793#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 34: Hoare triple {44793#false} assume !(~z~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {44793#false} assume !(~x~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 27: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 26: Hoare triple {44793#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; {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 25: Hoare triple {44793#false} assume !(~y~0 % 4294967296 > 0); {44793#false} is VALID [2022-04-28 03:53:37,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {44894#(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; {44793#false} is VALID [2022-04-28 03:53:37,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {44890#(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; {44894#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:37,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {44886#(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; {44890#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:53:37,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {44882#(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; {44886#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:53:37,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {44878#(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; {44882#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:53:37,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {44874#(not (< 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; {44878#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:37,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {44870#(not (< 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; {44874#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:37,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {44866#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {44870#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:37,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {45006#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {44866#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:53:37,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {45010#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {45006#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:53:37,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {45014#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {45010#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:53:37,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {45018#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {45014#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:53:37,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {45022#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {45018#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:53:37,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {45026#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {45022#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:53:37,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {45030#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45026#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:53:37,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {45034#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {45030#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:53:37,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {44792#true} ~z~0 := ~y~0; {45034#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:53:37,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {44792#true} [164] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {44792#true} [165] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_612 4294967296)) (.cse1 (= |v_main_#t~post5_194| |v_main_#t~post5_193|)) (.cse2 (= v_main_~x~0_612 v_main_~x~0_611)) (.cse3 (= v_main_~y~0_784 v_main_~y~0_783)) (.cse4 (= |v_main_#t~post6_194| |v_main_#t~post6_193|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (= (+ v_main_~x~0_612 (* v_main_~x~0_611 (- 1)) v_main_~y~0_784) v_main_~y~0_783) (< v_main_~x~0_611 v_main_~x~0_612) (forall ((v_it_40 Int)) (or (not (<= 1 v_it_40)) (not (<= (+ v_main_~x~0_611 v_it_40 1) v_main_~x~0_612)) (< 0 (mod (+ v_main_~x~0_612 (* 4294967295 v_it_40)) 4294967296))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_784, main_#t~post5=|v_main_#t~post5_194|, main_~x~0=v_main_~x~0_612, main_#t~post6=|v_main_#t~post6_194|} OutVars{main_~y~0=v_main_~y~0_783, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_611, main_#t~post6=|v_main_#t~post6_193|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {44792#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {44792#true} call #t~ret15 := main(); {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44792#true} {44792#true} #83#return; {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {44792#true} assume true; {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {44792#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); {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {44792#true} call ULTIMATE.init(); {44792#true} is VALID [2022-04-28 03:53:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 03:53:37,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787064668] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:37,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:37,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 36 [2022-04-28 03:53:38,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144770910] [2022-04-28 03:53:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144770910] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:38,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:38,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:53:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671815625] [2022-04-28 03:53:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:38,881 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 44 [2022-04-28 03:53:38,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:38,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:53:39,006 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-28 03:53:39,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:53:39,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:39,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:53:39,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 03:53:39,007 INFO L87 Difference]: Start difference. First operand 211 states and 279 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:53:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:55,862 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2022-04-28 03:53:55,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:53:55,862 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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 44 [2022-04-28 03:53:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:53:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 130 transitions. [2022-04-28 03:53:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:53:55,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 130 transitions. [2022-04-28 03:53:55,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 130 transitions. [2022-04-28 03:53:56,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:56,627 INFO L225 Difference]: With dead ends: 423 [2022-04-28 03:53:56,627 INFO L226 Difference]: Without dead ends: 417 [2022-04-28 03:53:56,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=972, Invalid=6338, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:53:56,628 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 79 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:56,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:53:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-04-28 03:53:59,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 240. [2022-04-28 03:53:59,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:59,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 417 states. Second operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:59,250 INFO L74 IsIncluded]: Start isIncluded. First operand 417 states. Second operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:59,250 INFO L87 Difference]: Start difference. First operand 417 states. Second operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:59,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:59,255 INFO L93 Difference]: Finished difference Result 417 states and 512 transitions. [2022-04-28 03:53:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 512 transitions. [2022-04-28 03:53:59,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:59,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:59,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 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 417 states. [2022-04-28 03:53:59,256 INFO L87 Difference]: Start difference. First operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 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 417 states. [2022-04-28 03:53:59,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:59,262 INFO L93 Difference]: Finished difference Result 417 states and 512 transitions. [2022-04-28 03:53:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 512 transitions. [2022-04-28 03:53:59,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:59,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:59,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:59,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:59,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 235 states have (on average 1.3574468085106384) internal successors, (319), 235 states have internal predecessors, (319), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2022-04-28 03:53:59,266 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 44 [2022-04-28 03:53:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:59,266 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2022-04-28 03:53:59,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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-28 03:53:59,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 240 states and 323 transitions. [2022-04-28 03:54:24,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 323 edges. 319 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:24,614 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2022-04-28 03:54:24,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:54:24,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:24,614 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:24,630 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-28 03:54:24,815 WARN L477 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-28 03:54:24,815 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:24,815 INFO L85 PathProgramCache]: Analyzing trace with hash 986362945, now seen corresponding path program 24 times [2022-04-28 03:54:24,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:24,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [901994718] [2022-04-28 03:54:25,049 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-28 03:54:25,050 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -442476299, now seen corresponding path program 1 times [2022-04-28 03:54:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:25,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082232310] [2022-04-28 03:54:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:25,076 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-28 03:54:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:25,113 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_41.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:54:25,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:25,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {47339#(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); {47324#true} is VALID [2022-04-28 03:54:25,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {47324#true} assume true; {47324#true} is VALID [2022-04-28 03:54:25,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47324#true} {47324#true} #83#return; {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {47324#true} call ULTIMATE.init(); {47339#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {47339#(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); {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {47324#true} assume true; {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47324#true} {47324#true} #83#return; {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {47324#true} call #t~ret15 := main(); {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {47324#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {47324#true} [167] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_638 v_main_~x~0_637)) (.cse2 (= v_main_~y~0_818 v_main_~y~0_817)) (.cse3 (= |v_main_#t~post6_199| |v_main_#t~post6_198|)) (.cse4 (= |v_main_#t~post5_199| |v_main_#t~post5_198|)) (.cse0 (mod v_main_~x~0_638 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_637 v_main_~x~0_638) (forall ((v_it_41 Int)) (or (not (<= 1 v_it_41)) (not (<= (+ v_main_~x~0_637 v_it_41 1) v_main_~x~0_638)) (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_638) 4294967296)))) (= v_main_~y~0_817 (+ v_main_~x~0_638 v_main_~y~0_818 (* v_main_~x~0_637 (- 1))))))) InVars {main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_638, main_#t~post6=|v_main_#t~post6_199|} OutVars{main_~y~0=v_main_~y~0_817, main_#t~post5=|v_main_#t~post5_198|, main_~x~0=v_main_~x~0_637, main_#t~post6=|v_main_#t~post6_198|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {47324#true} [166] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {47324#true} ~z~0 := ~y~0; {47324#true} is VALID [2022-04-28 03:54:25,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {47324#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; {47324#true} is VALID [2022-04-28 03:54:25,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {47324#true} assume !(~z~0 % 4294967296 > 0); {47329#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:54:25,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {47329#(<= 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; {47330#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:54:25,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {47330#(<= 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; {47331#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:54:25,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {47331#(<= 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; {47332#(<= main_~z~0 (+ 3 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:25,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {47332#(<= 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; {47333#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:54:25,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {47333#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 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; {47334#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 5))} is VALID [2022-04-28 03:54:25,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {47334#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {47335#(<= main_~z~0 (+ 6 (* (div (+ main_~z~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:25,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {47335#(<= main_~z~0 (+ 6 (* (div (+ main_~z~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; {47336#(<= main_~z~0 (+ 7 (* (div (+ main_~z~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:25,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {47336#(<= main_~z~0 (+ 7 (* (div (+ main_~z~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; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !(~y~0 % 4294967296 > 0); {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,296 INFO L290 TraceCheckUtils]: 32: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !(~x~0 % 4294967296 > 0); {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} is VALID [2022-04-28 03:54:25,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {47337#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 8)) 4294967296) 4294967296) 8))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47338#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:54:25,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {47338#(<= (+ 7 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:25,298 INFO L272 TraceCheckUtils]: 36: Hoare triple {47325#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47325#false} is VALID [2022-04-28 03:54:25,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {47325#false} ~cond := #in~cond; {47325#false} is VALID [2022-04-28 03:54:25,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {47325#false} assume 0 == ~cond; {47325#false} is VALID [2022-04-28 03:54:25,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {47325#false} assume !false; {47325#false} is VALID [2022-04-28 03:54:25,299 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 03:54:25,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:25,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082232310] [2022-04-28 03:54:25,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082232310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:25,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894566300] [2022-04-28 03:54:25,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:25,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:25,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:25,300 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-28 03:54:25,301 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-28 03:54:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:25,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:54:25,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:25,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:25,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {47324#true} call ULTIMATE.init(); {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {47324#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); {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {47324#true} assume true; {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47324#true} {47324#true} #83#return; {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {47324#true} call #t~ret15 := main(); {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {47324#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {47324#true} [167] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_638 v_main_~x~0_637)) (.cse2 (= v_main_~y~0_818 v_main_~y~0_817)) (.cse3 (= |v_main_#t~post6_199| |v_main_#t~post6_198|)) (.cse4 (= |v_main_#t~post5_199| |v_main_#t~post5_198|)) (.cse0 (mod v_main_~x~0_638 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_637 v_main_~x~0_638) (forall ((v_it_41 Int)) (or (not (<= 1 v_it_41)) (not (<= (+ v_main_~x~0_637 v_it_41 1) v_main_~x~0_638)) (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_638) 4294967296)))) (= v_main_~y~0_817 (+ v_main_~x~0_638 v_main_~y~0_818 (* v_main_~x~0_637 (- 1))))))) InVars {main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_638, main_#t~post6=|v_main_#t~post6_199|} OutVars{main_~y~0=v_main_~y~0_817, main_#t~post5=|v_main_#t~post5_198|, main_~x~0=v_main_~x~0_637, main_#t~post6=|v_main_#t~post6_198|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47324#true} is VALID [2022-04-28 03:54:25,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {47324#true} [166] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {47324#true} is VALID [2022-04-28 03:54:25,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {47324#true} ~z~0 := ~y~0; {47367#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:54:25,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {47367#(= 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; {47371#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:54:25,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {47371#(= 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; {47375#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:54:25,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {47375#(= 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; {47379#(= main_~y~0 (+ main_~z~0 3))} is VALID [2022-04-28 03:54:25,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {47379#(= 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; {47383#(= main_~y~0 (+ main_~z~0 4))} is VALID [2022-04-28 03:54:25,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {47383#(= 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; {47387#(= (+ main_~y~0 (- 4)) (+ main_~z~0 1))} is VALID [2022-04-28 03:54:25,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {47387#(= (+ 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; {47391#(= (+ main_~y~0 (- 4)) (+ main_~z~0 2))} is VALID [2022-04-28 03:54:25,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {47391#(= (+ 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; {47395#(= (+ main_~y~0 (- 4)) (+ main_~z~0 3))} is VALID [2022-04-28 03:54:25,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {47395#(= (+ main_~y~0 (- 4)) (+ main_~z~0 3))} assume !(~z~0 % 4294967296 > 0); {47399#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:54:25,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {47399#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47403#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:54:25,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {47403#(not (< 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; {47407#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:54:25,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {47407#(not (< 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; {47411#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:54:25,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {47411#(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; {47415#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:25,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {47415#(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; {47419#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:54:25,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {47419#(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; {47423#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {47423#(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; {47427#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {47427#(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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {47325#false} assume !(~y~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:25,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {47325#false} assume !(~x~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {47325#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {47325#false} assume !(~z~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L272 TraceCheckUtils]: 36: Hoare triple {47325#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {47325#false} ~cond := #in~cond; {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {47325#false} assume 0 == ~cond; {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {47325#false} assume !false; {47325#false} is VALID [2022-04-28 03:54:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 03:54:25,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:26,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {47325#false} assume !false; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {47325#false} assume 0 == ~cond; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {47325#false} ~cond := #in~cond; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L272 TraceCheckUtils]: 36: Hoare triple {47325#false} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {47325#false} assume !(~z~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {47325#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {47325#false} assume !(~x~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 30: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {47325#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; {47325#false} is VALID [2022-04-28 03:54:26,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {47325#false} assume !(~y~0 % 4294967296 > 0); {47325#false} is VALID [2022-04-28 03:54:26,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {47427#(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; {47325#false} is VALID [2022-04-28 03:54:26,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {47423#(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; {47427#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:54:26,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {47419#(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; {47423#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:54:26,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {47415#(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; {47419#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:54:26,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {47411#(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; {47415#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:26,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {47407#(not (< 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; {47411#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:54:26,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {47403#(not (< 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; {47407#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:54:26,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {47399#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47403#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:54:26,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {47545#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {47399#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:54:26,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {47549#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {47545#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:54:26,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {47553#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {47549#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:54:26,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {47557#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {47553#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:54:26,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {47561#(or (not (< 0 (mod (+ main_~y~0 4294967289) 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; {47557#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:26,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {47565#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 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; {47561#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:54:26,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {47569#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47565#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:54:26,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {47573#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47569#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:54:26,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {47324#true} ~z~0 := ~y~0; {47573#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 03:54:26,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {47324#true} [166] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {47324#true} is VALID [2022-04-28 03:54:26,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {47324#true} [167] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_638 v_main_~x~0_637)) (.cse2 (= v_main_~y~0_818 v_main_~y~0_817)) (.cse3 (= |v_main_#t~post6_199| |v_main_#t~post6_198|)) (.cse4 (= |v_main_#t~post5_199| |v_main_#t~post5_198|)) (.cse0 (mod v_main_~x~0_638 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_637 v_main_~x~0_638) (forall ((v_it_41 Int)) (or (not (<= 1 v_it_41)) (not (<= (+ v_main_~x~0_637 v_it_41 1) v_main_~x~0_638)) (< 0 (mod (+ (* 4294967295 v_it_41) v_main_~x~0_638) 4294967296)))) (= v_main_~y~0_817 (+ v_main_~x~0_638 v_main_~y~0_818 (* v_main_~x~0_637 (- 1))))))) InVars {main_~y~0=v_main_~y~0_818, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_638, main_#t~post6=|v_main_#t~post6_199|} OutVars{main_~y~0=v_main_~y~0_817, main_#t~post5=|v_main_#t~post5_198|, main_~x~0=v_main_~x~0_637, main_#t~post6=|v_main_#t~post6_198|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {47324#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {47324#true} call #t~ret15 := main(); {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47324#true} {47324#true} #83#return; {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {47324#true} assume true; {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {47324#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); {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {47324#true} call ULTIMATE.init(); {47324#true} is VALID [2022-04-28 03:54:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 03:54:26,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894566300] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:26,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:26,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 37 [2022-04-28 03:54:27,323 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:27,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [901994718] [2022-04-28 03:54:27,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [901994718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:27,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:27,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:54:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3650530] [2022-04-28 03:54:27,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 45 [2022-04-28 03:54:27,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:27,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-28 03:54:27,421 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-28 03:54:27,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:54:27,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:27,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:54:27,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 03:54:27,422 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-28 03:54:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:46,057 INFO L93 Difference]: Finished difference Result 504 states and 638 transitions. [2022-04-28 03:54:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:54:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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 45 [2022-04-28 03:54:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:46,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-28 03:54:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 154 transitions. [2022-04-28 03:54:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-28 03:54:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 154 transitions. [2022-04-28 03:54:46,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 154 transitions. [2022-04-28 03:54:46,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:46,832 INFO L225 Difference]: With dead ends: 504 [2022-04-28 03:54:46,832 INFO L226 Difference]: Without dead ends: 498 [2022-04-28 03:54:46,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1193, Invalid=7549, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:54:46,833 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 91 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:46,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 83 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:54:46,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-04-28 03:54:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 264. [2022-04-28 03:54:49,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:49,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 498 states. Second operand has 264 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:49,672 INFO L74 IsIncluded]: Start isIncluded. First operand 498 states. Second operand has 264 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:49,672 INFO L87 Difference]: Start difference. First operand 498 states. Second operand has 264 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:49,680 INFO L93 Difference]: Finished difference Result 498 states and 608 transitions. [2022-04-28 03:54:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 608 transitions. [2022-04-28 03:54:49,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:49,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:49,680 INFO L74 IsIncluded]: Start isIncluded. First operand has 264 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 3 states have call successors, (3), 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 498 states. [2022-04-28 03:54:49,680 INFO L87 Difference]: Start difference. First operand has 264 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 3 states have call successors, (3), 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 498 states. [2022-04-28 03:54:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:49,688 INFO L93 Difference]: Finished difference Result 498 states and 608 transitions. [2022-04-28 03:54:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 608 transitions. [2022-04-28 03:54:49,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:49,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:49,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:49,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 259 states have (on average 1.359073359073359) internal successors, (352), 259 states have internal predecessors, (352), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:49,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 356 transitions. [2022-04-28 03:54:49,692 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 356 transitions. Word has length 45 [2022-04-28 03:54:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:49,692 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 356 transitions. [2022-04-28 03:54:49,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 18 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-28 03:54:49,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 264 states and 356 transitions. [2022-04-28 03:55:15,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 351 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 356 transitions. [2022-04-28 03:55:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:55:15,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:15,381 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:15,397 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-28 03:55:15,581 WARN L477 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-28 03:55:15,582 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash 284721058, now seen corresponding path program 25 times [2022-04-28 03:55:15,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:15,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1328712861] [2022-04-28 03:55:15,802 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-28 03:55:15,803 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:15,805 INFO L85 PathProgramCache]: Analyzing trace with hash 147355950, now seen corresponding path program 1 times [2022-04-28 03:55:15,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:15,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340179060] [2022-04-28 03:55:15,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:15,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:15,830 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-28 03:55:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:15,857 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-28 03:55:16,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:16,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {50271#(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); {50249#true} is VALID [2022-04-28 03:55:16,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {50249#true} assume true; {50249#true} is VALID [2022-04-28 03:55:16,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50249#true} {50249#true} #83#return; {50249#true} is VALID [2022-04-28 03:55:16,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {50249#true} call ULTIMATE.init(); {50271#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:16,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {50271#(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); {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {50249#true} assume true; {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50249#true} {50249#true} #83#return; {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {50249#true} call #t~ret15 := main(); {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {50249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {50249#true} [169] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_664 4294967296)) (.cse1 (= v_main_~y~0_853 v_main_~y~0_852)) (.cse2 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse3 (= |v_main_#t~post6_204| |v_main_#t~post6_203|)) (.cse4 (= |v_main_#t~post5_204| |v_main_#t~post5_203|))) (or (and (< 0 .cse0) (< v_main_~y~0_853 v_main_~y~0_852) (forall ((v_it_42 Int)) (or (not (<= 1 v_it_42)) (not (<= (+ v_main_~y~0_853 v_it_42 1) v_main_~y~0_852)) (< 0 (mod (+ v_main_~x~0_664 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_663 (+ v_main_~x~0_664 v_main_~y~0_853 (* (- 1) v_main_~y~0_852)))) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_853, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_664, main_#t~post6=|v_main_#t~post6_204|} OutVars{main_~y~0=v_main_~y~0_852, main_#t~post5=|v_main_#t~post5_203|, main_~x~0=v_main_~x~0_663, main_#t~post6=|v_main_#t~post6_203|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {50249#true} [168] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {50249#true} is VALID [2022-04-28 03:55:16,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {50249#true} ~z~0 := ~y~0; {50254#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:55:16,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {50254#(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; {50255#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:55:16,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {50255#(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; {50256#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:55:16,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {50256#(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; {50257#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:55:16,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {50257#(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; {50258#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:55:16,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {50258#(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; {50259#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:55:16,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {50259#(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; {50260#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:55:16,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {50260#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {50261#(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-28 03:55:16,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {50261#(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; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {50262#(<= 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; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {50263#(<= 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; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {50264#(<= 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; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {50265#(<= 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; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:16,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {50266#(<= 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; {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {50267#(<= 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; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:16,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {50266#(<= 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; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {50265#(<= main_~y~0 (+ 2 (* (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; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {50264#(<= main_~y~0 (+ 3 (* (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; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:16,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:16,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,273 INFO L290 TraceCheckUtils]: 34: Hoare triple {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:16,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,275 INFO L290 TraceCheckUtils]: 36: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,275 INFO L272 TraceCheckUtils]: 37: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {50269#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:16,275 INFO L290 TraceCheckUtils]: 38: Hoare triple {50269#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {50270#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:16,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {50270#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {50250#false} is VALID [2022-04-28 03:55:16,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {50250#false} assume !false; {50250#false} is VALID [2022-04-28 03:55:16,276 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:16,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:16,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340179060] [2022-04-28 03:55:16,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340179060] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:16,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165037597] [2022-04-28 03:55:16,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:16,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:16,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:16,278 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-28 03:55:16,279 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-28 03:55:16,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:16,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 03:55:16,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:16,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:16,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {50249#true} call ULTIMATE.init(); {50249#true} is VALID [2022-04-28 03:55:16,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {50249#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); {50249#true} is VALID [2022-04-28 03:55:16,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {50249#true} assume true; {50249#true} is VALID [2022-04-28 03:55:16,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50249#true} {50249#true} #83#return; {50249#true} is VALID [2022-04-28 03:55:16,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {50249#true} call #t~ret15 := main(); {50249#true} is VALID [2022-04-28 03:55:16,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {50249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50249#true} is VALID [2022-04-28 03:55:16,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {50249#true} [169] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_664 4294967296)) (.cse1 (= v_main_~y~0_853 v_main_~y~0_852)) (.cse2 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse3 (= |v_main_#t~post6_204| |v_main_#t~post6_203|)) (.cse4 (= |v_main_#t~post5_204| |v_main_#t~post5_203|))) (or (and (< 0 .cse0) (< v_main_~y~0_853 v_main_~y~0_852) (forall ((v_it_42 Int)) (or (not (<= 1 v_it_42)) (not (<= (+ v_main_~y~0_853 v_it_42 1) v_main_~y~0_852)) (< 0 (mod (+ v_main_~x~0_664 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_663 (+ v_main_~x~0_664 v_main_~y~0_853 (* (- 1) v_main_~y~0_852)))) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_853, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_664, main_#t~post6=|v_main_#t~post6_204|} OutVars{main_~y~0=v_main_~y~0_852, main_#t~post5=|v_main_#t~post5_203|, main_~x~0=v_main_~x~0_663, main_#t~post6=|v_main_#t~post6_203|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50249#true} is VALID [2022-04-28 03:55:16,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {50249#true} [168] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {50249#true} is VALID [2022-04-28 03:55:16,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {50249#true} ~z~0 := ~y~0; {50254#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:55:16,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {50254#(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; {50255#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:55:16,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {50255#(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; {50256#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:55:16,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {50256#(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; {50257#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:55:16,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {50257#(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; {50258#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:55:16,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {50258#(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; {50259#(and (<= main_~y~0 (+ 5 main_~z~0)) (<= (+ 5 main_~z~0) main_~y~0))} is VALID [2022-04-28 03:55:16,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {50259#(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; {50260#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} is VALID [2022-04-28 03:55:16,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {50260#(and (<= (+ main_~z~0 6) main_~y~0) (<= main_~y~0 (+ main_~z~0 6)))} assume !(~z~0 % 4294967296 > 0); {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:16,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~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; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {50262#(<= 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; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {50263#(<= 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; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {50264#(<= 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; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {50265#(<= 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; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:16,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {50266#(<= 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; {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {50267#(<= 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; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:16,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {50266#(<= 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; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {50265#(<= main_~y~0 (+ 2 (* (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; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {50264#(<= main_~y~0 (+ 3 (* (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; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:16,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:16,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,814 INFO L290 TraceCheckUtils]: 32: Hoare triple {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:16,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:16,816 INFO L290 TraceCheckUtils]: 35: Hoare triple {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:16,817 INFO L272 TraceCheckUtils]: 37: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {50386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:16,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {50386#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:16,818 INFO L290 TraceCheckUtils]: 39: Hoare triple {50390#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50250#false} is VALID [2022-04-28 03:55:16,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {50250#false} assume !false; {50250#false} is VALID [2022-04-28 03:55:16,818 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:16,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:17,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {50250#false} assume !false; {50250#false} is VALID [2022-04-28 03:55:17,482 INFO L290 TraceCheckUtils]: 39: Hoare triple {50390#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50250#false} is VALID [2022-04-28 03:55:17,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {50386#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50390#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:55:17,483 INFO L272 TraceCheckUtils]: 37: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} call __VERIFIER_assert((if 0 == ~y~0 % 4294967296 then 1 else 0)); {50386#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:55:17,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:17,485 INFO L290 TraceCheckUtils]: 35: Hoare triple {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:17,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:17,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,488 INFO L290 TraceCheckUtils]: 31: Hoare triple {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~y~0;~y~0 := #t~post13 - 1;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:17,491 INFO L290 TraceCheckUtils]: 28: Hoare triple {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 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; {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:17,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~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; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {50264#(<= main_~y~0 (+ 3 (* (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; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,493 INFO L290 TraceCheckUtils]: 25: Hoare triple {50265#(<= main_~y~0 (+ 2 (* (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; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {50266#(<= 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; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {50267#(<= 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; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:17,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:17,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {50266#(<= 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; {50267#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:55:17,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {50265#(<= 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; {50266#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:55:17,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {50264#(<= 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; {50265#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {50263#(<= 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; {50264#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {50262#(<= 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; {50263#(<= main_~y~0 (+ 4 (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~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; {50262#(<= main_~y~0 (+ 5 (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:55:17,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {50472#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {50268#(<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296))))} is VALID [2022-04-28 03:55:17,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {50476#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50472#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:55:17,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {50480#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50476#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:55:17,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {50484#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50480#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:55:17,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {50488#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50484#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:55:17,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {50492#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50488#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:55:17,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {50496#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {50492#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))))} is VALID [2022-04-28 03:55:17,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {50249#true} ~z~0 := ~y~0; {50496#(or (<= main_~y~0 (+ 6 (* 4294967296 (div (+ main_~y~0 (- 6)) 4294967296)))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:55:17,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {50249#true} [168] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {50249#true} [169] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_664 4294967296)) (.cse1 (= v_main_~y~0_853 v_main_~y~0_852)) (.cse2 (= v_main_~x~0_664 v_main_~x~0_663)) (.cse3 (= |v_main_#t~post6_204| |v_main_#t~post6_203|)) (.cse4 (= |v_main_#t~post5_204| |v_main_#t~post5_203|))) (or (and (< 0 .cse0) (< v_main_~y~0_853 v_main_~y~0_852) (forall ((v_it_42 Int)) (or (not (<= 1 v_it_42)) (not (<= (+ v_main_~y~0_853 v_it_42 1) v_main_~y~0_852)) (< 0 (mod (+ v_main_~x~0_664 (* 4294967295 v_it_42)) 4294967296)))) (= v_main_~x~0_663 (+ v_main_~x~0_664 v_main_~y~0_853 (* (- 1) v_main_~y~0_852)))) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_853, main_#t~post5=|v_main_#t~post5_204|, main_~x~0=v_main_~x~0_664, main_#t~post6=|v_main_#t~post6_204|} OutVars{main_~y~0=v_main_~y~0_852, main_#t~post5=|v_main_#t~post5_203|, main_~x~0=v_main_~x~0_663, main_#t~post6=|v_main_#t~post6_203|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {50249#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {50249#true} call #t~ret15 := main(); {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50249#true} {50249#true} #83#return; {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {50249#true} assume true; {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {50249#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); {50249#true} is VALID [2022-04-28 03:55:17,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {50249#true} call ULTIMATE.init(); {50249#true} is VALID [2022-04-28 03:55:17,511 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:55:17,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165037597] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:17,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:17,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 29 [2022-04-28 03:55:18,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:18,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1328712861] [2022-04-28 03:55:18,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1328712861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:18,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:18,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:55:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811093884] [2022-04-28 03:55:18,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:18,204 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 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 46 [2022-04-28 03:55:18,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:18,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:55:18,275 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-28 03:55:18,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:55:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:55:18,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1084, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:55:18,276 INFO L87 Difference]: Start difference. First operand 264 states and 356 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 24 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)