/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-de31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:35:39,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:35:39,351 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:35:39,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:35:39,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:35:39,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:35:39,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:35:39,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:35:39,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:35:39,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:35:39,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:35:39,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:35:39,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:35:39,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:35:39,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:35:39,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:35:39,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:35:39,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:35:39,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:35:39,423 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:35:39,424 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:35:39,425 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:35:39,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:35:39,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:35:39,427 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:35:39,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:35:39,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:35:39,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:35:39,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:35:39,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:35:39,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:35:39,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:35:39,434 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:35:39,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:35:39,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:35:39,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:35:39,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:35:39,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:35:39,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:35:39,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:35:39,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:35:39,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:35:39,438 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:35:39,445 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:35:39,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:35:39,448 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:35:39,448 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:35:39,448 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:35:39,448 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:35:39,448 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:35:39,448 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:35:39,448 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:35:39,449 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:35:39,449 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:35:39,450 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:35:39,450 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:35:39,450 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:35:39,450 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:35:39,450 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:35:39,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:35:39,450 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:35:39,450 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:35:39,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:35:39,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:35:39,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:35:39,666 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:35:39,666 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:35:39,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-28 03:35:39,720 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28160933/247399d315894151b95a25f88f43b336/FLAGa93899938 [2022-04-28 03:35:40,070 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:35:40,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-28 03:35:40,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28160933/247399d315894151b95a25f88f43b336/FLAGa93899938 [2022-04-28 03:35:40,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b28160933/247399d315894151b95a25f88f43b336 [2022-04-28 03:35:40,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:35:40,084 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:35:40,085 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:35:40,085 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:35:40,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:35:40,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669363eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40, skipping insertion in model container [2022-04-28 03:35:40,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:35:40,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:35:40,219 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-de31.c[368,381] [2022-04-28 03:35:40,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:35:40,236 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:35:40,243 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-de31.c[368,381] [2022-04-28 03:35:40,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:35:40,255 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:35:40,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40 WrapperNode [2022-04-28 03:35:40,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:35:40,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:35:40,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:35:40,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:35:40,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,269 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,269 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:35:40,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:35:40,278 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:35:40,278 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:35:40,279 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (1/1) ... [2022-04-28 03:35:40,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:35:40,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:35:40,308 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:35:40,316 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:35:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:35:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:35:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:35:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:35:40,343 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:35:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:35:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:35:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:35:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:35:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:35:40,388 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:35:40,389 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:35:40,493 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:35:40,498 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:35:40,498 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 03:35:40,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:35:40 BoogieIcfgContainer [2022-04-28 03:35:40,499 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:35:40,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:35:40,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:35:40,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:35:40,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:35:40" (1/3) ... [2022-04-28 03:35:40,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d84c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:35:40, skipping insertion in model container [2022-04-28 03:35:40,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:40" (2/3) ... [2022-04-28 03:35:40,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@251d84c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:35:40, skipping insertion in model container [2022-04-28 03:35:40,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:35:40" (3/3) ... [2022-04-28 03:35:40,507 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de31.c [2022-04-28 03:35:40,516 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:35:40,516 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:35:40,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:35:40,548 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@4572a906, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c356810 [2022-04-28 03:35:40,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:35:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:35:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:35:40,565 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:40,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:40,566 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:40,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:40,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-28 03:35:40,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:40,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [924944252] [2022-04-28 03:35:40,590 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:35:40,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-28 03:35:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:40,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684256352] [2022-04-28 03:35:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:41,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 03:35:41,044 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:35:41,044 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 03:35:41,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:41,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 03:35:41,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:35:41,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 03:35:41,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-28 03:35:41,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:41,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} is VALID [2022-04-28 03:35:41,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} ~z~0 := ~y~0; {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:35:41,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:35:41,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:35:41,053 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:41,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:41,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-28 03:35:41,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 03:35:41,055 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:35:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:41,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684256352] [2022-04-28 03:35:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684256352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:41,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:41,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [924944252] [2022-04-28 03:35:41,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [924944252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:41,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:41,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:41,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063463657] [2022-04-28 03:35:41,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:35:41,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:41,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:41,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:35:41,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:41,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:35:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:35:41,105 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:41,498 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 03:35:41,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:35:41,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:35:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:41,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 03:35:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 03:35:41,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-28 03:35:41,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:41,599 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:35:41,600 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:35:41,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:35:41,611 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:41,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:35:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:35:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:35:41,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:41,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,630 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,630 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:41,632 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:35:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:35:41,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:41,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:41,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:35:41,633 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:35:41,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:41,634 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 03:35:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:35:41,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:41,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:41,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:41,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:41,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 03:35:41,636 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2022-04-28 03:35:41,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:41,637 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 03:35:41,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:41,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 03:35:41,651 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:35:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 03:35:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:35:41,652 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:41,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:41,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:35:41,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:41,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 1 times [2022-04-28 03:35:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:41,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1116124704] [2022-04-28 03:35:43,858 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:35:44,044 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:35:44,046 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:44,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1152508211, now seen corresponding path program 1 times [2022-04-28 03:35:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311344245] [2022-04-28 03:35:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:44,063 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:44,108 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:44,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:44,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 03:35:44,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 03:35:44,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-28 03:35:44,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:44,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 03:35:44,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 03:35:44,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-28 03:35:44,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID [2022-04-28 03:35:44,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {217#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 03:35:44,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [65] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_8 v_main_~x~0_7)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_9 v_main_~y~0_8)) (.cse4 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (mod v_main_~x~0_8 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (< 0 .cse3) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_8 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8)))) (< v_main_~y~0_9 v_main_~y~0_8) (= v_main_~x~0_7 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_8 v_main_~y~0_9))))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_8, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {218#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:35:44,411 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)))} [64] 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[] {219#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:44,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(or (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {220#(or (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:44,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {220#(or (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {221#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:44,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {221#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {222#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:35:44,415 INFO L272 TraceCheckUtils]: 11: Hoare triple {222#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {223#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:44,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {224#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:44,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {224#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {213#false} is VALID [2022-04-28 03:35:44,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 03:35:44,416 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:35:44,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:44,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311344245] [2022-04-28 03:35:44,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311344245] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:44,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:44,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:35:44,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:44,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1116124704] [2022-04-28 03:35:44,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1116124704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:44,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:44,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:35:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707866526] [2022-04-28 03:35:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:44,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:35:44,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:44,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:44,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:44,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:35:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:44,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:35:44,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:35:44,834 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:45,122 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:35:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:35:45,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:35:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:45,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 03:35:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 03:35:45,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 03:35:45,273 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:35:45,273 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:35:45,274 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:35:45,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:35:45,275 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:45,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 31 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 37 Invalid, 0 Unknown, 16 Unchecked, 0.1s Time] [2022-04-28 03:35:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:35:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:35:45,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:45,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,289 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,289 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:45,290 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:35:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:35:45,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:45,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:45,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:35:45,291 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:35:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:45,292 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:35:45,292 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:35:45,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:45,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:45,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:45,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:35:45,294 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 15 [2022-04-28 03:35:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:45,294 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:35:45,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:45,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:35:46,963 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:35:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:35:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:35:46,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:46,964 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:35:46,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:35:46,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:46,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:46,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1314021247, now seen corresponding path program 1 times [2022-04-28 03:35:46,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:46,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [141716471] [2022-04-28 03:35:47,178 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:35:47,180 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:47,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1046489728, now seen corresponding path program 1 times [2022-04-28 03:35:47,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:47,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983225864] [2022-04-28 03:35:47,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:47,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:47,195 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:35:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,228 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:35:47,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {352#true} is VALID [2022-04-28 03:35:47,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-28 03:35:47,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {352#true} {352#true} #61#return; {352#true} is VALID [2022-04-28 03:35:47,289 INFO L272 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:47,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {359#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {352#true} is VALID [2022-04-28 03:35:47,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2022-04-28 03:35:47,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #61#return; {352#true} is VALID [2022-04-28 03:35:47,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret11 := main(); {352#true} is VALID [2022-04-28 03:35:47,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {352#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {352#true} is VALID [2022-04-28 03:35:47,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {352#true} [67] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_15 4294967296)) (.cse0 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse1 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse2 (= v_main_~x~0_15 v_main_~x~0_14)) (.cse4 (= v_main_~y~0_16 v_main_~y~0_15))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (= v_main_~y~0_15 (+ (* (- 1) v_main_~x~0_14) v_main_~x~0_15 v_main_~y~0_16)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_15 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_14 v_it_2 1) v_main_~x~0_15)))) (< v_main_~x~0_14 v_main_~x~0_15) (< 0 .cse3)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_16, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_15, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_15, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_14, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {352#true} is VALID [2022-04-28 03:35:47,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#true} [66] 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[] {352#true} is VALID [2022-04-28 03:35:47,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {352#true} ~z~0 := ~y~0; {357#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:35:47,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {357#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~z~0 % 4294967296 > 0); {358#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:35:47,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {358#(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; {353#false} is VALID [2022-04-28 03:35:47,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {353#false} assume !(~y~0 % 4294967296 > 0); {353#false} is VALID [2022-04-28 03:35:47,295 INFO L272 TraceCheckUtils]: 12: Hoare triple {353#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {353#false} is VALID [2022-04-28 03:35:47,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {353#false} ~cond := #in~cond; {353#false} is VALID [2022-04-28 03:35:47,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {353#false} assume 0 == ~cond; {353#false} is VALID [2022-04-28 03:35:47,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {353#false} assume !false; {353#false} is VALID [2022-04-28 03:35:47,296 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:35:47,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:47,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983225864] [2022-04-28 03:35:47,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983225864] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:47,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:47,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:35:47,321 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:47,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [141716471] [2022-04-28 03:35:47,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [141716471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:47,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:47,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:35:47,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299669276] [2022-04-28 03:35:47,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:47,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:35:47,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:47,323 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), 5 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:35:47,334 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:35:47,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:35:47,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:35:47,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:35:47,335 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:35:47,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,455 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:35:47,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:35:47,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:35:47,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:35:47,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 03:35:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:35:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 03:35:47,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-28 03:35:47,479 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:35:47,480 INFO L225 Difference]: With dead ends: 25 [2022-04-28 03:35:47,480 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:35:47,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 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:35:47,481 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:47,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:35:47,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:35:47,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:35:47,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:47,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,496 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,496 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,497 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:35:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:35:47,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:47,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:47,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:35:47,498 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:35:47,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,499 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:35:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:35:47,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:47,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:47,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:47,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:47,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 03:35:47,500 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2022-04-28 03:35:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:47,500 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 03:35:47,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:35:47,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 03:35:47,545 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:35:47,546 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:35:47,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:35:47,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:47,546 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:35:47,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:35:47,547 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:47,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:47,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-28 03:35:47,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684472629] [2022-04-28 03:35:47,732 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:35:47,734 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:47,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1495870434, now seen corresponding path program 1 times [2022-04-28 03:35:47,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:47,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175432150] [2022-04-28 03:35:47,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:47,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:47,747 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:35:47,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,791 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {492#true} is VALID [2022-04-28 03:35:48,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} assume true; {492#true} is VALID [2022-04-28 03:35:48,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {492#true} {492#true} #61#return; {492#true} is VALID [2022-04-28 03:35:48,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:48,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {492#true} is VALID [2022-04-28 03:35:48,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2022-04-28 03:35:48,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #61#return; {492#true} is VALID [2022-04-28 03:35:48,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret11 := main(); {492#true} is VALID [2022-04-28 03:35:48,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {497#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {497#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [69] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_22 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse3 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse4 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_22 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_21 v_it_3 1) v_main_~x~0_22)))) (< v_main_~x~0_21 v_main_~x~0_22) (= v_main_~y~0_23 (+ v_main_~x~0_22 v_main_~y~0_24 (* (- 1) v_main_~x~0_21))) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_21, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {498#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} [68] 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[] {499#(or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#(or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0))} ~z~0 := ~y~0; {500#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0)))} is VALID [2022-04-28 03:35:48,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) main_~n~0)) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {501#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div (+ (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0)))} is VALID [2022-04-28 03:35:48,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div (+ (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) main_~z~0)))} assume !(~z~0 % 4294967296 > 0); {502#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) main_~z~0))} is VALID [2022-04-28 03:35:48,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* 4294967296 (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 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; {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:35:48,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:35:48,134 INFO L272 TraceCheckUtils]: 13: Hoare triple {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {504#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:48,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {505#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:48,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {505#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {493#false} is VALID [2022-04-28 03:35:48,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-04-28 03:35:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:35:48,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:48,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175432150] [2022-04-28 03:35:48,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175432150] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:35:48,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074422723] [2022-04-28 03:35:48,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:48,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:35:48,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:35:48,140 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:35:48,141 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:35:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:35:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:05,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2022-04-28 03:36:05,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {492#true} is VALID [2022-04-28 03:36:05,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2022-04-28 03:36:05,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #61#return; {492#true} is VALID [2022-04-28 03:36:05,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret11 := main(); {492#true} is VALID [2022-04-28 03:36:05,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {497#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:05,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {497#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [69] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_22 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse3 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse4 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_22 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_21 v_it_3 1) v_main_~x~0_22)))) (< v_main_~x~0_21 v_main_~x~0_22) (= v_main_~y~0_23 (+ v_main_~x~0_22 v_main_~y~0_24 (* (- 1) v_main_~x~0_21))) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_21, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {528#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:36:05,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [68] 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[] {532#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} is VALID [2022-04-28 03:36:05,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} ~z~0 := ~y~0; {536#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} is VALID [2022-04-28 03:36:05,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {536#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {540#(and (<= (div (+ main_~y~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 4294967296 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_it_3 1) main_~y~0)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:36:05,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {540#(and (<= (div (+ main_~y~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 4294967296 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_it_3 1) main_~y~0)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {544#(and (<= (div (+ main_~y~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 4294967296 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_it_3 1) main_~y~0)))) (< 0 main_~y~0) (<= (mod main_~z~0 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:36:05,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#(and (<= (div (+ main_~y~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 4294967296 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_it_3 1) main_~y~0)))) (< 0 main_~y~0) (<= (mod main_~z~0 4294967296) 0) (= 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; {548#(and (<= (div (+ main_~y~0 (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296)) (<= (mod main_~y~0 4294967296) 0) (= main_~z~0 (+ main_~y~0 1)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= v_it_3 main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:36:05,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {548#(and (<= (div (+ main_~y~0 (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296)) (<= (mod main_~y~0 4294967296) 0) (= main_~z~0 (+ main_~y~0 1)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= v_it_3 main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (+ main_~y~0 1)))} assume !(~y~0 % 4294967296 > 0); {552#(and (< 0 main_~z~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (div (+ main_~z~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:36:05,860 INFO L272 TraceCheckUtils]: 13: Hoare triple {552#(and (< 0 main_~z~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (<= (div (+ main_~z~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967296) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:05,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:05,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {493#false} is VALID [2022-04-28 03:36:05,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-04-28 03:36:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:05,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:39,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {493#false} assume !false; {493#false} is VALID [2022-04-28 03:36:39,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {493#false} is VALID [2022-04-28 03:36:39,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:39,086 INFO L272 TraceCheckUtils]: 13: Hoare triple {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:39,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {579#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {503#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:39,089 INFO L290 TraceCheckUtils]: 11: Hoare triple {583#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 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; {579#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:36:39,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {587#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {583#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:36:39,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {591#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 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; {587#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:36:39,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {591#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:36:39,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {599#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [68] 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[] {595#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:36:41,125 WARN L290 TraceCheckUtils]: 6: Hoare triple {603#(and (forall ((aux_div_aux_mod_v_main_~y~0_31_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_31_46_102 Int) (aux_div_v_main_~y~0_31_46 Int)) (or (< (* aux_div_v_main_~y~0_31_46 4294967296) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (* aux_div_v_main_~y~0_31_46 4294967296)) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* (div main_~n~0 4294967296) 4294967296) 1)) (and (or (not (= (+ main_~y~0 4294967295) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (forall ((aux_div_v_main_~x~0_29_31 Int)) (or (< (+ main_~y~0 main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (+ main_~y~0 main_~x~0)))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~y~0 1) (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (< aux_mod_aux_mod_v_main_~y~0_31_46_102 0))) (forall ((aux_div_aux_mod_v_main_~y~0_31_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_31_46_102 Int) (aux_div_v_main_~y~0_31_46 Int)) (or (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_31_46_102) (< (* aux_div_v_main_~y~0_31_46 4294967296) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (* aux_div_v_main_~y~0_31_46 4294967296)) (and (or (not (= (+ main_~y~0 4294967295) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (forall ((aux_div_v_main_~x~0_29_31 Int)) (or (< (+ main_~y~0 main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (+ main_~y~0 main_~x~0)))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~y~0 1) (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (<= (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))))} [69] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_22 4294967296)) (.cse0 (= v_main_~y~0_24 v_main_~y~0_23)) (.cse2 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse3 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse4 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~x~0_22 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_21 v_it_3 1) v_main_~x~0_22)))) (< v_main_~x~0_21 v_main_~x~0_22) (= v_main_~y~0_23 (+ v_main_~x~0_22 v_main_~y~0_24 (* (- 1) v_main_~x~0_21))) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_24, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_21, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {599#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is UNKNOWN [2022-04-28 03:36:41,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {603#(and (forall ((aux_div_aux_mod_v_main_~y~0_31_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_31_46_102 Int) (aux_div_v_main_~y~0_31_46 Int)) (or (< (* aux_div_v_main_~y~0_31_46 4294967296) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (* aux_div_v_main_~y~0_31_46 4294967296)) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* (div main_~n~0 4294967296) 4294967296) 1)) (and (or (not (= (+ main_~y~0 4294967295) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (forall ((aux_div_v_main_~x~0_29_31 Int)) (or (< (+ main_~y~0 main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (+ main_~y~0 main_~x~0)))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~y~0 1) (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (< aux_mod_aux_mod_v_main_~y~0_31_46_102 0))) (forall ((aux_div_aux_mod_v_main_~y~0_31_46_102 Int) (aux_mod_aux_mod_v_main_~y~0_31_46_102 Int) (aux_div_v_main_~y~0_31_46 Int)) (or (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_31_46_102) (< (* aux_div_v_main_~y~0_31_46 4294967296) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (* aux_div_v_main_~y~0_31_46 4294967296)) (and (or (not (= (+ main_~y~0 4294967295) (+ 4294967295 aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (forall ((aux_div_v_main_~x~0_29_31 Int)) (or (< (+ main_~y~0 main_~x~0) (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)) (+ main_~y~0 main_~x~0)))) (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 main_~y~0 1) (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* aux_div_aux_mod_v_main_~y~0_31_46_102 4294967296))) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (<= (+ aux_mod_aux_mod_v_main_~y~0_31_46_102 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))))} is VALID [2022-04-28 03:36:41,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {492#true} call #t~ret11 := main(); {492#true} is VALID [2022-04-28 03:36:41,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {492#true} {492#true} #61#return; {492#true} is VALID [2022-04-28 03:36:41,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {492#true} assume true; {492#true} is VALID [2022-04-28 03:36:41,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {492#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {492#true} is VALID [2022-04-28 03:36:41,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {492#true} call ULTIMATE.init(); {492#true} is VALID [2022-04-28 03:36:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:41,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074422723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:41,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:41,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2022-04-28 03:36:41,797 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:41,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684472629] [2022-04-28 03:36:41,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684472629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:41,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:41,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:36:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607323818] [2022-04-28 03:36:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:41,799 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:41,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:41,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:41,824 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:36:41,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:36:41,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:41,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:36:41,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=655, Unknown=9, NotChecked=0, Total=812 [2022-04-28 03:36:41,825 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:44,950 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-28 03:36:44,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:36:44,951 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 03:36:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:44,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 28 transitions. [2022-04-28 03:36:44,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 28 transitions. [2022-04-28 03:36:45,018 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:36:45,019 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:36:45,019 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:36:45,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=190, Invalid=990, Unknown=10, NotChecked=0, Total=1190 [2022-04-28 03:36:45,020 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:45,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 47 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-04-28 03:36:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:36:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 03:36:45,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:45,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:45,049 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:45,049 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:45,050 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:36:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:36:45,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:45,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:45,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:36:45,051 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:36:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:45,052 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 03:36:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 03:36:45,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:45,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:45,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:45,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-28 03:36:45,053 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 17 [2022-04-28 03:36:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:45,053 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-28 03:36:45,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:36:45,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-28 03:36:46,302 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:36:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-28 03:36:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:36:46,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:46,303 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:46,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:36:46,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:46,504 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 656236558, now seen corresponding path program 2 times [2022-04-28 03:36:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:46,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1484387279] [2022-04-28 03:36:49,923 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:36:50,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:36:50,017 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:50,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1866381903, now seen corresponding path program 1 times [2022-04-28 03:36:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145225335] [2022-04-28 03:36:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:50,028 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:36:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:50,047 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:36:50,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:50,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {771#true} is VALID [2022-04-28 03:36:50,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-28 03:36:50,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {771#true} {771#true} #61#return; {771#true} is VALID [2022-04-28 03:36:50,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:50,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {771#true} is VALID [2022-04-28 03:36:50,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-28 03:36:50,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #61#return; {771#true} is VALID [2022-04-28 03:36:50,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret11 := main(); {771#true} is VALID [2022-04-28 03:36:50,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {776#(= main_~y~0 0)} is VALID [2022-04-28 03:36:50,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {776#(= main_~y~0 0)} [71] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse0 (mod v_main_~x~0_34 4294967296)) (.cse2 (= |v_main_#t~post6_21| |v_main_#t~post6_20|)) (.cse3 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse4 (= |v_main_#t~post5_21| |v_main_#t~post5_20|))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_36 v_it_4 1) v_main_~y~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_36 (* (- 1) v_main_~y~0_35))) (< 0 .cse0) (< v_main_~y~0_36 v_main_~y~0_35)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_21|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_21|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {777#(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:36:50,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {777#(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)))} [70] 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[] {778#(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:36:50,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {778#(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; {779#(or (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* 4294967296 (div (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-28 03:36:50,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {779#(or (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* 4294967296 (div (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~y~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; {780#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:50,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {780#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {781#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:50,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {782#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:50,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(<= 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; {772#false} is VALID [2022-04-28 03:36:50,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#false} assume !(~y~0 % 4294967296 > 0); {772#false} is VALID [2022-04-28 03:36:50,230 INFO L272 TraceCheckUtils]: 14: Hoare triple {772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {772#false} is VALID [2022-04-28 03:36:50,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2022-04-28 03:36:50,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2022-04-28 03:36:50,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#false} assume !false; {772#false} is VALID [2022-04-28 03:36:50,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:50,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:50,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145225335] [2022-04-28 03:36:50,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145225335] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:50,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866947747] [2022-04-28 03:36:50,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:50,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:50,241 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:36:50,242 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:36:50,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:50,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:36:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:50,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:50,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2022-04-28 03:36:50,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {771#true} is VALID [2022-04-28 03:36:50,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-28 03:36:50,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #61#return; {771#true} is VALID [2022-04-28 03:36:50,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret11 := main(); {771#true} is VALID [2022-04-28 03:36:50,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {771#true} is VALID [2022-04-28 03:36:50,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {771#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse0 (mod v_main_~x~0_34 4294967296)) (.cse2 (= |v_main_#t~post6_21| |v_main_#t~post6_20|)) (.cse3 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse4 (= |v_main_#t~post5_21| |v_main_#t~post5_20|))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_36 v_it_4 1) v_main_~y~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_36 (* (- 1) v_main_~y~0_35))) (< 0 .cse0) (< v_main_~y~0_36 v_main_~y~0_35)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_21|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_21|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {771#true} is VALID [2022-04-28 03:36:50,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {771#true} [70] 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[] {771#true} is VALID [2022-04-28 03:36:50,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#true} ~z~0 := ~y~0; {811#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:36:50,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {811#(= 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; {815#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:36:50,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {815#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {781#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:50,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {782#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:50,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(<= 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; {772#false} is VALID [2022-04-28 03:36:50,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#false} assume !(~y~0 % 4294967296 > 0); {772#false} is VALID [2022-04-28 03:36:50,500 INFO L272 TraceCheckUtils]: 14: Hoare triple {772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {772#false} is VALID [2022-04-28 03:36:50,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2022-04-28 03:36:50,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2022-04-28 03:36:50,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#false} assume !false; {772#false} is VALID [2022-04-28 03:36:50,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:50,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:50,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#false} assume !false; {772#false} is VALID [2022-04-28 03:36:50,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#false} assume 0 == ~cond; {772#false} is VALID [2022-04-28 03:36:50,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2022-04-28 03:36:50,805 INFO L272 TraceCheckUtils]: 14: Hoare triple {772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {772#false} is VALID [2022-04-28 03:36:50,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {772#false} assume !(~y~0 % 4294967296 > 0); {772#false} is VALID [2022-04-28 03:36:50,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(<= 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; {772#false} is VALID [2022-04-28 03:36:50,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {782#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:36:50,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {861#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {781#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:36:50,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~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; {861#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:36:50,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#true} ~z~0 := ~y~0; {865#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:36:50,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {771#true} [70] 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[] {771#true} is VALID [2022-04-28 03:36:50,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {771#true} [71] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_34 v_main_~x~0_33)) (.cse0 (mod v_main_~x~0_34 4294967296)) (.cse2 (= |v_main_#t~post6_21| |v_main_#t~post6_20|)) (.cse3 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse4 (= |v_main_#t~post5_21| |v_main_#t~post5_20|))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_36 v_it_4 1) v_main_~y~0_35)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_34) 4294967296)) (not (<= 1 v_it_4)))) (= v_main_~x~0_33 (+ v_main_~x~0_34 v_main_~y~0_36 (* (- 1) v_main_~y~0_35))) (< 0 .cse0) (< v_main_~y~0_36 v_main_~y~0_35)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_21|, main_~x~0=v_main_~x~0_34, main_#t~post6=|v_main_#t~post6_21|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_20|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_20|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {771#true} is VALID [2022-04-28 03:36:50,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {771#true} is VALID [2022-04-28 03:36:50,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret11 := main(); {771#true} is VALID [2022-04-28 03:36:50,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #61#return; {771#true} is VALID [2022-04-28 03:36:50,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2022-04-28 03:36:50,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {771#true} is VALID [2022-04-28 03:36:50,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2022-04-28 03:36:50,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:50,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866947747] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:50,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:50,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-28 03:36:51,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:51,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1484387279] [2022-04-28 03:36:51,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1484387279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:51,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:51,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:36:51,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539142461] [2022-04-28 03:36:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:51,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:51,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:51,412 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:36:51,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:36:51,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:51,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:36:51,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:36:51,413 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:56,049 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 03:36:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:36:56,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 03:36:56,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:56,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2022-04-28 03:36:56,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2022-04-28 03:36:59,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:59,918 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:36:59,918 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:36:59,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:36:59,919 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:59,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 38 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 62 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-04-28 03:36:59,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:36:59,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-04-28 03:36:59,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:59,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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:36:59,972 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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:36:59,972 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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:36:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:59,973 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 03:36:59,973 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 03:36:59,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:59,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:59,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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 29 states. [2022-04-28 03:36:59,973 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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 29 states. [2022-04-28 03:36:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:59,974 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 03:36:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 03:36:59,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:59,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:59,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:59,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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:36:59,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-04-28 03:36:59,976 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 18 [2022-04-28 03:36:59,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:59,976 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-04-28 03:36:59,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 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:36:59,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 30 transitions. [2022-04-28 03:37:04,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 28 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 03:37:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:37:04,679 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:04,679 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:04,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:37:04,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:04,897 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:04,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 3 times [2022-04-28 03:37:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:04,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908177227] [2022-04-28 03:37:05,777 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:37:05,779 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:05,781 INFO L85 PathProgramCache]: Analyzing trace with hash -931347968, now seen corresponding path program 1 times [2022-04-28 03:37:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:05,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476628096] [2022-04-28 03:37:05,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:05,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:05,789 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:37:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:05,813 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:05,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {1109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 03:37:05,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 03:37:05,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #61#return; {1099#true} is VALID [2022-04-28 03:37:05,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:05,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 03:37:05,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 03:37:05,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #61#return; {1099#true} is VALID [2022-04-28 03:37:05,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret11 := main(); {1099#true} is VALID [2022-04-28 03:37:05,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1099#true} is VALID [2022-04-28 03:37:05,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= |v_main_#t~post6_26| |v_main_#t~post6_25|)) (.cse3 (= |v_main_#t~post5_26| |v_main_#t~post5_25|)) (.cse4 (= v_main_~y~0_47 v_main_~y~0_46))) (or (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_41 v_it_5 1) v_main_~x~0_42)) (< 0 (mod (+ v_main_~x~0_42 (* v_it_5 4294967295)) 4294967296)))) (= v_main_~y~0_46 (+ v_main_~x~0_42 v_main_~y~0_47 (* (- 1) v_main_~x~0_41))) (< v_main_~x~0_41 v_main_~x~0_42)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_47, main_#t~post5=|v_main_#t~post5_26|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_26|} OutVars{main_~y~0=v_main_~y~0_46, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_25|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1099#true} is VALID [2022-04-28 03:37:05,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} [72] 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[] {1099#true} is VALID [2022-04-28 03:37:05,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} ~z~0 := ~y~0; {1104#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:37:05,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(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; {1105#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:05,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#(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; {1106#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:37:05,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {1106#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1107#(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:37:05,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {1107#(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; {1108#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:05,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {1108#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1100#false} is VALID [2022-04-28 03:37:05,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {1100#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1100#false} is VALID [2022-04-28 03:37:05,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1100#false} ~cond := #in~cond; {1100#false} is VALID [2022-04-28 03:37:05,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {1100#false} assume 0 == ~cond; {1100#false} is VALID [2022-04-28 03:37:05,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-28 03:37:05,904 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:37:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476628096] [2022-04-28 03:37:05,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476628096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652044285] [2022-04-28 03:37:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:05,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:05,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:05,906 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:37:05,907 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:37:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:05,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:37:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:05,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:06,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1099#true} is VALID [2022-04-28 03:37:06,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 03:37:06,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 03:37:06,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #61#return; {1099#true} is VALID [2022-04-28 03:37:06,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret11 := main(); {1099#true} is VALID [2022-04-28 03:37:06,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1099#true} is VALID [2022-04-28 03:37:06,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= |v_main_#t~post6_26| |v_main_#t~post6_25|)) (.cse3 (= |v_main_#t~post5_26| |v_main_#t~post5_25|)) (.cse4 (= v_main_~y~0_47 v_main_~y~0_46))) (or (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_41 v_it_5 1) v_main_~x~0_42)) (< 0 (mod (+ v_main_~x~0_42 (* v_it_5 4294967295)) 4294967296)))) (= v_main_~y~0_46 (+ v_main_~x~0_42 v_main_~y~0_47 (* (- 1) v_main_~x~0_41))) (< v_main_~x~0_41 v_main_~x~0_42)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_47, main_#t~post5=|v_main_#t~post5_26|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_26|} OutVars{main_~y~0=v_main_~y~0_46, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_25|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1099#true} is VALID [2022-04-28 03:37:06,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} [72] 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[] {1099#true} is VALID [2022-04-28 03:37:06,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} ~z~0 := ~y~0; {1104#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:37:06,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(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; {1105#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:06,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1105#(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; {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:37:06,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:37:06,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1108#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:06,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1108#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1100#false} is VALID [2022-04-28 03:37:06,289 INFO L272 TraceCheckUtils]: 14: Hoare triple {1100#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1100#false} is VALID [2022-04-28 03:37:06,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {1100#false} ~cond := #in~cond; {1100#false} is VALID [2022-04-28 03:37:06,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {1100#false} assume 0 == ~cond; {1100#false} is VALID [2022-04-28 03:37:06,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-28 03:37:06,290 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:37:06,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:06,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-28 03:37:06,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1100#false} assume 0 == ~cond; {1100#false} is VALID [2022-04-28 03:37:06,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {1100#false} ~cond := #in~cond; {1100#false} is VALID [2022-04-28 03:37:06,690 INFO L272 TraceCheckUtils]: 14: Hoare triple {1100#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1100#false} is VALID [2022-04-28 03:37:06,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1108#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1100#false} is VALID [2022-04-28 03:37:06,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1108#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:06,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:37:06,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {1186#(or (< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1)) (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; {1143#(< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1))} is VALID [2022-04-28 03:37:06,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {1190#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) 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; {1186#(or (< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:37:06,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} ~z~0 := ~y~0; {1190#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< (div (+ 4294967296 (* (- 1) main_~y~0)) (- 4294967296)) (+ (div (+ (- 2) main_~y~0) 4294967296) 1)))} is VALID [2022-04-28 03:37:06,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} [72] 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[] {1099#true} is VALID [2022-04-28 03:37:06,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} [73] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_42 4294967296)) (.cse1 (= v_main_~x~0_42 v_main_~x~0_41)) (.cse2 (= |v_main_#t~post6_26| |v_main_#t~post6_25|)) (.cse3 (= |v_main_#t~post5_26| |v_main_#t~post5_25|)) (.cse4 (= v_main_~y~0_47 v_main_~y~0_46))) (or (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_41 v_it_5 1) v_main_~x~0_42)) (< 0 (mod (+ v_main_~x~0_42 (* v_it_5 4294967295)) 4294967296)))) (= v_main_~y~0_46 (+ v_main_~x~0_42 v_main_~y~0_47 (* (- 1) v_main_~x~0_41))) (< v_main_~x~0_41 v_main_~x~0_42)) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_47, main_#t~post5=|v_main_#t~post5_26|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_26|} OutVars{main_~y~0=v_main_~y~0_46, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_41, main_#t~post6=|v_main_#t~post6_25|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1099#true} is VALID [2022-04-28 03:37:06,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1099#true} is VALID [2022-04-28 03:37:06,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret11 := main(); {1099#true} is VALID [2022-04-28 03:37:06,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #61#return; {1099#true} is VALID [2022-04-28 03:37:06,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 03:37:06,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 03:37:06,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1099#true} is VALID [2022-04-28 03:37:06,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:06,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652044285] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:06,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:06,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 11 [2022-04-28 03:37:06,722 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:06,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908177227] [2022-04-28 03:37:06,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908177227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:06,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:06,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:37:06,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995436941] [2022-04-28 03:37:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:06,723 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:06,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:06,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:06,737 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:37:06,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:37:06,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:06,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:37:06,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:37:06,738 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:07,161 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 03:37:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:37:07,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:07,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2022-04-28 03:37:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 30 transitions. [2022-04-28 03:37:07,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 30 transitions. [2022-04-28 03:37:07,191 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:37:07,191 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:37:07,192 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:37:07,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:37:07,193 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:07,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:37:07,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:37:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-28 03:37:07,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:07,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:07,259 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:07,259 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:07,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:07,260 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:37:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 03:37:07,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:07,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:07,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:37:07,261 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:37:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:07,262 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:37:07,262 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 03:37:07,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:07,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:07,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:07,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:07,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-28 03:37:07,263 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2022-04-28 03:37:07,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:07,264 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-28 03:37:07,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 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:37:07,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-28 03:37:12,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 32 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 03:37:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:37:12,330 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:12,330 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:12,346 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:37:12,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:12,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:12,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1060640193, now seen corresponding path program 4 times [2022-04-28 03:37:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:12,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229101098] [2022-04-28 03:37:12,708 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:37:12,709 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1436845982, now seen corresponding path program 1 times [2022-04-28 03:37:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:12,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666713019] [2022-04-28 03:37:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:12,718 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:37:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:12,730 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:37:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:12,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {1437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-04-28 03:37:12,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-28 03:37:12,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1428#true} {1428#true} #61#return; {1428#true} is VALID [2022-04-28 03:37:12,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:12,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {1437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-04-28 03:37:12,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-28 03:37:12,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #61#return; {1428#true} is VALID [2022-04-28 03:37:12,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret11 := main(); {1428#true} is VALID [2022-04-28 03:37:12,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1428#true} is VALID [2022-04-28 03:37:12,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {1428#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_51 4294967296)) (.cse0 (= |v_main_#t~post6_31| |v_main_#t~post6_30|)) (.cse1 (= v_main_~y~0_56 v_main_~y~0_55)) (.cse2 (= |v_main_#t~post5_31| |v_main_#t~post5_30|)) (.cse4 (= v_main_~x~0_51 v_main_~x~0_50))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< v_main_~x~0_50 v_main_~x~0_51) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_50 v_it_6 1) v_main_~x~0_51)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_51 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~y~0_55 (+ v_main_~x~0_51 v_main_~y~0_56 (* (- 1) v_main_~x~0_50))) (< 0 .cse3)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_56, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_31|} OutVars{main_~y~0=v_main_~y~0_55, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1428#true} is VALID [2022-04-28 03:37:12,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#true} [74] 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[] {1428#true} is VALID [2022-04-28 03:37:12,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#true} ~z~0 := ~y~0; {1433#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:37:12,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1434#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:12,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(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; {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:12,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {1435#(<= 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; {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:12,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:12,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {1435#(<= 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; {1436#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:12,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1429#false} is VALID [2022-04-28 03:37:12,821 INFO L272 TraceCheckUtils]: 15: Hoare triple {1429#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1429#false} is VALID [2022-04-28 03:37:12,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {1429#false} ~cond := #in~cond; {1429#false} is VALID [2022-04-28 03:37:12,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#false} assume 0 == ~cond; {1429#false} is VALID [2022-04-28 03:37:12,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2022-04-28 03:37:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:12,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:12,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666713019] [2022-04-28 03:37:12,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666713019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:12,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177200042] [2022-04-28 03:37:12,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:12,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:12,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:12,823 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:37:12,827 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:37:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:12,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:37:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:12,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:13,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2022-04-28 03:37:13,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-04-28 03:37:13,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-28 03:37:13,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #61#return; {1428#true} is VALID [2022-04-28 03:37:13,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret11 := main(); {1428#true} is VALID [2022-04-28 03:37:13,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1428#true} is VALID [2022-04-28 03:37:13,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {1428#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_51 4294967296)) (.cse0 (= |v_main_#t~post6_31| |v_main_#t~post6_30|)) (.cse1 (= v_main_~y~0_56 v_main_~y~0_55)) (.cse2 (= |v_main_#t~post5_31| |v_main_#t~post5_30|)) (.cse4 (= v_main_~x~0_51 v_main_~x~0_50))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< v_main_~x~0_50 v_main_~x~0_51) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_50 v_it_6 1) v_main_~x~0_51)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_51 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~y~0_55 (+ v_main_~x~0_51 v_main_~y~0_56 (* (- 1) v_main_~x~0_50))) (< 0 .cse3)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_56, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_31|} OutVars{main_~y~0=v_main_~y~0_55, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1428#true} is VALID [2022-04-28 03:37:13,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#true} [74] 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[] {1428#true} is VALID [2022-04-28 03:37:13,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#true} ~z~0 := ~y~0; {1433#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:37:13,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {1433#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1434#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:13,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(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; {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:13,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {1435#(<= 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; {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:13,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:13,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {1435#(<= 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; {1436#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:13,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1429#false} is VALID [2022-04-28 03:37:13,188 INFO L272 TraceCheckUtils]: 15: Hoare triple {1429#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1429#false} is VALID [2022-04-28 03:37:13,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {1429#false} ~cond := #in~cond; {1429#false} is VALID [2022-04-28 03:37:13,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#false} assume 0 == ~cond; {1429#false} is VALID [2022-04-28 03:37:13,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2022-04-28 03:37:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:13,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:13,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#false} assume !false; {1429#false} is VALID [2022-04-28 03:37:13,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {1429#false} assume 0 == ~cond; {1429#false} is VALID [2022-04-28 03:37:13,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {1429#false} ~cond := #in~cond; {1429#false} is VALID [2022-04-28 03:37:13,419 INFO L272 TraceCheckUtils]: 15: Hoare triple {1429#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1429#false} is VALID [2022-04-28 03:37:13,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {1429#false} is VALID [2022-04-28 03:37:13,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {1435#(<= 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; {1436#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:13,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:13,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {1435#(<= 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; {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:13,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {1519#(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; {1435#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:13,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {1523#(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; {1519#(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:37:13,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1428#true} ~z~0 := ~y~0; {1523#(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:37:13,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {1428#true} [74] 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[] {1428#true} is VALID [2022-04-28 03:37:13,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {1428#true} [75] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_51 4294967296)) (.cse0 (= |v_main_#t~post6_31| |v_main_#t~post6_30|)) (.cse1 (= v_main_~y~0_56 v_main_~y~0_55)) (.cse2 (= |v_main_#t~post5_31| |v_main_#t~post5_30|)) (.cse4 (= v_main_~x~0_51 v_main_~x~0_50))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (< v_main_~x~0_50 v_main_~x~0_51) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_50 v_it_6 1) v_main_~x~0_51)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~x~0_51 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~y~0_55 (+ v_main_~x~0_51 v_main_~y~0_56 (* (- 1) v_main_~x~0_50))) (< 0 .cse3)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_56, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_31|} OutVars{main_~y~0=v_main_~y~0_55, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1428#true} is VALID [2022-04-28 03:37:13,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {1428#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1428#true} is VALID [2022-04-28 03:37:13,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {1428#true} call #t~ret11 := main(); {1428#true} is VALID [2022-04-28 03:37:13,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1428#true} {1428#true} #61#return; {1428#true} is VALID [2022-04-28 03:37:13,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#true} assume true; {1428#true} is VALID [2022-04-28 03:37:13,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1428#true} is VALID [2022-04-28 03:37:13,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {1428#true} call ULTIMATE.init(); {1428#true} is VALID [2022-04-28 03:37:13,425 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:13,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177200042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:13,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:13,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:37:13,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:13,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229101098] [2022-04-28 03:37:13,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229101098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:13,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:13,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:37:13,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134862707] [2022-04-28 03:37:13,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:13,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:13,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,463 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:37:13,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:37:13,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:13,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:37:13,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:37:13,463 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:13,824 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 03:37:13,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:37:13,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:13,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2022-04-28 03:37:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2022-04-28 03:37:13,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 27 transitions. [2022-04-28 03:37:13,851 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:37:13,851 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:37:13,851 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:37:13,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:37:13,852 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:13,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 41 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:37:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:37:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-04-28 03:37:13,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:13,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:13,895 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:13,895 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:13,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:13,896 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 03:37:13,896 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 03:37:13,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:13,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:13,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:37:13,896 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:37:13,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:13,897 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-28 03:37:13,897 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-28 03:37:13,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:13,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:13,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:13,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:13,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-28 03:37:13,898 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-04-28 03:37:13,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:13,898 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-28 03:37:13,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:37:13,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-28 03:37:18,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 21 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 03:37:18,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:37:18,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:18,458 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:18,474 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:37:18,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:18,659 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:18,659 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 5 times [2022-04-28 03:37:18,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:18,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1038218603] [2022-04-28 03:37:18,856 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:37:18,858 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:18,860 INFO L85 PathProgramCache]: Analyzing trace with hash 570197997, now seen corresponding path program 1 times [2022-04-28 03:37:18,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:18,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186927838] [2022-04-28 03:37:18,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:18,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:18,867 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:37:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:18,909 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:37:19,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:19,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {1744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1730#true} is VALID [2022-04-28 03:37:19,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1730#true} assume true; {1730#true} is VALID [2022-04-28 03:37:19,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1730#true} {1730#true} #61#return; {1730#true} is VALID [2022-04-28 03:37:19,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:19,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {1744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1730#true} is VALID [2022-04-28 03:37:19,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1730#true} assume true; {1730#true} is VALID [2022-04-28 03:37:19,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1730#true} {1730#true} #61#return; {1730#true} is VALID [2022-04-28 03:37:19,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {1730#true} call #t~ret11 := main(); {1730#true} is VALID [2022-04-28 03:37:19,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1735#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:37:19,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {1735#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [77] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_65 v_main_~y~0_64)) (.cse1 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse2 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse3 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse4 (mod v_main_~x~0_61 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_65 v_it_7 1) v_main_~y~0_64)) (not (<= 1 v_it_7)))) (< v_main_~y~0_65 v_main_~y~0_64) (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_65 (* (- 1) v_main_~y~0_64)))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_65, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1736#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:37:19,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {1736#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [76] 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[] {1737#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:37:19,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {1737#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {1738#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:37:19,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {1738#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~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; {1739#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:19,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {1739#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {1740#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:19,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {1740#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {1740#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:19,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {1740#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {1739#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:19,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {1739#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:19,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:19,152 INFO L272 TraceCheckUtils]: 15: Hoare triple {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:37:19,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {1742#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1743#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:37:19,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {1743#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1731#false} is VALID [2022-04-28 03:37:19,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2022-04-28 03:37:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:19,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186927838] [2022-04-28 03:37:19,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186927838] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:19,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703247544] [2022-04-28 03:37:19,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:19,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:19,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:19,154 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:37:19,155 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:37:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:19,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:37:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:19,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:38:07,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2022-04-28 03:38:07,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {1730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1730#true} is VALID [2022-04-28 03:38:07,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1730#true} assume true; {1730#true} is VALID [2022-04-28 03:38:07,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1730#true} {1730#true} #61#return; {1730#true} is VALID [2022-04-28 03:38:07,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {1730#true} call #t~ret11 := main(); {1730#true} is VALID [2022-04-28 03:38:07,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {1730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1735#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:38:07,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {1735#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [77] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_65 v_main_~y~0_64)) (.cse1 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse2 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse3 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse4 (mod v_main_~x~0_61 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_65 v_it_7 1) v_main_~y~0_64)) (not (<= 1 v_it_7)))) (< v_main_~y~0_65 v_main_~y~0_64) (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_65 (* (- 1) v_main_~y~0_64)))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_65, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1766#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:38:07,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {1766#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [76] 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[] {1770#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:38:07,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {1770#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {1774#(or (and (< 0 main_~z~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296))) (and (= main_~z~0 0) (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296))))} is VALID [2022-04-28 03:38:07,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {1774#(or (and (< 0 main_~z~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< 0 (mod main_~n~0 4294967296)) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296))) (and (= main_~z~0 0) (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1778#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (< 0 (+ main_~z~0 1)) (forall ((v_it_7 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= v_it_7 main_~z~0)) (not (<= 1 v_it_7)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:38:07,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1778#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (< 0 (+ main_~z~0 1)) (forall ((v_it_7 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= v_it_7 main_~z~0)) (not (<= 1 v_it_7)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 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; {1782#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_7 Int)) (or (not (<= v_it_7 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))))} is VALID [2022-04-28 03:38:07,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {1782#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_7 Int)) (or (not (<= v_it_7 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))))} assume !(~z~0 % 4294967296 > 0); {1786#(and (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_7 Int)) (or (not (<= v_it_7 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:38:07,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {1786#(and (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (forall ((v_it_7 Int)) (or (not (<= v_it_7 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod main_~z~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; {1790#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (forall ((v_it_7 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= v_it_7 main_~z~0)) (not (<= 1 v_it_7)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:38:07,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {1790#(and (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (< 0 (+ main_~z~0 1)) (forall ((v_it_7 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= v_it_7 main_~z~0)) (not (<= 1 v_it_7)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 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; {1794#(and (< 0 main_~z~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:38:07,547 INFO L290 TraceCheckUtils]: 14: Hoare triple {1794#(and (< 0 main_~z~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1794#(and (< 0 main_~z~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:38:07,637 INFO L272 TraceCheckUtils]: 15: Hoare triple {1794#(and (< 0 main_~z~0) (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:38:07,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1805#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:38:07,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {1805#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1731#false} is VALID [2022-04-28 03:38:07,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2022-04-28 03:38:07,639 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:07,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:38:31,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2022-04-28 03:38:31,115 INFO L290 TraceCheckUtils]: 17: Hoare triple {1805#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1731#false} is VALID [2022-04-28 03:38:31,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1805#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:38:31,116 INFO L272 TraceCheckUtils]: 15: Hoare triple {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1801#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:38:31,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:38:31,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {1739#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {1741#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:38:31,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {1740#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {1739#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:38:31,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {1833#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1740#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:38:31,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {1837#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {1833#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:38:31,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {1841#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~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; {1837#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:38:31,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {1845#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} ~z~0 := ~y~0; {1841#(or (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:38:31,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {1849#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} [76] 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[] {1845#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:38:33,130 WARN L290 TraceCheckUtils]: 6: Hoare triple {1853#(forall ((aux_mod_v_main_~x~0_68_31 Int)) (or (< aux_mod_v_main_~x~0_68_31 0) (< 0 aux_mod_v_main_~x~0_68_31) (and (or (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_72_46 Int) (aux_div_aux_mod_v_main_~y~0_72_46_122 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~x~0_68_31 4294967296)) main_~x~0)) (< (+ main_~y~0 main_~x~0 4294967294) (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~y~0_72_46 4294967296) (* aux_div_v_main_~x~0_68_31 4294967296))) (< (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~y~0_72_46 4294967296) (* aux_div_v_main_~x~0_68_31 4294967296)) (+ main_~y~0 main_~x~0 4294967294)) (<= (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_72_46_122 4294967296) 4294967296) (+ aux_mod_v_main_~x~0_68_31 main_~n~0 (* aux_div_v_main_~x~0_68_31 4294967296))) (<= (+ aux_mod_v_main_~x~0_68_31 main_~n~0 (* aux_div_v_main_~x~0_68_31 4294967296)) (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_72_46_122 4294967296))) (exists ((v_it_7 Int)) (and (<= (+ aux_mod_v_main_~x~0_68_31 v_it_7 (* aux_div_v_main_~x~0_68_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7)))))) (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 1)) (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~x~0_68_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~x~0_68_31 4294967296)))))) (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 1)) (forall ((aux_div_v_main_~x~0_68_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~x~0_68_31 4294967296)))))))))} [77] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_65 v_main_~y~0_64)) (.cse1 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse2 (= v_main_~x~0_61 v_main_~x~0_60)) (.cse3 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse4 (mod v_main_~x~0_61 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_61 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_65 v_it_7 1) v_main_~y~0_64)) (not (<= 1 v_it_7)))) (< v_main_~y~0_65 v_main_~y~0_64) (= v_main_~x~0_60 (+ v_main_~x~0_61 v_main_~y~0_65 (* (- 1) v_main_~y~0_64)))) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_65, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_61, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1849#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:38:33,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {1730#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1853#(forall ((aux_mod_v_main_~x~0_68_31 Int)) (or (< aux_mod_v_main_~x~0_68_31 0) (< 0 aux_mod_v_main_~x~0_68_31) (and (or (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_72_46 Int) (aux_div_aux_mod_v_main_~y~0_72_46_122 Int) (aux_div_v_main_~x~0_68_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~x~0_68_31 4294967296)) main_~x~0)) (< (+ main_~y~0 main_~x~0 4294967294) (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~y~0_72_46 4294967296) (* aux_div_v_main_~x~0_68_31 4294967296))) (< (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~y~0_72_46 4294967296) (* aux_div_v_main_~x~0_68_31 4294967296)) (+ main_~y~0 main_~x~0 4294967294)) (<= (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_72_46_122 4294967296) 4294967296) (+ aux_mod_v_main_~x~0_68_31 main_~n~0 (* aux_div_v_main_~x~0_68_31 4294967296))) (<= (+ aux_mod_v_main_~x~0_68_31 main_~n~0 (* aux_div_v_main_~x~0_68_31 4294967296)) (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_72_46_122 4294967296))) (exists ((v_it_7 Int)) (and (<= (+ aux_mod_v_main_~x~0_68_31 v_it_7 (* aux_div_v_main_~x~0_68_31 4294967296) 1) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_7 4294967295)) 4294967296))) (<= 1 v_it_7)))))) (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 1)) (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~x~0_68_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~x~0_68_31 4294967296)))))) (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 4294967296) (* (- 1) main_~y~0)) 4294967296) 1)) (forall ((aux_div_v_main_~x~0_68_31 Int)) (not (= main_~x~0 (+ aux_mod_v_main_~x~0_68_31 (* aux_div_v_main_~x~0_68_31 4294967296)))))))))} is VALID [2022-04-28 03:38:33,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {1730#true} call #t~ret11 := main(); {1730#true} is VALID [2022-04-28 03:38:33,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1730#true} {1730#true} #61#return; {1730#true} is VALID [2022-04-28 03:38:33,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {1730#true} assume true; {1730#true} is VALID [2022-04-28 03:38:33,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {1730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1730#true} is VALID [2022-04-28 03:38:33,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {1730#true} call ULTIMATE.init(); {1730#true} is VALID [2022-04-28 03:38:33,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:33,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703247544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:33,135 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:38:33,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 28 [2022-04-28 03:38:41,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:41,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1038218603] [2022-04-28 03:38:41,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1038218603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:41,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:41,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:38:41,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466630181] [2022-04-28 03:38:41,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:41,672 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:41,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:41,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:41,700 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:38:41,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:38:41,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:41,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:38:41,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=739, Unknown=13, NotChecked=0, Total=870 [2022-04-28 03:38:41,701 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:47,213 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-28 03:38:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:38:47,214 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:47,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:38:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-28 03:38:47,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2022-04-28 03:38:47,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 31 transitions. [2022-04-28 03:38:49,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:49,258 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:38:49,258 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:38:49,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 66.6s TimeCoverageRelationStatistics Valid=160, Invalid=1159, Unknown=13, NotChecked=0, Total=1332 [2022-04-28 03:38:49,260 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:38:49,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 57 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-04-28 03:38:49,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:38:49,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-28 03:38:49,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:38:49,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:49,314 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:49,314 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:49,314 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:38:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:38:49,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:49,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:49,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:38:49,315 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:38:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:49,317 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-28 03:38:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:38:49,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:49,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:49,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:38:49,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:38:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 03:38:49,318 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 20 [2022-04-28 03:38:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:38:49,318 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 03:38:49,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 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:38:49,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 03:38:54,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:38:54,339 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 03:38:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:38:54,340 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:54,340 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:54,345 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:38:54,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:54,544 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:54,545 INFO L85 PathProgramCache]: Analyzing trace with hash -676577280, now seen corresponding path program 6 times [2022-04-28 03:38:54,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:54,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376510930] [2022-04-28 03:38:58,643 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:38:58,726 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:38:58,728 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:58,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1067159456, now seen corresponding path program 1 times [2022-04-28 03:38:58,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:58,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346980039] [2022-04-28 03:38:58,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:58,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:58,741 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:38:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:58,754 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:38:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:38:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:58,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {2057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2046#true} is VALID [2022-04-28 03:38:58,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {2046#true} assume true; {2046#true} is VALID [2022-04-28 03:38:58,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2046#true} {2046#true} #61#return; {2046#true} is VALID [2022-04-28 03:38:58,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {2046#true} call ULTIMATE.init(); {2057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:38:58,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {2057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2046#true} is VALID [2022-04-28 03:38:58,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {2046#true} assume true; {2046#true} is VALID [2022-04-28 03:38:58,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2046#true} {2046#true} #61#return; {2046#true} is VALID [2022-04-28 03:38:58,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {2046#true} call #t~ret11 := main(); {2046#true} is VALID [2022-04-28 03:38:58,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {2046#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2046#true} is VALID [2022-04-28 03:38:58,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {2046#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_43| |v_main_#t~post5_42|)) (.cse2 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse3 (= v_main_~y~0_78 v_main_~y~0_77)) (.cse4 (= |v_main_#t~post6_43| |v_main_#t~post6_42|)) (.cse0 (mod v_main_~x~0_74 4294967296))) (or (and (= (+ v_main_~x~0_74 v_main_~y~0_78 (* (- 1) v_main_~y~0_77)) v_main_~x~0_73) (< v_main_~y~0_78 v_main_~y~0_77) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~y~0_78 v_it_8 1) v_main_~y~0_77)) (not (<= 1 v_it_8)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_74) 4294967296)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_78, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_74, main_#t~post6=|v_main_#t~post6_43|} OutVars{main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2046#true} is VALID [2022-04-28 03:38:58,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {2046#true} [78] 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[] {2046#true} is VALID [2022-04-28 03:38:58,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {2046#true} ~z~0 := ~y~0; {2051#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:38:58,852 INFO L290 TraceCheckUtils]: 9: Hoare triple {2051#(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; {2052#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:38:58,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {2052#(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; {2053#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:58,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2054#(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:38:58,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {2054#(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; {2055#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:38:58,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {2055#(<= 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; {2056#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:38:58,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {2056#(<= 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; {2047#false} is VALID [2022-04-28 03:38:58,856 INFO L290 TraceCheckUtils]: 15: Hoare triple {2047#false} assume !(~y~0 % 4294967296 > 0); {2047#false} is VALID [2022-04-28 03:38:58,856 INFO L272 TraceCheckUtils]: 16: Hoare triple {2047#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2047#false} is VALID [2022-04-28 03:38:58,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {2047#false} ~cond := #in~cond; {2047#false} is VALID [2022-04-28 03:38:58,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {2047#false} assume 0 == ~cond; {2047#false} is VALID [2022-04-28 03:38:58,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {2047#false} assume !false; {2047#false} is VALID [2022-04-28 03:38:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:58,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:58,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346980039] [2022-04-28 03:38:58,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346980039] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:38:58,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435181984] [2022-04-28 03:38:58,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:58,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:58,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:58,858 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:38:58,858 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:38:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:58,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:38:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:58,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:38:59,195 INFO L272 TraceCheckUtils]: 0: Hoare triple {2046#true} call ULTIMATE.init(); {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {2046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {2046#true} assume true; {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2046#true} {2046#true} #61#return; {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {2046#true} call #t~ret11 := main(); {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {2046#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {2046#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_43| |v_main_#t~post5_42|)) (.cse2 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse3 (= v_main_~y~0_78 v_main_~y~0_77)) (.cse4 (= |v_main_#t~post6_43| |v_main_#t~post6_42|)) (.cse0 (mod v_main_~x~0_74 4294967296))) (or (and (= (+ v_main_~x~0_74 v_main_~y~0_78 (* (- 1) v_main_~y~0_77)) v_main_~x~0_73) (< v_main_~y~0_78 v_main_~y~0_77) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~y~0_78 v_it_8 1) v_main_~y~0_77)) (not (<= 1 v_it_8)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_74) 4294967296)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_78, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_74, main_#t~post6=|v_main_#t~post6_43|} OutVars{main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2046#true} is VALID [2022-04-28 03:38:59,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {2046#true} [78] 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[] {2046#true} is VALID [2022-04-28 03:38:59,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {2046#true} ~z~0 := ~y~0; {2051#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:38:59,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {2051#(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; {2052#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:38:59,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {2052#(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; {2053#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:38:59,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2094#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:38:59,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {2055#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:38:59,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {2055#(<= 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; {2056#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:38:59,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {2056#(<= 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; {2047#false} is VALID [2022-04-28 03:38:59,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {2047#false} assume !(~y~0 % 4294967296 > 0); {2047#false} is VALID [2022-04-28 03:38:59,202 INFO L272 TraceCheckUtils]: 16: Hoare triple {2047#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2047#false} is VALID [2022-04-28 03:38:59,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {2047#false} ~cond := #in~cond; {2047#false} is VALID [2022-04-28 03:38:59,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {2047#false} assume 0 == ~cond; {2047#false} is VALID [2022-04-28 03:38:59,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {2047#false} assume !false; {2047#false} is VALID [2022-04-28 03:38:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:59,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:38:59,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2047#false} assume !false; {2047#false} is VALID [2022-04-28 03:38:59,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {2047#false} assume 0 == ~cond; {2047#false} is VALID [2022-04-28 03:38:59,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {2047#false} ~cond := #in~cond; {2047#false} is VALID [2022-04-28 03:38:59,658 INFO L272 TraceCheckUtils]: 16: Hoare triple {2047#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2047#false} is VALID [2022-04-28 03:38:59,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {2047#false} assume !(~y~0 % 4294967296 > 0); {2047#false} is VALID [2022-04-28 03:38:59,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {2056#(<= 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; {2047#false} is VALID [2022-04-28 03:38:59,659 INFO L290 TraceCheckUtils]: 13: Hoare triple {2055#(<= 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; {2056#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:38:59,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {2094#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {2055#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:38:59,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {2143#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2094#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:38:59,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {2147#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 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; {2143#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:38:59,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {2151#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {2147#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:38:59,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {2046#true} ~z~0 := ~y~0; {2151#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:38:59,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {2046#true} [78] 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[] {2046#true} is VALID [2022-04-28 03:38:59,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {2046#true} [79] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_43| |v_main_#t~post5_42|)) (.cse2 (= v_main_~x~0_74 v_main_~x~0_73)) (.cse3 (= v_main_~y~0_78 v_main_~y~0_77)) (.cse4 (= |v_main_#t~post6_43| |v_main_#t~post6_42|)) (.cse0 (mod v_main_~x~0_74 4294967296))) (or (and (= (+ v_main_~x~0_74 v_main_~y~0_78 (* (- 1) v_main_~y~0_77)) v_main_~x~0_73) (< v_main_~y~0_78 v_main_~y~0_77) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~y~0_78 v_it_8 1) v_main_~y~0_77)) (not (<= 1 v_it_8)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_74) 4294967296)))) (< 0 .cse0)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_78, main_#t~post5=|v_main_#t~post5_43|, main_~x~0=v_main_~x~0_74, main_#t~post6=|v_main_#t~post6_43|} OutVars{main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_42|, main_~x~0=v_main_~x~0_73, main_#t~post6=|v_main_#t~post6_42|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2046#true} is VALID [2022-04-28 03:38:59,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {2046#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2046#true} is VALID [2022-04-28 03:38:59,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {2046#true} call #t~ret11 := main(); {2046#true} is VALID [2022-04-28 03:38:59,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2046#true} {2046#true} #61#return; {2046#true} is VALID [2022-04-28 03:38:59,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {2046#true} assume true; {2046#true} is VALID [2022-04-28 03:38:59,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {2046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2046#true} is VALID [2022-04-28 03:38:59,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {2046#true} call ULTIMATE.init(); {2046#true} is VALID [2022-04-28 03:38:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:59,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435181984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:38:59,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:38:59,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-28 03:38:59,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:38:59,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376510930] [2022-04-28 03:38:59,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376510930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:38:59,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:38:59,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:38:59,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634216375] [2022-04-28 03:38:59,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:38:59,746 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:38:59,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:38:59,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:59,762 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:38:59,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:38:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:59,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:38:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:38:59,763 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:00,313 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-04-28 03:39:00,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:39:00,313 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:39:00,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-28 03:39:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-28 03:39:00,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2022-04-28 03:39:00,347 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:39:00,348 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:39:00,348 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:39:00,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:39:00,349 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:00,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 54 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:39:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:39:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:39:00,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:00,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,410 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,410 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:00,410 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:39:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 03:39:00,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:00,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:00,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states 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:39:00,411 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states 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:39:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:00,411 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:39:00,411 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 03:39:00,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:00,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:00,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:00,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-28 03:39:00,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 21 [2022-04-28 03:39:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:00,412 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-28 03:39:00,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:00,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-28 03:39:03,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:03,260 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 03:39:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:39:03,261 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:03,261 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:03,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:39:03,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:03,461 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1178216785, now seen corresponding path program 7 times [2022-04-28 03:39:03,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:03,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1077197635] [2022-04-28 03:39:03,616 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:39:03,617 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:03,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1128245071, now seen corresponding path program 1 times [2022-04-28 03:39:03,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:03,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232551874] [2022-04-28 03:39:03,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:03,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:03,626 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:39:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:03,641 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:39:03,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:03,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-28 03:39:03,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 03:39:03,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2351#true} {2351#true} #61#return; {2351#true} is VALID [2022-04-28 03:39:03,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:03,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-28 03:39:03,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 03:39:03,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #61#return; {2351#true} is VALID [2022-04-28 03:39:03,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret11 := main(); {2351#true} is VALID [2022-04-28 03:39:03,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2351#true} is VALID [2022-04-28 03:39:03,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_92 v_main_~y~0_91)) (.cse1 (= |v_main_#t~post5_48| |v_main_#t~post5_47|)) (.cse2 (= |v_main_#t~post6_48| |v_main_#t~post6_47|)) (.cse4 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_91 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_92)) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_84 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_9 1) v_main_~x~0_84)))) (< 0 .cse3) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_92, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} OutVars{main_~y~0=v_main_~y~0_91, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_47|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2351#true} is VALID [2022-04-28 03:39:03,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} [80] 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[] {2351#true} is VALID [2022-04-28 03:39:03,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} ~z~0 := ~y~0; {2356#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:39:03,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {2356#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2357#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:39:03,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {2357#(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; {2358#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:39:03,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {2358#(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; {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:39:03,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:39:03,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#(<= 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; {2360#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:39:03,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {2360#(<= 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; {2361#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:39:03,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {2361#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2352#false} is VALID [2022-04-28 03:39:03,751 INFO L272 TraceCheckUtils]: 16: Hoare triple {2352#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2352#false} is VALID [2022-04-28 03:39:03,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {2352#false} ~cond := #in~cond; {2352#false} is VALID [2022-04-28 03:39:03,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {2352#false} assume 0 == ~cond; {2352#false} is VALID [2022-04-28 03:39:03,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-04-28 03:39:03,752 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:39:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232551874] [2022-04-28 03:39:03,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232551874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:03,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562936184] [2022-04-28 03:39:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:03,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:03,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:03,753 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:39:03,754 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:39:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:03,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:39:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:03,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:04,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2022-04-28 03:39:04,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-28 03:39:04,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 03:39:04,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #61#return; {2351#true} is VALID [2022-04-28 03:39:04,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret11 := main(); {2351#true} is VALID [2022-04-28 03:39:04,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2351#true} is VALID [2022-04-28 03:39:04,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_92 v_main_~y~0_91)) (.cse1 (= |v_main_#t~post5_48| |v_main_#t~post5_47|)) (.cse2 (= |v_main_#t~post6_48| |v_main_#t~post6_47|)) (.cse4 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_91 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_92)) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_84 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_9 1) v_main_~x~0_84)))) (< 0 .cse3) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_92, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} OutVars{main_~y~0=v_main_~y~0_91, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_47|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2351#true} is VALID [2022-04-28 03:39:04,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} [80] 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[] {2351#true} is VALID [2022-04-28 03:39:04,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} ~z~0 := ~y~0; {2356#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:39:04,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {2356#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2357#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:39:04,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {2357#(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; {2358#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:39:04,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {2358#(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; {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:39:04,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:39:04,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#(<= 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; {2360#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:39:04,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {2360#(<= 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; {2361#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:39:04,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {2361#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2352#false} is VALID [2022-04-28 03:39:04,128 INFO L272 TraceCheckUtils]: 16: Hoare triple {2352#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2352#false} is VALID [2022-04-28 03:39:04,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {2352#false} ~cond := #in~cond; {2352#false} is VALID [2022-04-28 03:39:04,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {2352#false} assume 0 == ~cond; {2352#false} is VALID [2022-04-28 03:39:04,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-04-28 03:39:04,128 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:39:04,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:39:04,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {2352#false} assume !false; {2352#false} is VALID [2022-04-28 03:39:04,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {2352#false} assume 0 == ~cond; {2352#false} is VALID [2022-04-28 03:39:04,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {2352#false} ~cond := #in~cond; {2352#false} is VALID [2022-04-28 03:39:04,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {2352#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2352#false} is VALID [2022-04-28 03:39:04,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {2361#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2352#false} is VALID [2022-04-28 03:39:04,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {2360#(<= 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; {2361#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:39:04,419 INFO L290 TraceCheckUtils]: 13: Hoare triple {2359#(<= 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; {2360#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:39:04,419 INFO L290 TraceCheckUtils]: 12: Hoare triple {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:39:04,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {2447#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2359#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:39:04,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {2451#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2447#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:39:04,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {2455#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2451#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-28 03:39:04,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {2351#true} ~z~0 := ~y~0; {2455#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:39:04,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {2351#true} [80] 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[] {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {2351#true} [81] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_92 v_main_~y~0_91)) (.cse1 (= |v_main_#t~post5_48| |v_main_#t~post5_47|)) (.cse2 (= |v_main_#t~post6_48| |v_main_#t~post6_47|)) (.cse4 (= v_main_~x~0_84 v_main_~x~0_83)) (.cse3 (mod v_main_~x~0_84 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_91 (+ (* (- 1) v_main_~x~0_83) v_main_~x~0_84 v_main_~y~0_92)) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_84 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_83 v_it_9 1) v_main_~x~0_84)))) (< 0 .cse3) (< v_main_~x~0_83 v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_92, main_#t~post5=|v_main_#t~post5_48|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_48|} OutVars{main_~y~0=v_main_~y~0_91, main_#t~post5=|v_main_#t~post5_47|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_47|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {2351#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {2351#true} call #t~ret11 := main(); {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2351#true} {2351#true} #61#return; {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {2351#true} assume true; {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {2351#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {2351#true} call ULTIMATE.init(); {2351#true} is VALID [2022-04-28 03:39:04,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:39:04,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562936184] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:39:04,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:39:04,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:39:04,473 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:39:04,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1077197635] [2022-04-28 03:39:04,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1077197635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:39:04,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:39:04,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:39:04,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562235147] [2022-04-28 03:39:04,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:39:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:39:04,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:39:04,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:04,490 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:39:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:39:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:04,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:39:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:39:04,491 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:05,105 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 03:39:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:39:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:39:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:39:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-28 03:39:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 30 transitions. [2022-04-28 03:39:05,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 30 transitions. [2022-04-28 03:39:05,144 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:39:05,145 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:39:05,145 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:39:05,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:39:05,146 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:39:05,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 56 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:39:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:39:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:39:05,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:39:05,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,217 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,217 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:05,218 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:39:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:39:05,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:05,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:05,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:39:05,219 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:39:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:39:05,219 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:39:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:39:05,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:39:05,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:39:05,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:39:05,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:39:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-28 03:39:05,220 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 21 [2022-04-28 03:39:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:39:05,220 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-28 03:39:05,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:39:05,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-28 03:39:10,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:39:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 03:39:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:39:10,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:39:10,913 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:39:10,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 03:39:11,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:11,116 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:39:11,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:39:11,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2130486882, now seen corresponding path program 8 times [2022-04-28 03:39:11,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:39:11,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1132204021] [2022-04-28 03:39:11,287 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:39:11,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:39:11,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1640627010, now seen corresponding path program 1 times [2022-04-28 03:39:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:39:11,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312853003] [2022-04-28 03:39:11,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:11,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:39:11,297 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:39:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:11,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:39:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:39:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:11,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {2673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2655#true} is VALID [2022-04-28 03:39:11,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2655#true} assume true; {2655#true} is VALID [2022-04-28 03:39:11,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2655#true} {2655#true} #61#return; {2655#true} is VALID [2022-04-28 03:39:11,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {2655#true} call ULTIMATE.init(); {2673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:39:11,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {2673#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2655#true} is VALID [2022-04-28 03:39:11,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {2655#true} assume true; {2655#true} is VALID [2022-04-28 03:39:11,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2655#true} {2655#true} #61#return; {2655#true} is VALID [2022-04-28 03:39:11,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {2655#true} call #t~ret11 := main(); {2655#true} is VALID [2022-04-28 03:39:11,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {2655#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2660#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:11,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {2660#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [83] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_95 4294967296)) (.cse1 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse2 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse3 (= |v_main_#t~post6_53| |v_main_#t~post6_52|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~y~0_103 v_main_~y~0_104)) (and (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_94 v_it_10 1) v_main_~x~0_95)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (= v_main_~y~0_103 (+ v_main_~x~0_95 v_main_~y~0_104 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_104 v_main_~y~0_103)))) InVars {main_~y~0=v_main_~y~0_104, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_103, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2661#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:11,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {2661#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [82] 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[] {2662#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:39:11,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {2662#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {2663#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:39:11,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {2663#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~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; {2664#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))))} is VALID [2022-04-28 03:39:11,695 INFO L290 TraceCheckUtils]: 10: Hoare triple {2664#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))) (or (not (= main_~y~0 0)) (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; {2665#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))))} is VALID [2022-04-28 03:39:11,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {2665#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (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; {2666#(and (or (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0))))} is VALID [2022-04-28 03:39:11,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {2666#(and (or (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0))))} assume !(~z~0 % 4294967296 > 0); {2667#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))))} is VALID [2022-04-28 03:39:11,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {2667#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) 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; {2668#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:39:11,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {2668#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {2669#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:39:11,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {2669#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {2670#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:11,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {2670#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2670#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:39:11,702 INFO L272 TraceCheckUtils]: 17: Hoare triple {2670#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2671#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:39:11,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {2671#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2672#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:39:11,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {2672#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2656#false} is VALID [2022-04-28 03:39:11,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {2656#false} assume !false; {2656#false} is VALID [2022-04-28 03:39:11,703 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:39:11,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:39:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312853003] [2022-04-28 03:39:11,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312853003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:39:11,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14227433] [2022-04-28 03:39:11,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:39:11,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:39:11,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:39:11,705 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:39:11,706 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:39:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:11,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:39:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:39:11,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:27,537 WARN L833 $PredicateComparison]: unable to prove that (and (= (+ (- 1) c_main_~y~0) c_main_~z~0) (forall ((v_it_10 Int)) (or (not (<= v_it_10 c_main_~y~0)) (not (<= 1 v_it_10)) (< 0 (mod (+ (* 4294967295 v_it_10) c_main_~n~0) 4294967296)))) (<= (mod (+ 4294967294 c_main_~y~0) 4294967296) 0) (<= (div (+ (* (- 1) c_main_~n~0) c_main_~y~0 1) (- 4294967296)) (div (+ (- 1) (* (- 1) c_main_~y~0) c_main_~n~0) 4294967296)) (< 0 (+ c_main_~y~0 1))) is different from false [2022-04-28 03:39:50,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {2655#true} call ULTIMATE.init(); {2655#true} is VALID [2022-04-28 03:39:50,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {2655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2655#true} is VALID [2022-04-28 03:39:50,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {2655#true} assume true; {2655#true} is VALID [2022-04-28 03:39:50,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2655#true} {2655#true} #61#return; {2655#true} is VALID [2022-04-28 03:39:50,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {2655#true} call #t~ret11 := main(); {2655#true} is VALID [2022-04-28 03:39:50,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2655#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2660#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:50,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {2660#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [83] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_95 4294967296)) (.cse1 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse2 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse3 (= |v_main_#t~post6_53| |v_main_#t~post6_52|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~y~0_103 v_main_~y~0_104)) (and (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_94 v_it_10 1) v_main_~x~0_95)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (= v_main_~y~0_103 (+ v_main_~x~0_95 v_main_~y~0_104 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_104 v_main_~y~0_103)))) InVars {main_~y~0=v_main_~y~0_104, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_103, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2695#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_10 Int)) (or (not (<= (+ main_~x~0 v_it_10 1) main_~n~0)) (not (<= 1 v_it_10)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} is VALID [2022-04-28 03:39:50,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {2695#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_10 Int)) (or (not (<= (+ main_~x~0 v_it_10 1) main_~n~0)) (not (<= 1 v_it_10)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} [82] 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[] {2699#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:39:50,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {2699#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {2703#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:39:50,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {2703#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2707#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:39:50,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {2707#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 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; {2711#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))))} is VALID [2022-04-28 03:39:50,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {2711#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2715#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:39:50,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {2715#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2719#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (= main_~y~0 (+ main_~z~0 3)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:39:50,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {2719#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (= main_~y~0 (+ main_~z~0 3)) (<= (mod main_~z~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; {2723#(and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)) (not (<= v_it_10 main_~y~0)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:39:50,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {2723#(and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)) (not (<= v_it_10 main_~y~0)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~z~0 (+ (- 1) main_~y~0)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 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; {2727#(and (< 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= main_~y~0 (+ (- 1) main_~z~0)) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= v_it_10 (+ main_~y~0 1))) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))))} is VALID [2022-04-28 03:39:50,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {2727#(and (< 0 (+ main_~y~0 2)) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= main_~y~0 (+ (- 1) main_~z~0)) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= v_it_10 (+ main_~y~0 1))) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~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; {2731#(and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= v_it_10 (+ main_~y~0 2))) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (= main_~z~0 (+ main_~y~0 3)) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:39:50,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2731#(and (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= v_it_10 (+ main_~y~0 2))) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (= main_~z~0 (+ main_~y~0 3)) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2735#(and (< 0 main_~z~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~z~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:39:50,759 INFO L272 TraceCheckUtils]: 17: Hoare triple {2735#(and (< 0 main_~z~0) (forall ((v_it_10 Int)) (or (not (<= 1 v_it_10)) (not (<= (+ v_it_10 1) main_~z~0)) (< 0 (mod (+ (* 4294967295 v_it_10) main_~n~0) 4294967296)))) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:39:50,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:39:50,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {2743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2656#false} is VALID [2022-04-28 03:39:50,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {2656#false} assume !false; {2656#false} is VALID [2022-04-28 03:39:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-04-28 03:39:50,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:02,724 WARN L232 SmtUtils]: Spent 18.70s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:41:04,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {2656#false} assume !false; {2656#false} is VALID [2022-04-28 03:41:04,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {2743#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2656#false} is VALID [2022-04-28 03:41:04,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2743#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:04,227 INFO L272 TraceCheckUtils]: 17: Hoare triple {2670#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2739#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:04,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {2762#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2670#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:04,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {2766#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 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; {2762#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:04,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {2770#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~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; {2766#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:41:04,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 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; {2770#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:41:04,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {2778#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2774#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:41:04,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {2782#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2778#(or (< 0 (mod main_~z~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:41:04,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {2786#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 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; {2782#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:41:04,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {2790#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 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; {2786#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:41:04,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {2794#(or (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {2790#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:41:04,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {2798#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [82] 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[] {2794#(or (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:41:06,268 WARN L290 TraceCheckUtils]: 6: Hoare triple {2802#(and (or (and (forall ((aux_div_aux_mod_v_main_~x~0_103_32_123 Int) (aux_div_v_main_~x~0_103_32 Int) (aux_div_v_main_~y~0_115_47 Int) (aux_mod_aux_mod_v_main_~x~0_103_32_123 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293) (* 4294967296 aux_div_v_main_~y~0_115_47)) (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123) (+ main_~y~0 main_~x~0)) (< (* 4294967296 aux_div_v_main_~y~0_115_47) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293)) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123))) (>= aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967296) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (exists ((v_it_10 Int)) (and (<= (+ main_~y~0 v_it_10 1) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (not (< 0 (mod (+ (* 4294967295 v_it_10) main_~x~0) 4294967296))) (<= 1 v_it_10))) (<= (+ aux_mod_aux_mod_v_main_~x~0_103_32_123 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))) (forall ((aux_div_aux_mod_v_main_~x~0_103_32_123 Int) (aux_div_v_main_~x~0_103_32 Int) (aux_div_v_main_~y~0_115_47 Int) (aux_mod_aux_mod_v_main_~x~0_103_32_123 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293) (* 4294967296 aux_div_v_main_~y~0_115_47)) (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123) (+ main_~y~0 main_~x~0)) (> 0 aux_mod_aux_mod_v_main_~x~0_103_32_123) (< (* 4294967296 aux_div_v_main_~y~0_115_47) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293)) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~x~0_103_32_123 (* (div main_~n~0 4294967296) 4294967296) 1)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (exists ((v_it_10 Int)) (and (<= (+ main_~y~0 v_it_10 1) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (not (< 0 (mod (+ (* 4294967295 v_it_10) main_~x~0) 4294967296))) (<= 1 v_it_10)))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< (div (+ (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0) 4294967296) 2)) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))))} [83] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_95 4294967296)) (.cse1 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse2 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse3 (= |v_main_#t~post6_53| |v_main_#t~post6_52|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 (= v_main_~y~0_103 v_main_~y~0_104)) (and (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_94 v_it_10 1) v_main_~x~0_95)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_10)) 4294967296)))) (< 0 .cse0) (= v_main_~y~0_103 (+ v_main_~x~0_95 v_main_~y~0_104 (* (- 1) v_main_~x~0_94))) (< v_main_~x~0_94 v_main_~x~0_95)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_104 v_main_~y~0_103)))) InVars {main_~y~0=v_main_~y~0_104, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_103, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2798#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is UNKNOWN [2022-04-28 03:41:06,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {2655#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2802#(and (or (and (forall ((aux_div_aux_mod_v_main_~x~0_103_32_123 Int) (aux_div_v_main_~x~0_103_32 Int) (aux_div_v_main_~y~0_115_47 Int) (aux_mod_aux_mod_v_main_~x~0_103_32_123 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293) (* 4294967296 aux_div_v_main_~y~0_115_47)) (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123) (+ main_~y~0 main_~x~0)) (< (* 4294967296 aux_div_v_main_~y~0_115_47) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293)) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123))) (>= aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967296) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (exists ((v_it_10 Int)) (and (<= (+ main_~y~0 v_it_10 1) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (not (< 0 (mod (+ (* 4294967295 v_it_10) main_~x~0) 4294967296))) (<= 1 v_it_10))) (<= (+ aux_mod_aux_mod_v_main_~x~0_103_32_123 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))) (forall ((aux_div_aux_mod_v_main_~x~0_103_32_123 Int) (aux_div_v_main_~x~0_103_32 Int) (aux_div_v_main_~y~0_115_47 Int) (aux_mod_aux_mod_v_main_~x~0_103_32_123 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293) (* 4294967296 aux_div_v_main_~y~0_115_47)) (< (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123) (+ main_~y~0 main_~x~0)) (> 0 aux_mod_aux_mod_v_main_~x~0_103_32_123) (< (* 4294967296 aux_div_v_main_~y~0_115_47) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123 4294967293)) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~x~0_103_32_123 (* (div main_~n~0 4294967296) 4294967296) 1)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) (* 4294967296 aux_div_v_main_~x~0_103_32) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (exists ((v_it_10 Int)) (and (<= (+ main_~y~0 v_it_10 1) (+ (* aux_div_aux_mod_v_main_~x~0_103_32_123 4294967296) aux_mod_aux_mod_v_main_~x~0_103_32_123)) (not (< 0 (mod (+ (* 4294967295 v_it_10) main_~x~0) 4294967296))) (<= 1 v_it_10)))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))) (< (div (+ (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0) 4294967296) 2)) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))))} is VALID [2022-04-28 03:41:06,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {2655#true} call #t~ret11 := main(); {2655#true} is VALID [2022-04-28 03:41:06,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2655#true} {2655#true} #61#return; {2655#true} is VALID [2022-04-28 03:41:06,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {2655#true} assume true; {2655#true} is VALID [2022-04-28 03:41:06,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {2655#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2655#true} is VALID [2022-04-28 03:41:06,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {2655#true} call ULTIMATE.init(); {2655#true} is VALID [2022-04-28 03:41:06,287 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:41:06,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14227433] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:06,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:06,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 40 [2022-04-28 03:41:22,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:22,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1132204021] [2022-04-28 03:41:22,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1132204021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:22,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:22,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:41:22,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438167625] [2022-04-28 03:41:22,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:22,718 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:22,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:22,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:22,757 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:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:41:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:41:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1376, Unknown=29, NotChecked=78, Total=1722 [2022-04-28 03:41:22,758 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:27,411 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 03:41:27,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:41:27,411 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:27,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 33 transitions. [2022-04-28 03:41:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 33 transitions. [2022-04-28 03:41:27,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 33 transitions. [2022-04-28 03:41:27,482 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:27,484 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:41:27,484 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:41:27,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 118.9s TimeCoverageRelationStatistics Valid=321, Invalid=2305, Unknown=30, NotChecked=100, Total=2756 [2022-04-28 03:41:27,487 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:27,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 72 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 177 Invalid, 0 Unknown, 21 Unchecked, 0.3s Time] [2022-04-28 03:41:27,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:41:27,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-04-28 03:41:27,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:27,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,565 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,565 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:27,565 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 03:41:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 03:41:27,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:27,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:27,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:41:27,566 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:41:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:27,566 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 03:41:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 03:41:27,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:27,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:27,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:27,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:27,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-28 03:41:27,567 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 22 [2022-04-28 03:41:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:27,567 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-28 03:41:27,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 15 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:27,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 28 transitions. [2022-04-28 03:41:32,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 26 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:32,613 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-28 03:41:32,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:41:32,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:32,613 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:32,629 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:41:32,813 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,SelfDestructingSolverStorable10 [2022-04-28 03:41:32,814 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:32,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1586088817, now seen corresponding path program 9 times [2022-04-28 03:41:32,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:32,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2004976399] [2022-04-28 03:41:32,990 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:32,992 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1586266705, now seen corresponding path program 1 times [2022-04-28 03:41:32,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:32,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455959310] [2022-04-28 03:41:32,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:32,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:33,002 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:41:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,012 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:41:33,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {3032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3019#true} is VALID [2022-04-28 03:41:33,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-28 03:41:33,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3019#true} {3019#true} #61#return; {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:33,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {3032#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #61#return; {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret11 := main(); {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_109 4294967296)) (.cse0 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse2 (= v_main_~x~0_109 v_main_~x~0_108))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) (<= .cse3 0)) (and (< v_main_~y~0_121 v_main_~y~0_120) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~y~0_121 v_it_11 1) v_main_~y~0_120)) (< 0 (mod (+ v_main_~x~0_109 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_108 (+ v_main_~x~0_109 v_main_~y~0_121 (* (- 1) v_main_~y~0_120)))) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_108, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3019#true} is VALID [2022-04-28 03:41:33,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {3019#true} [84] 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[] {3019#true} is VALID [2022-04-28 03:41:33,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#true} ~z~0 := ~y~0; {3024#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:33,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {3024#(= (+ 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; {3025#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:33,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {3025#(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; {3026#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:33,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {3026#(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; {3027#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:33,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {3027#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {3028#(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:41:33,155 INFO L290 TraceCheckUtils]: 13: Hoare triple {3028#(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; {3029#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:33,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {3029#(<= 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; {3030#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:33,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {3030#(<= 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; {3031#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {3031#(<= 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; {3020#false} is VALID [2022-04-28 03:41:33,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#false} assume !(~y~0 % 4294967296 > 0); {3020#false} is VALID [2022-04-28 03:41:33,157 INFO L272 TraceCheckUtils]: 18: Hoare triple {3020#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3020#false} is VALID [2022-04-28 03:41:33,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {3020#false} ~cond := #in~cond; {3020#false} is VALID [2022-04-28 03:41:33,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {3020#false} assume 0 == ~cond; {3020#false} is VALID [2022-04-28 03:41:33,157 INFO L290 TraceCheckUtils]: 21: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-04-28 03:41:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:33,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455959310] [2022-04-28 03:41:33,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455959310] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:33,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334705116] [2022-04-28 03:41:33,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:33,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:33,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:33,168 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:41:33,169 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:41:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:41:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:33,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:33,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3019#true} is VALID [2022-04-28 03:41:33,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3019#true} is VALID [2022-04-28 03:41:33,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-28 03:41:33,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #61#return; {3019#true} is VALID [2022-04-28 03:41:33,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret11 := main(); {3019#true} is VALID [2022-04-28 03:41:33,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3019#true} is VALID [2022-04-28 03:41:33,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_109 4294967296)) (.cse0 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse2 (= v_main_~x~0_109 v_main_~x~0_108))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) (<= .cse3 0)) (and (< v_main_~y~0_121 v_main_~y~0_120) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~y~0_121 v_it_11 1) v_main_~y~0_120)) (< 0 (mod (+ v_main_~x~0_109 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_108 (+ v_main_~x~0_109 v_main_~y~0_121 (* (- 1) v_main_~y~0_120)))) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_108, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3019#true} is VALID [2022-04-28 03:41:33,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {3019#true} [84] 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[] {3019#true} is VALID [2022-04-28 03:41:33,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#true} ~z~0 := ~y~0; {3024#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:41:33,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {3024#(= (+ 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; {3025#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:33,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {3025#(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; {3026#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:33,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {3026#(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; {3027#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:33,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {3027#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {3072#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:41:33,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {3072#(<= (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; {3029#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:33,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {3029#(<= 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; {3030#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:33,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {3030#(<= 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; {3031#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:33,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {3031#(<= 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; {3020#false} is VALID [2022-04-28 03:41:33,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#false} assume !(~y~0 % 4294967296 > 0); {3020#false} is VALID [2022-04-28 03:41:33,539 INFO L272 TraceCheckUtils]: 18: Hoare triple {3020#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3020#false} is VALID [2022-04-28 03:41:33,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {3020#false} ~cond := #in~cond; {3020#false} is VALID [2022-04-28 03:41:33,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {3020#false} assume 0 == ~cond; {3020#false} is VALID [2022-04-28 03:41:33,540 INFO L290 TraceCheckUtils]: 21: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-04-28 03:41:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:33,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:34,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2022-04-28 03:41:34,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {3020#false} assume 0 == ~cond; {3020#false} is VALID [2022-04-28 03:41:34,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {3020#false} ~cond := #in~cond; {3020#false} is VALID [2022-04-28 03:41:34,127 INFO L272 TraceCheckUtils]: 18: Hoare triple {3020#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3020#false} is VALID [2022-04-28 03:41:34,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#false} assume !(~y~0 % 4294967296 > 0); {3020#false} is VALID [2022-04-28 03:41:34,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {3031#(<= 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; {3020#false} is VALID [2022-04-28 03:41:34,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {3030#(<= 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; {3031#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:34,130 INFO L290 TraceCheckUtils]: 14: Hoare triple {3029#(<= 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; {3030#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:41:34,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {3072#(<= (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; {3029#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:34,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {3127#(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); {3072#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:41:34,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {3131#(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; {3127#(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:41:34,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {3135#(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; {3131#(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:41:34,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {3139#(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; {3135#(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:41:34,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {3019#true} ~z~0 := ~y~0; {3139#(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:41:34,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {3019#true} [84] 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[] {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#true} [85] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_109 4294967296)) (.cse0 (= v_main_~y~0_121 v_main_~y~0_120)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse2 (= v_main_~x~0_109 v_main_~x~0_108))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) (<= .cse3 0)) (and (< v_main_~y~0_121 v_main_~y~0_120) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~y~0_121 v_it_11 1) v_main_~y~0_120)) (< 0 (mod (+ v_main_~x~0_109 (* 4294967295 v_it_11)) 4294967296)))) (< 0 .cse3) (= v_main_~x~0_108 (+ v_main_~x~0_109 v_main_~y~0_121 (* (- 1) v_main_~y~0_120)))) (and .cse0 (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_121, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_109, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_120, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_108, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {3019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret11 := main(); {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #61#return; {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3019#true} is VALID [2022-04-28 03:41:34,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3019#true} is VALID [2022-04-28 03:41:34,139 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:34,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334705116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:34,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:34,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 03:41:34,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:34,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2004976399] [2022-04-28 03:41:34,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2004976399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:34,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:34,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:41:34,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068674921] [2022-04-28 03:41:34,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:34,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:41:34,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:34,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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:34,227 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:34,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:41:34,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:41:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:41:34,228 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,163 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-28 03:41:35,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:41:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:41:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. [2022-04-28 03:41:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 42 transitions. [2022-04-28 03:41:35,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 42 transitions. [2022-04-28 03:41:35,217 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:35,217 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:41:35,217 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:41:35,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:41:35,218 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:35,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 58 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:41:35,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:41:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:41:35,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:35,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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:35,303 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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:35,303 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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:35,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,304 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:41:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:41:35,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:35,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:35,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 25 states. [2022-04-28 03:41:35,304 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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 25 states. [2022-04-28 03:41:35,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,305 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 03:41:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:41:35,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:35,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:35,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:35,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:35,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.15) internal successors, (23), 20 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:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 03:41:35,305 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-04-28 03:41:35,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:35,306 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 03:41:35,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 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:35,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 03:41:42,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 24 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 03:41:42,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:41:42,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:42,622 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:42,639 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:41:42,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:42,823 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:42,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:42,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1773782399, now seen corresponding path program 10 times [2022-04-28 03:41:42,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:42,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710115571] [2022-04-28 03:41:42,993 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,994 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2036813088, now seen corresponding path program 1 times [2022-04-28 03:41:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:42,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398948638] [2022-04-28 03:41:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:43,006 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:41:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:43,017 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:43,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {3405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3392#true} is VALID [2022-04-28 03:41:43,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {3392#true} assume true; {3392#true} is VALID [2022-04-28 03:41:43,172 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3392#true} {3392#true} #61#return; {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {3392#true} call ULTIMATE.init(); {3405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:43,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3405#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {3392#true} assume true; {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3392#true} {3392#true} #61#return; {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {3392#true} call #t~ret11 := main(); {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {3392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {3392#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse1 (= |v_main_#t~post5_65| |v_main_#t~post5_64|)) (.cse2 (= v_main_~y~0_137 v_main_~y~0_136)) (.cse3 (mod v_main_~x~0_120 4294967296))) (or (and (= v_main_~x~0_120 v_main_~x~0_119) .cse0 .cse1 .cse2) (and (= v_main_~x~0_119 v_main_~x~0_120) (<= .cse3 0) .cse0 .cse1 .cse2) (and (= v_main_~y~0_136 (+ v_main_~x~0_120 v_main_~y~0_137 (* v_main_~x~0_119 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_119 v_it_12 1) v_main_~x~0_120)) (< 0 (mod (+ v_main_~x~0_120 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse3) (< v_main_~x~0_119 v_main_~x~0_120)))) InVars {main_~y~0=v_main_~y~0_137, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_120, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3392#true} is VALID [2022-04-28 03:41:43,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {3392#true} [86] 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[] {3392#true} is VALID [2022-04-28 03:41:43,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {3392#true} ~z~0 := ~y~0; {3397#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:43,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {3397#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3398#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:43,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {3398#(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; {3399#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:43,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {3399#(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; {3400#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:43,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#(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; {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:43,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:43,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {3401#(<= 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; {3402#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:41:43,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= 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; {3403#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:43,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {3403#(<= 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; {3404#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:43,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {3404#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3393#false} is VALID [2022-04-28 03:41:43,182 INFO L272 TraceCheckUtils]: 18: Hoare triple {3393#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3393#false} is VALID [2022-04-28 03:41:43,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {3393#false} ~cond := #in~cond; {3393#false} is VALID [2022-04-28 03:41:43,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {3393#false} assume 0 == ~cond; {3393#false} is VALID [2022-04-28 03:41:43,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {3393#false} assume !false; {3393#false} is VALID [2022-04-28 03:41:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:43,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398948638] [2022-04-28 03:41:43,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398948638] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:43,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1205172468] [2022-04-28 03:41:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:43,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:43,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:43,183 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:41:43,189 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:41:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:43,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:41:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:43,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:43,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {3392#true} call ULTIMATE.init(); {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {3392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {3392#true} assume true; {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3392#true} {3392#true} #61#return; {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {3392#true} call #t~ret11 := main(); {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {3392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {3392#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse1 (= |v_main_#t~post5_65| |v_main_#t~post5_64|)) (.cse2 (= v_main_~y~0_137 v_main_~y~0_136)) (.cse3 (mod v_main_~x~0_120 4294967296))) (or (and (= v_main_~x~0_120 v_main_~x~0_119) .cse0 .cse1 .cse2) (and (= v_main_~x~0_119 v_main_~x~0_120) (<= .cse3 0) .cse0 .cse1 .cse2) (and (= v_main_~y~0_136 (+ v_main_~x~0_120 v_main_~y~0_137 (* v_main_~x~0_119 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_119 v_it_12 1) v_main_~x~0_120)) (< 0 (mod (+ v_main_~x~0_120 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse3) (< v_main_~x~0_119 v_main_~x~0_120)))) InVars {main_~y~0=v_main_~y~0_137, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_120, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3392#true} is VALID [2022-04-28 03:41:43,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {3392#true} [86] 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[] {3392#true} is VALID [2022-04-28 03:41:43,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {3392#true} ~z~0 := ~y~0; {3397#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:43,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {3397#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3398#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:41:43,605 INFO L290 TraceCheckUtils]: 10: Hoare triple {3398#(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; {3399#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:41:43,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {3399#(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; {3400#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:41:43,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {3400#(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; {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:43,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:43,608 INFO L290 TraceCheckUtils]: 14: Hoare triple {3401#(<= 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; {3402#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:41:43,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= 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; {3403#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:43,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {3403#(<= 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; {3404#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:43,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {3404#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3393#false} is VALID [2022-04-28 03:41:43,612 INFO L272 TraceCheckUtils]: 18: Hoare triple {3393#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3393#false} is VALID [2022-04-28 03:41:43,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {3393#false} ~cond := #in~cond; {3393#false} is VALID [2022-04-28 03:41:43,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {3393#false} assume 0 == ~cond; {3393#false} is VALID [2022-04-28 03:41:43,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {3393#false} assume !false; {3393#false} is VALID [2022-04-28 03:41:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:43,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:43,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {3393#false} assume !false; {3393#false} is VALID [2022-04-28 03:41:43,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {3393#false} assume 0 == ~cond; {3393#false} is VALID [2022-04-28 03:41:43,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {3393#false} ~cond := #in~cond; {3393#false} is VALID [2022-04-28 03:41:43,977 INFO L272 TraceCheckUtils]: 18: Hoare triple {3393#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3393#false} is VALID [2022-04-28 03:41:43,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {3404#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {3393#false} is VALID [2022-04-28 03:41:43,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {3403#(<= 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; {3404#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:41:43,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {3402#(<= 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; {3403#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:41:43,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {3401#(<= 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; {3402#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:41:43,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:43,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {3499#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3401#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:41:43,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {3503#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3499#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:41:43,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {3507#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3503#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:41:43,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {3511#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3507#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:41:43,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {3392#true} ~z~0 := ~y~0; {3511#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:41:43,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {3392#true} [86] 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[] {3392#true} is VALID [2022-04-28 03:41:43,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {3392#true} [87] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_65| |v_main_#t~post6_64|)) (.cse1 (= |v_main_#t~post5_65| |v_main_#t~post5_64|)) (.cse2 (= v_main_~y~0_137 v_main_~y~0_136)) (.cse3 (mod v_main_~x~0_120 4294967296))) (or (and (= v_main_~x~0_120 v_main_~x~0_119) .cse0 .cse1 .cse2) (and (= v_main_~x~0_119 v_main_~x~0_120) (<= .cse3 0) .cse0 .cse1 .cse2) (and (= v_main_~y~0_136 (+ v_main_~x~0_120 v_main_~y~0_137 (* v_main_~x~0_119 (- 1)))) (forall ((v_it_12 Int)) (or (not (<= (+ v_main_~x~0_119 v_it_12 1) v_main_~x~0_120)) (< 0 (mod (+ v_main_~x~0_120 (* 4294967295 v_it_12)) 4294967296)) (not (<= 1 v_it_12)))) (< 0 .cse3) (< v_main_~x~0_119 v_main_~x~0_120)))) InVars {main_~y~0=v_main_~y~0_137, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_120, main_#t~post6=|v_main_#t~post6_65|} OutVars{main_~y~0=v_main_~y~0_136, main_#t~post5=|v_main_#t~post5_64|, main_~x~0=v_main_~x~0_119, main_#t~post6=|v_main_#t~post6_64|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3392#true} is VALID [2022-04-28 03:41:43,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {3392#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3392#true} is VALID [2022-04-28 03:41:43,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {3392#true} call #t~ret11 := main(); {3392#true} is VALID [2022-04-28 03:41:43,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3392#true} {3392#true} #61#return; {3392#true} is VALID [2022-04-28 03:41:43,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {3392#true} assume true; {3392#true} is VALID [2022-04-28 03:41:43,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {3392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3392#true} is VALID [2022-04-28 03:41:43,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {3392#true} call ULTIMATE.init(); {3392#true} is VALID [2022-04-28 03:41:43,989 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:43,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1205172468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:43,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:43,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-28 03:41:44,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:44,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710115571] [2022-04-28 03:41:44,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710115571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:44,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:44,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:41:44,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598629101] [2022-04-28 03:41:44,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:44,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:41:44,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:44,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:44,141 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:41:44,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:41:44,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:44,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:41:44,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:41:44,142 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,407 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-28 03:41:45,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:41:45,407 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:41:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2022-04-28 03:41:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2022-04-28 03:41:45,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 33 transitions. [2022-04-28 03:41:45,486 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:45,487 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:41:45,487 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:41:45,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:41:45,487 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:45,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:41:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:41:45,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 03:41:45,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:45,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,569 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,569 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,570 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 03:41:45,570 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:41:45,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:45,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:45,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:41:45,570 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:41:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:45,571 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 03:41:45,571 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:41:45,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:45,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:45,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:45,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 03:41:45,572 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2022-04-28 03:41:45,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:45,572 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 03:41:45,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:45,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 03:41:52,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 25 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:52,343 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 03:41:52,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:41:52,343 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:52,343 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:52,362 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:41:52,558 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,SelfDestructingSolverStorable12 [2022-04-28 03:41:52,558 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:52,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:52,559 INFO L85 PathProgramCache]: Analyzing trace with hash -812825394, now seen corresponding path program 11 times [2022-04-28 03:41:52,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:52,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2113367329] [2022-04-28 03:41:52,747 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:52,748 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:52,750 INFO L85 PathProgramCache]: Analyzing trace with hash 436742413, now seen corresponding path program 1 times [2022-04-28 03:41:52,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:52,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200538308] [2022-04-28 03:41:52,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:52,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:52,757 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:41:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:52,798 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:53,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {3752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3736#true} is VALID [2022-04-28 03:41:53,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {3736#true} assume true; {3736#true} is VALID [2022-04-28 03:41:53,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3736#true} {3736#true} #61#return; {3736#true} is VALID [2022-04-28 03:41:53,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {3736#true} call ULTIMATE.init(); {3752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:53,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {3752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3736#true} is VALID [2022-04-28 03:41:53,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {3736#true} assume true; {3736#true} is VALID [2022-04-28 03:41:53,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3736#true} {3736#true} #61#return; {3736#true} is VALID [2022-04-28 03:41:53,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {3736#true} call #t~ret11 := main(); {3736#true} is VALID [2022-04-28 03:41:53,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {3736#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3741#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:53,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {3741#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [89] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse2 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse3 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse0 (mod v_main_~x~0_133 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (< 0 .cse0) (= v_main_~x~0_132 (+ v_main_~x~0_133 v_main_~y~0_152 (* (- 1) v_main_~y~0_151))) (< v_main_~y~0_152 v_main_~y~0_151) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_152 v_it_13 1) v_main_~y~0_151)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_152, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_151, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3742#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:53,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {3742#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [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[] {3743#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:41:53,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {3743#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {3744#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:41:53,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {3744#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~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; {3745#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:53,046 INFO L290 TraceCheckUtils]: 10: Hoare triple {3745#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {3746#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {3746#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {3747#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:41:53,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {3747#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) 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; {3748#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:41:53,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {3748#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} assume !(~z~0 % 4294967296 > 0); {3748#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:41:53,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) 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; {3747#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:41:53,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {3747#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) 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; {3746#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:53,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {3746#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {3745#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:53,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {3745#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {3749#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:53,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {3749#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3749#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:41:53,055 INFO L272 TraceCheckUtils]: 19: Hoare triple {3749#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3750#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:53,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {3750#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3751#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:53,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {3751#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3737#false} is VALID [2022-04-28 03:41:53,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {3737#false} assume !false; {3737#false} is VALID [2022-04-28 03:41:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:53,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:53,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200538308] [2022-04-28 03:41:53,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200538308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:53,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982835514] [2022-04-28 03:41:53,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:53,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:53,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:53,058 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:41:53,063 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:41:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:41:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:53,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:28,979 WARN L232 SmtUtils]: Spent 13.32s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:42:47,028 WARN L232 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:43:08,943 WARN L232 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:43:27,948 WARN L232 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:43:58,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {3736#true} call ULTIMATE.init(); {3736#true} is VALID [2022-04-28 03:43:58,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {3736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3736#true} is VALID [2022-04-28 03:43:58,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {3736#true} assume true; {3736#true} is VALID [2022-04-28 03:43:58,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3736#true} {3736#true} #61#return; {3736#true} is VALID [2022-04-28 03:43:58,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {3736#true} call #t~ret11 := main(); {3736#true} is VALID [2022-04-28 03:43:58,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {3736#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3741#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:43:58,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {3741#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [89] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse2 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse3 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse0 (mod v_main_~x~0_133 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (< 0 .cse0) (= v_main_~x~0_132 (+ v_main_~x~0_133 v_main_~y~0_152 (* (- 1) v_main_~y~0_151))) (< v_main_~y~0_152 v_main_~y~0_151) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_152 v_it_13 1) v_main_~y~0_151)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_152, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_151, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3774#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} is VALID [2022-04-28 03:43:58,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {3774#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)))} [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[] {3778#(or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:43:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {3778#(or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {3782#(and (= main_~z~0 main_~y~0) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:43:58,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3782#(and (= main_~z~0 main_~y~0) (or (and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3786#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:58,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {3786#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (= 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; {3790#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:58,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {3790#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3794#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:58,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {3794#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 3)) (< 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; {3798#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:58,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {3798#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~y~0 (+ main_~z~0 4)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (< 0 main_~y~0) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3802#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~y~0 (+ main_~z~0 4)) (< 0 main_~y~0) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:43:58,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {3802#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (= main_~y~0 (+ main_~z~0 4)) (< 0 main_~y~0) (<= (mod main_~z~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; {3806#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= v_it_13 main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (= (+ (- 2) main_~y~0) main_~z~0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:58,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {3806#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= v_it_13 main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (= (+ (- 2) main_~y~0) main_~z~0) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 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; {3810#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= v_it_13 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (= (+ main_~z~0 1) (+ main_~y~0 1)))} is VALID [2022-04-28 03:43:58,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {3810#(and (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= v_it_13 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (+ main_~z~0 2)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)) (<= (mod (+ main_~z~0 4294967294) 4294967296) 0) (= (+ 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; {3814#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= v_it_13 main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:43:58,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {3814#(and (= (+ (- 1) main_~z~0) (+ main_~y~0 1)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= v_it_13 main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (< 0 (+ main_~z~0 1)) (<= (mod (+ main_~z~0 4294967293) 4294967296) 0) (<= (div (+ main_~z~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 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; {3818#(and (< 0 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~y~0 2) (+ (- 2) main_~z~0)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:43:58,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {3818#(and (< 0 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (= (+ main_~y~0 2) (+ (- 2) main_~z~0)) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3822#(and (< 0 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:43:58,970 INFO L272 TraceCheckUtils]: 19: Hoare triple {3822#(and (< 0 main_~z~0) (<= (mod (+ 4294967292 main_~z~0) 4294967296) 0) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_it_13 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_13)) 4294967296)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3826#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:43:58,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {3826#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3830#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:43:58,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3737#false} is VALID [2022-04-28 03:43:58,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {3737#false} assume !false; {3737#false} is VALID [2022-04-28 03:43:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:58,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:45:19,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {3737#false} assume !false; {3737#false} is VALID [2022-04-28 03:45:19,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {3830#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3737#false} is VALID [2022-04-28 03:45:19,163 INFO L290 TraceCheckUtils]: 20: Hoare triple {3826#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3830#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:19,170 INFO L272 TraceCheckUtils]: 19: Hoare triple {3749#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3826#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:19,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {3849#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3749#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:45:19,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {3853#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 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; {3849#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:19,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {3857#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~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; {3853#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:19,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {3861#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 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; {3857#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:19,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {3865#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 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; {3861#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:19,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {3869#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3865#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:19,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {3873#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~y~0) 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; {3869#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:19,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {3877#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3873#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:45:19,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {3881#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~y~0) 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; {3877#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:19,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {3885#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 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; {3881#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:45:19,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {3889#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {3885#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:45:19,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {3893#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [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[] {3889#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:45:21,211 WARN L290 TraceCheckUtils]: 6: Hoare triple {3897#(and (forall ((aux_div_aux_mod_v_main_~y~0_165_47_104 Int) (aux_div_v_main_~y~0_165_47 Int) (aux_mod_aux_mod_v_main_~y~0_165_47_104 Int)) (or (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104 1)) (< (* 4294967296 aux_div_v_main_~y~0_165_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (and (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ main_~y~0 v_it_13 1) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_13)) 4294967296))))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_142_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104))))) (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< aux_mod_aux_mod_v_main_~y~0_165_47_104 0) (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (* 4294967296 aux_div_v_main_~y~0_165_47)))) (forall ((aux_div_aux_mod_v_main_~y~0_165_47_104 Int) (aux_div_v_main_~y~0_165_47 Int) (aux_mod_aux_mod_v_main_~y~0_165_47_104 Int)) (or (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) main_~n~0) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_165_47_104) (< (* 4294967296 aux_div_v_main_~y~0_165_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (and (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ main_~y~0 v_it_13 1) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_13)) 4294967296))))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_142_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104))))) (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (* 4294967296 aux_div_v_main_~y~0_165_47)))))} [89] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_152 v_main_~y~0_151)) (.cse2 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse3 (= |v_main_#t~post5_70| |v_main_#t~post5_69|)) (.cse0 (mod v_main_~x~0_133 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_69| |v_main_#t~post6_70|) .cse3) (and .cse1 .cse2 .cse3 (= |v_main_#t~post6_70| |v_main_#t~post6_69|)) (and (< 0 .cse0) (= v_main_~x~0_132 (+ v_main_~x~0_133 v_main_~y~0_152 (* (- 1) v_main_~y~0_151))) (< v_main_~y~0_152 v_main_~y~0_151) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_152 v_it_13 1) v_main_~y~0_151)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296))))))) InVars {main_~y~0=v_main_~y~0_152, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_70|} OutVars{main_~y~0=v_main_~y~0_151, main_#t~post5=|v_main_#t~post5_69|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_69|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3893#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is UNKNOWN [2022-04-28 03:45:21,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {3736#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3897#(and (forall ((aux_div_aux_mod_v_main_~y~0_165_47_104 Int) (aux_div_v_main_~y~0_165_47 Int) (aux_mod_aux_mod_v_main_~y~0_165_47_104 Int)) (or (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104 1)) (< (* 4294967296 aux_div_v_main_~y~0_165_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (and (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ main_~y~0 v_it_13 1) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_13)) 4294967296))))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_142_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104))))) (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< aux_mod_aux_mod_v_main_~y~0_165_47_104 0) (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (* 4294967296 aux_div_v_main_~y~0_165_47)))) (forall ((aux_div_aux_mod_v_main_~y~0_165_47_104 Int) (aux_div_v_main_~y~0_165_47 Int) (aux_mod_aux_mod_v_main_~y~0_165_47_104 Int)) (or (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) main_~n~0) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_165_47_104) (< (* 4294967296 aux_div_v_main_~y~0_165_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (and (or (exists ((v_it_13 Int)) (and (<= 1 v_it_13) (<= (+ main_~y~0 v_it_13 1) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104)) (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_13)) 4294967296))))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_142_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) (* 4294967296 aux_div_v_main_~x~0_142_32) aux_mod_aux_mod_v_main_~y~0_165_47_104))))) (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_165_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_165_47_104) (* 4294967296 aux_div_v_main_~y~0_165_47)))))} is VALID [2022-04-28 03:45:21,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {3736#true} call #t~ret11 := main(); {3736#true} is VALID [2022-04-28 03:45:21,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3736#true} {3736#true} #61#return; {3736#true} is VALID [2022-04-28 03:45:21,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {3736#true} assume true; {3736#true} is VALID [2022-04-28 03:45:21,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {3736#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3736#true} is VALID [2022-04-28 03:45:21,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {3736#true} call ULTIMATE.init(); {3736#true} is VALID [2022-04-28 03:45:21,247 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:21,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982835514] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:45:21,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:45:21,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 42 [2022-04-28 03:46:09,561 WARN L232 SmtUtils]: Spent 8.21s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:46:09,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:09,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2113367329] [2022-04-28 03:46:09,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2113367329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:09,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:09,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:46:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228142239] [2022-04-28 03:46:09,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:09,565 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:46:09,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:09,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:09,600 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:46:09,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:46:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:46:09,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1629, Unknown=50, NotChecked=0, Total=1980 [2022-04-28 03:46:09,601 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:11,717 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-04-28 03:46:11,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:46:11,718 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:46:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:11,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2022-04-28 03:46:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:11,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2022-04-28 03:46:11,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 36 transitions. [2022-04-28 03:46:13,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:13,797 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:46:13,797 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:46:13,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 227.9s TimeCoverageRelationStatistics Valid=367, Invalid=2445, Unknown=50, NotChecked=0, Total=2862 [2022-04-28 03:46:13,798 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:13,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 62 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-04-28 03:46:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:46:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-04-28 03:46:13,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:13,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,910 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,910 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:13,911 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 03:46:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 03:46:13,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:13,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:13,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:46:13,911 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:46:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:13,912 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-28 03:46:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-04-28 03:46:13,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:13,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:13,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:13,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-04-28 03:46:13,913 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 25 [2022-04-28 03:46:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:13,913 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-04-28 03:46:13,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 14 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:13,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 31 transitions. [2022-04-28 03:46:20,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 28 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-04-28 03:46:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:46:20,334 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:20,334 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:20,340 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:46:20,534 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,SelfDestructingSolverStorable13 [2022-04-28 03:46:20,534 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 606711647, now seen corresponding path program 12 times [2022-04-28 03:46:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:20,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1941672579] [2022-04-28 03:46:20,986 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:20,988 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:20,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1401082688, now seen corresponding path program 1 times [2022-04-28 03:46:20,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:20,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783707489] [2022-04-28 03:46:20,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:20,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:20,997 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:46:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:21,008 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:46:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:21,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {4148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4133#true} is VALID [2022-04-28 03:46:21,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {4133#true} assume true; {4133#true} is VALID [2022-04-28 03:46:21,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4133#true} {4133#true} #61#return; {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {4133#true} call ULTIMATE.init(); {4148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:21,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {4148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {4133#true} assume true; {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4133#true} {4133#true} #61#return; {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {4133#true} call #t~ret11 := main(); {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {4133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {4133#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= |v_main_#t~post6_77| |v_main_#t~post6_76|)) (.cse2 (= |v_main_#t~post5_77| |v_main_#t~post5_76|)) (.cse3 (mod v_main_~x~0_149 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_149 v_main_~x~0_148) .cse2) (and (<= .cse3 0) .cse0 (= v_main_~x~0_148 v_main_~x~0_149) .cse1 .cse2) (and (< 0 .cse3) (= v_main_~x~0_148 (+ v_main_~x~0_149 (* (- 1) v_main_~y~0_171) v_main_~y~0_172)) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_172 v_it_14 1) v_main_~y~0_171)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~y~0_172 v_main_~y~0_171)))) InVars {main_~y~0=v_main_~y~0_172, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_77|} OutVars{main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_76|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4133#true} is VALID [2022-04-28 03:46:21,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {4133#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[] {4133#true} is VALID [2022-04-28 03:46:21,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {4133#true} ~z~0 := ~y~0; {4138#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:46:21,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {4138#(= (+ 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; {4139#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:21,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {4139#(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; {4140#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:21,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {4140#(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; {4141#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:21,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {4141#(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; {4142#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:21,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {4142#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4143#(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:46:21,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {4143#(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; {4144#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:21,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {4144#(<= 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; {4145#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:21,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {4145#(<= 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; {4146#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:21,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {4146#(<= 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; {4147#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:21,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {4147#(<= 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; {4134#false} is VALID [2022-04-28 03:46:21,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {4134#false} assume !(~y~0 % 4294967296 > 0); {4134#false} is VALID [2022-04-28 03:46:21,178 INFO L272 TraceCheckUtils]: 20: Hoare triple {4134#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4134#false} is VALID [2022-04-28 03:46:21,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {4134#false} ~cond := #in~cond; {4134#false} is VALID [2022-04-28 03:46:21,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {4134#false} assume 0 == ~cond; {4134#false} is VALID [2022-04-28 03:46:21,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {4134#false} assume !false; {4134#false} is VALID [2022-04-28 03:46:21,178 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:21,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783707489] [2022-04-28 03:46:21,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783707489] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:21,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731482495] [2022-04-28 03:46:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:21,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:21,180 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:46:21,180 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:46:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:21,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:46:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:21,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:21,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {4133#true} call ULTIMATE.init(); {4133#true} is VALID [2022-04-28 03:46:21,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {4133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {4133#true} assume true; {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4133#true} {4133#true} #61#return; {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {4133#true} call #t~ret11 := main(); {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {4133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {4133#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= |v_main_#t~post6_77| |v_main_#t~post6_76|)) (.cse2 (= |v_main_#t~post5_77| |v_main_#t~post5_76|)) (.cse3 (mod v_main_~x~0_149 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_149 v_main_~x~0_148) .cse2) (and (<= .cse3 0) .cse0 (= v_main_~x~0_148 v_main_~x~0_149) .cse1 .cse2) (and (< 0 .cse3) (= v_main_~x~0_148 (+ v_main_~x~0_149 (* (- 1) v_main_~y~0_171) v_main_~y~0_172)) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_172 v_it_14 1) v_main_~y~0_171)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~y~0_172 v_main_~y~0_171)))) InVars {main_~y~0=v_main_~y~0_172, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_77|} OutVars{main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_76|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {4133#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[] {4133#true} is VALID [2022-04-28 03:46:21,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {4133#true} ~z~0 := ~y~0; {4138#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:46:21,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {4138#(= (+ 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; {4139#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:21,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {4139#(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; {4140#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:21,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {4140#(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; {4141#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:21,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {4141#(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; {4142#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:21,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {4142#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4191#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-28 03:46:21,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {4191#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4144#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:21,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {4144#(<= 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; {4145#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:21,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {4145#(<= 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; {4146#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:21,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {4146#(<= 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; {4147#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:21,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {4147#(<= 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; {4134#false} is VALID [2022-04-28 03:46:21,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {4134#false} assume !(~y~0 % 4294967296 > 0); {4134#false} is VALID [2022-04-28 03:46:21,552 INFO L272 TraceCheckUtils]: 20: Hoare triple {4134#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4134#false} is VALID [2022-04-28 03:46:21,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {4134#false} ~cond := #in~cond; {4134#false} is VALID [2022-04-28 03:46:21,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {4134#false} assume 0 == ~cond; {4134#false} is VALID [2022-04-28 03:46:21,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {4134#false} assume !false; {4134#false} is VALID [2022-04-28 03:46:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:21,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:22,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {4134#false} assume !false; {4134#false} is VALID [2022-04-28 03:46:22,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {4134#false} assume 0 == ~cond; {4134#false} is VALID [2022-04-28 03:46:22,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {4134#false} ~cond := #in~cond; {4134#false} is VALID [2022-04-28 03:46:22,263 INFO L272 TraceCheckUtils]: 20: Hoare triple {4134#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4134#false} is VALID [2022-04-28 03:46:22,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {4134#false} assume !(~y~0 % 4294967296 > 0); {4134#false} is VALID [2022-04-28 03:46:22,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {4147#(<= 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; {4134#false} is VALID [2022-04-28 03:46:22,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {4146#(<= 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; {4147#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:46:22,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {4145#(<= 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; {4146#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:46:22,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {4144#(<= 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; {4145#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:22,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {4191#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4144#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:22,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {4252#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4191#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-28 03:46:22,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {4256#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4252#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:46:22,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4256#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:22,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {4264#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4260#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:46:22,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {4268#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4264#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:46:22,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {4133#true} ~z~0 := ~y~0; {4268#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:46:22,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {4133#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[] {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {4133#true} [91] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_172 v_main_~y~0_171)) (.cse1 (= |v_main_#t~post6_77| |v_main_#t~post6_76|)) (.cse2 (= |v_main_#t~post5_77| |v_main_#t~post5_76|)) (.cse3 (mod v_main_~x~0_149 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_149 v_main_~x~0_148) .cse2) (and (<= .cse3 0) .cse0 (= v_main_~x~0_148 v_main_~x~0_149) .cse1 .cse2) (and (< 0 .cse3) (= v_main_~x~0_148 (+ v_main_~x~0_149 (* (- 1) v_main_~y~0_171) v_main_~y~0_172)) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (not (<= (+ v_main_~y~0_172 v_it_14 1) v_main_~y~0_171)) (< 0 (mod (+ v_main_~x~0_149 (* 4294967295 v_it_14)) 4294967296)))) (< v_main_~y~0_172 v_main_~y~0_171)))) InVars {main_~y~0=v_main_~y~0_172, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_149, main_#t~post6=|v_main_#t~post6_77|} OutVars{main_~y~0=v_main_~y~0_171, main_#t~post5=|v_main_#t~post5_76|, main_~x~0=v_main_~x~0_148, main_#t~post6=|v_main_#t~post6_76|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {4133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {4133#true} call #t~ret11 := main(); {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4133#true} {4133#true} #61#return; {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {4133#true} assume true; {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {4133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {4133#true} call ULTIMATE.init(); {4133#true} is VALID [2022-04-28 03:46:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:22,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731482495] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:22,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:22,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2022-04-28 03:46:22,422 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:22,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1941672579] [2022-04-28 03:46:22,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1941672579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:22,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:22,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:46:22,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946057910] [2022-04-28 03:46:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:22,423 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:22,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:22,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:22,447 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:46:22,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:46:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:46:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:46:22,448 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:23,961 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-28 03:46:23,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:46:23,962 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:23,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2022-04-28 03:46:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:23,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 46 transitions. [2022-04-28 03:46:23,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 46 transitions. [2022-04-28 03:46:24,023 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:46:24,024 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:46:24,024 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:46:24,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:46:24,025 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:24,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 73 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:46:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:46:24,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:46:24,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:24,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:46:24,132 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:46:24,132 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:46:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:24,133 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 03:46:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 03:46:24,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:24,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:24,133 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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 28 states. [2022-04-28 03:46:24,133 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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 28 states. [2022-04-28 03:46:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:24,134 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-04-28 03:46:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 03:46:24,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:24,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:24,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:24,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 23 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:46:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-28 03:46:24,134 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2022-04-28 03:46:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:24,135 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-28 03:46:24,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 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:46:24,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-28 03:46:34,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 26 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:34,008 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 03:46:34,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:46:34,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:34,008 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:34,030 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:46:34,209 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,SelfDestructingSolverStorable14 [2022-04-28 03:46:34,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:34,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:34,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1542928431, now seen corresponding path program 13 times [2022-04-28 03:46:34,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:34,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169892449] [2022-04-28 03:46:36,605 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:36,607 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1074330223, now seen corresponding path program 1 times [2022-04-28 03:46:36,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:36,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104869323] [2022-04-28 03:46:36,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:36,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:36,618 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:46:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:36,633 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:46:36,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:36,804 INFO L290 TraceCheckUtils]: 0: Hoare triple {4569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4554#true} is VALID [2022-04-28 03:46:36,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#true} assume true; {4554#true} is VALID [2022-04-28 03:46:36,804 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4554#true} {4554#true} #61#return; {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {4554#true} call ULTIMATE.init(); {4569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:36,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {4569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {4554#true} assume true; {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4554#true} {4554#true} #61#return; {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {4554#true} call #t~ret11 := main(); {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {4554#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {4554#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_191 v_main_~y~0_190)) (.cse2 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse3 (= |v_main_#t~post6_82| |v_main_#t~post6_81|)) (.cse4 (= |v_main_#t~post5_82| |v_main_#t~post5_81|)) (.cse1 (mod v_main_~x~0_162 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_161 (+ v_main_~x~0_162 v_main_~y~0_191 (* (- 1) v_main_~y~0_190))) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~y~0_191 v_it_15 1) v_main_~y~0_190)) (< 0 (mod (+ v_main_~x~0_162 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15)))) (< v_main_~y~0_191 v_main_~y~0_190) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_191, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_162, main_#t~post6=|v_main_#t~post6_82|} OutVars{main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_161, main_#t~post6=|v_main_#t~post6_81|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4554#true} is VALID [2022-04-28 03:46:36,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {4554#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[] {4554#true} is VALID [2022-04-28 03:46:36,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {4554#true} ~z~0 := ~y~0; {4559#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:46:36,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {4559#(= (+ 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; {4560#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:36,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {4560#(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; {4561#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:36,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {4561#(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; {4562#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:36,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {4562#(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; {4563#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:36,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {4563#(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; {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:36,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:36,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {4564#(<= 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; {4565#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:46:36,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {4565#(<= 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; {4566#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:46:36,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {4566#(<= 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; {4567#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:46:36,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {4567#(<= 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; {4568#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:36,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {4568#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4555#false} is VALID [2022-04-28 03:46:36,815 INFO L272 TraceCheckUtils]: 20: Hoare triple {4555#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4555#false} is VALID [2022-04-28 03:46:36,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#false} ~cond := #in~cond; {4555#false} is VALID [2022-04-28 03:46:36,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#false} assume 0 == ~cond; {4555#false} is VALID [2022-04-28 03:46:36,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#false} assume !false; {4555#false} is VALID [2022-04-28 03:46:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:36,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104869323] [2022-04-28 03:46:36,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104869323] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584961545] [2022-04-28 03:46:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:36,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:36,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:36,816 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:46:36,817 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:46:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:36,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:46:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:36,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:46:37,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {4554#true} call ULTIMATE.init(); {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {4554#true} assume true; {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4554#true} {4554#true} #61#return; {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {4554#true} call #t~ret11 := main(); {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {4554#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {4554#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_191 v_main_~y~0_190)) (.cse2 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse3 (= |v_main_#t~post6_82| |v_main_#t~post6_81|)) (.cse4 (= |v_main_#t~post5_82| |v_main_#t~post5_81|)) (.cse1 (mod v_main_~x~0_162 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_161 (+ v_main_~x~0_162 v_main_~y~0_191 (* (- 1) v_main_~y~0_190))) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~y~0_191 v_it_15 1) v_main_~y~0_190)) (< 0 (mod (+ v_main_~x~0_162 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15)))) (< v_main_~y~0_191 v_main_~y~0_190) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_191, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_162, main_#t~post6=|v_main_#t~post6_82|} OutVars{main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_161, main_#t~post6=|v_main_#t~post6_81|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {4554#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[] {4554#true} is VALID [2022-04-28 03:46:37,174 INFO L290 TraceCheckUtils]: 8: Hoare triple {4554#true} ~z~0 := ~y~0; {4559#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:46:37,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {4559#(= (+ 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; {4560#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:46:37,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {4560#(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; {4561#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:46:37,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {4561#(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; {4562#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:46:37,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {4562#(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; {4563#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:46:37,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {4563#(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; {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:37,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:37,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {4564#(<= 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; {4565#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:46:37,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {4565#(<= 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; {4566#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:46:37,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {4566#(<= 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; {4567#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:46:37,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {4567#(<= 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; {4568#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:37,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {4568#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4555#false} is VALID [2022-04-28 03:46:37,183 INFO L272 TraceCheckUtils]: 20: Hoare triple {4555#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4555#false} is VALID [2022-04-28 03:46:37,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#false} ~cond := #in~cond; {4555#false} is VALID [2022-04-28 03:46:37,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#false} assume 0 == ~cond; {4555#false} is VALID [2022-04-28 03:46:37,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#false} assume !false; {4555#false} is VALID [2022-04-28 03:46:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:37,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:37,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#false} assume !false; {4555#false} is VALID [2022-04-28 03:46:37,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#false} assume 0 == ~cond; {4555#false} is VALID [2022-04-28 03:46:37,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#false} ~cond := #in~cond; {4555#false} is VALID [2022-04-28 03:46:37,598 INFO L272 TraceCheckUtils]: 20: Hoare triple {4555#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4555#false} is VALID [2022-04-28 03:46:37,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {4568#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4555#false} is VALID [2022-04-28 03:46:37,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {4567#(<= 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; {4568#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:46:37,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {4566#(<= 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; {4567#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:46:37,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {4565#(<= 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; {4566#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:46:37,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {4564#(<= 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; {4565#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:46:37,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:37,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {4672#(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; {4564#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:46:37,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {4676#(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; {4672#(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:37,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {4680#(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; {4676#(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:37,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {4684#(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; {4680#(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:37,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {4688#(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; {4684#(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:37,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {4554#true} ~z~0 := ~y~0; {4688#(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:37,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {4554#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[] {4554#true} is VALID [2022-04-28 03:46:37,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {4554#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_191 v_main_~y~0_190)) (.cse2 (= v_main_~x~0_162 v_main_~x~0_161)) (.cse3 (= |v_main_#t~post6_82| |v_main_#t~post6_81|)) (.cse4 (= |v_main_#t~post5_82| |v_main_#t~post5_81|)) (.cse1 (mod v_main_~x~0_162 4294967296))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= v_main_~x~0_161 (+ v_main_~x~0_162 v_main_~y~0_191 (* (- 1) v_main_~y~0_190))) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~y~0_191 v_it_15 1) v_main_~y~0_190)) (< 0 (mod (+ v_main_~x~0_162 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15)))) (< v_main_~y~0_191 v_main_~y~0_190) (< 0 .cse1)))) InVars {main_~y~0=v_main_~y~0_191, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_162, main_#t~post6=|v_main_#t~post6_82|} OutVars{main_~y~0=v_main_~y~0_190, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_161, main_#t~post6=|v_main_#t~post6_81|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4554#true} is VALID [2022-04-28 03:46:37,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {4554#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4554#true} is VALID [2022-04-28 03:46:37,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {4554#true} call #t~ret11 := main(); {4554#true} is VALID [2022-04-28 03:46:37,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4554#true} {4554#true} #61#return; {4554#true} is VALID [2022-04-28 03:46:37,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {4554#true} assume true; {4554#true} is VALID [2022-04-28 03:46:37,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4554#true} is VALID [2022-04-28 03:46:37,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {4554#true} call ULTIMATE.init(); {4554#true} is VALID [2022-04-28 03:46:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:37,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584961545] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:37,610 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:37,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-28 03:46:37,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:46:37,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169892449] [2022-04-28 03:46:37,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169892449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:46:37,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:46:37,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:46:37,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206180668] [2022-04-28 03:46:37,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:46:37,862 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:46:37,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:46:37,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:37,909 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:46:37,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:46:37,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:37,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:46:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:46:37,910 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:40,410 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 03:46:40,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:46:40,410 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:46:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:46:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2022-04-28 03:46:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 36 transitions. [2022-04-28 03:46:40,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 36 transitions. [2022-04-28 03:46:40,854 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:46:40,854 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:46:40,854 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:46:40,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=214, Invalid=1118, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:46:40,855 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:46:40,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:46:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:46:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:46:40,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:46:40,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,965 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,965 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:40,965 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:46:40,965 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:46:40,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:40,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:40,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:46:40,966 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:46:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:46:40,966 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 03:46:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:46:40,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:46:40,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:46:40,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:46:40,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:46:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 03:46:40,967 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 27 [2022-04-28 03:46:40,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:46:40,967 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 03:46:40,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:46:40,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 03:46:49,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 27 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:46:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 03:46:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:46:49,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:46:49,406 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:46:49,423 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:46:49,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 03:46:49,624 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:46:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:46:49,624 INFO L85 PathProgramCache]: Analyzing trace with hash 620636190, now seen corresponding path program 14 times [2022-04-28 03:46:49,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:46:49,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1401375134] [2022-04-28 03:46:49,829 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:49,830 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:46:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash -409127522, now seen corresponding path program 1 times [2022-04-28 03:46:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:46:49,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835924299] [2022-04-28 03:46:49,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:46:49,840 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:46:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:49,869 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:46:50,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:46:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:50,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {4955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4938#true} is VALID [2022-04-28 03:46:50,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {4938#true} assume true; {4938#true} is VALID [2022-04-28 03:46:50,133 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4938#true} {4938#true} #61#return; {4938#true} is VALID [2022-04-28 03:46:50,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {4938#true} call ULTIMATE.init(); {4955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:46:50,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {4955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4938#true} is VALID [2022-04-28 03:46:50,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#true} assume true; {4938#true} is VALID [2022-04-28 03:46:50,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#true} {4938#true} #61#return; {4938#true} is VALID [2022-04-28 03:46:50,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#true} call #t~ret11 := main(); {4938#true} is VALID [2022-04-28 03:46:50,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {4938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4943#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:46:50,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {4943#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_87| |v_main_#t~post5_86|)) (.cse3 (= |v_main_#t~post6_87| |v_main_#t~post6_86|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_176 v_it_16 1) v_main_~x~0_177)) (not (<= 1 v_it_16)) (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_16)) 4294967296)))) (= v_main_~y~0_208 (+ v_main_~x~0_177 v_main_~y~0_209 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_87|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_86|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_86|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4944#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:46:50,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {4944#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [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[] {4945#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:46:50,137 INFO L290 TraceCheckUtils]: 8: Hoare triple {4945#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {4946#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:46:50,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {4946#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~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; {4947#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:46:50,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {4947#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {4948#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {4948#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {4949#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:46:50,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {4949#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) 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; {4950#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:46:50,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {4950#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 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; {4951#(<= main_~n~0 (+ 5 main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#(<= main_~n~0 (+ 5 main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 5)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4951#(<= main_~n~0 (+ 5 main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,145 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#(<= main_~n~0 (+ 5 main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~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; {4950#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:46:50,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {4950#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) 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; {4949#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:46:50,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {4949#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) 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; {4948#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:46:50,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {4948#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) 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; {4947#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:46:50,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {4947#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~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; {4952#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:50,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {4952#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {4952#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:46:50,153 INFO L272 TraceCheckUtils]: 21: Hoare triple {4952#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4953#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:46:50,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {4953#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4954#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:46:50,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {4954#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4939#false} is VALID [2022-04-28 03:46:50,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {4939#false} assume !false; {4939#false} is VALID [2022-04-28 03:46:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:46:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:46:50,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835924299] [2022-04-28 03:46:50,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835924299] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:46:50,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398318681] [2022-04-28 03:46:50,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:46:50,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:46:50,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:46:50,161 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:46:50,165 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:46:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:57,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 03:46:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:46:57,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:44,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {4938#true} call ULTIMATE.init(); {4938#true} is VALID [2022-04-28 03:47:44,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {4938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4938#true} is VALID [2022-04-28 03:47:44,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#true} assume true; {4938#true} is VALID [2022-04-28 03:47:44,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#true} {4938#true} #61#return; {4938#true} is VALID [2022-04-28 03:47:44,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#true} call #t~ret11 := main(); {4938#true} is VALID [2022-04-28 03:47:44,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {4938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4943#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:47:44,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {4943#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_87| |v_main_#t~post5_86|)) (.cse3 (= |v_main_#t~post6_87| |v_main_#t~post6_86|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_176 v_it_16 1) v_main_~x~0_177)) (not (<= 1 v_it_16)) (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_16)) 4294967296)))) (= v_main_~y~0_208 (+ v_main_~x~0_177 v_main_~y~0_209 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_87|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_86|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_86|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4977#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} is VALID [2022-04-28 03:47:44,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {4977#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} [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[] {4981#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:47:44,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {4981#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {4985#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:47:44,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {4985#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 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; {4989#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:47:44,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {4989#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= 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; {4993#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-28 03:47:44,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {4993#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= 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; {4997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:47:44,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {4997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5001#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 03:47:44,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {5001#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= (+ (- 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; {5005#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)))} is VALID [2022-04-28 03:47:44,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {5005#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {5005#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)))} is VALID [2022-04-28 03:47:44,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {5005#(and (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= (+ 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; {5012#(and (= (+ main_~y~0 (- 3)) main_~z~0) (< 0 (mod (+ main_~y~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= v_it_16 main_~y~0)))) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:47:44,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {5012#(and (= (+ main_~y~0 (- 3)) main_~z~0) (< 0 (mod (+ main_~y~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (forall ((v_it_16 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= v_it_16 main_~y~0)))) (< 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; {5016#(and (< 0 (+ main_~z~0 3)) (forall ((v_it_16 Int)) (or (not (<= v_it_16 (+ main_~z~0 2))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (div (+ main_~z~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 3) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-28 03:47:44,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {5016#(and (< 0 (+ main_~z~0 3)) (forall ((v_it_16 Int)) (or (not (<= v_it_16 (+ main_~z~0 2))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (div (+ main_~z~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)) (< 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; {5020#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= v_it_16 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (+ main_~z~0 2)) (= main_~z~0 (+ main_~y~0 1)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:47:44,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {5020#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (forall ((v_it_16 Int)) (or (not (<= v_it_16 (+ main_~z~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (+ main_~z~0 2)) (= main_~z~0 (+ main_~y~0 1)) (<= (div (+ main_~z~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 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; {5024#(and (<= (div (+ main_~y~0 4 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod (+ main_~y~0 4) 4294967296)) (< 0 (+ main_~y~0 4)) (= main_~z~0 (+ main_~y~0 3)) (forall ((v_it_16 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= v_it_16 (+ main_~y~0 3))))))} is VALID [2022-04-28 03:47:44,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {5024#(and (<= (div (+ main_~y~0 4 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod (+ main_~y~0 4) 4294967296)) (< 0 (+ main_~y~0 4)) (= main_~z~0 (+ main_~y~0 3)) (forall ((v_it_16 Int)) (or (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= v_it_16 (+ main_~y~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; {5028#(and (< 0 main_~z~0) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (< 0 (mod main_~z~0 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:47:44,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {5028#(and (< 0 main_~z~0) (= (+ main_~y~0 1) (+ main_~z~0 (- 4))) (< 0 (mod main_~z~0 4294967296)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5032#(and (< 0 main_~z~0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} is VALID [2022-04-28 03:47:44,432 INFO L272 TraceCheckUtils]: 21: Hoare triple {5032#(and (< 0 main_~z~0) (<= (mod (+ 4294967291 main_~z~0) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~z~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (div (+ main_~z~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:47:44,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {5036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:47:44,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4939#false} is VALID [2022-04-28 03:47:44,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {4939#false} assume !false; {4939#false} is VALID [2022-04-28 03:47:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:44,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:09,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {4939#false} assume !false; {4939#false} is VALID [2022-04-28 03:49:09,738 INFO L290 TraceCheckUtils]: 23: Hoare triple {5040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4939#false} is VALID [2022-04-28 03:49:09,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {5036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:49:09,740 INFO L272 TraceCheckUtils]: 21: Hoare triple {4952#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:49:09,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {5059#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4952#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:49:09,743 INFO L290 TraceCheckUtils]: 19: Hoare triple {5063#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 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; {5059#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:49:09,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {5067#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~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; {5063#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:49:09,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {5071#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 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; {5067#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:49:09,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {5075#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 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; {5071#(or (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:49:09,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {5079#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~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; {5075#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:49:09,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {5079#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {5079#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:49:09,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {5086#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5079#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:49:09,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {5090#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5086#(or (and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:49:09,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {5094#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5090#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:49:09,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {5098#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5094#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:49:09,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {5102#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5098#(or (and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:49:09,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {5106#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} ~z~0 := ~y~0; {5102#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:49:09,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {5110#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [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[] {5106#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-28 03:49:11,773 WARN L290 TraceCheckUtils]: 6: Hoare triple {5114#(forall ((aux_mod_v_main_~x~0_187_32 Int)) (or (< 0 aux_mod_v_main_~x~0_187_32) (and (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (<= (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_v_main_~x~0_187_32 Int) (aux_div_aux_mod_v_main_~y~0_224_47_104 Int) (aux_div_v_main_~y~0_224_47 Int)) (or (not (< (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0)) (< (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) (+ 4294967291 main_~y~0 main_~x~0)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32) 4294967296) (+ main_~y~0 main_~x~0)) (< (+ 4294967291 main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ v_it_16 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32) 1) main_~x~0) (<= 1 v_it_16))) (<= (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) main_~n~0 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))) (<= (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) 4294967296))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_187_32 Int) (aux_div_aux_mod_v_main_~y~0_224_47_104 Int) (aux_div_v_main_~y~0_224_47 Int)) (or (not (< (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0)) (< (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) (+ 4294967291 main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))) (< (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) main_~n~0 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (< (+ 4294967291 main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ v_it_16 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32) 1) main_~x~0) (<= 1 v_it_16))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) 4294967296))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))))) (< aux_mod_v_main_~x~0_187_32 0)))} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_209 v_main_~y~0_208)) (.cse1 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse2 (= |v_main_#t~post5_87| |v_main_#t~post5_86|)) (.cse3 (= |v_main_#t~post6_87| |v_main_#t~post6_86|)) (.cse4 (mod v_main_~x~0_177 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_176 v_it_16 1) v_main_~x~0_177)) (not (<= 1 v_it_16)) (< 0 (mod (+ v_main_~x~0_177 (* 4294967295 v_it_16)) 4294967296)))) (= v_main_~y~0_208 (+ v_main_~x~0_177 v_main_~y~0_209 (* v_main_~x~0_176 (- 1)))) (< v_main_~x~0_176 v_main_~x~0_177) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_209, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_87|} OutVars{main_~y~0=v_main_~y~0_208, main_#t~post5=|v_main_#t~post5_86|, main_~x~0=v_main_~x~0_176, main_#t~post6=|v_main_#t~post6_86|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5110#(or (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is UNKNOWN [2022-04-28 03:49:11,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {4938#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5114#(forall ((aux_mod_v_main_~x~0_187_32 Int)) (or (< 0 aux_mod_v_main_~x~0_187_32) (and (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (<= (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_v_main_~x~0_187_32 Int) (aux_div_aux_mod_v_main_~y~0_224_47_104 Int) (aux_div_v_main_~y~0_224_47 Int)) (or (not (< (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0)) (< (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) (+ 4294967291 main_~y~0 main_~x~0)) (<= (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32) 4294967296) (+ main_~y~0 main_~x~0)) (< (+ 4294967291 main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ v_it_16 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32) 1) main_~x~0) (<= 1 v_it_16))) (<= (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) main_~n~0 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))) (<= (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) (- 4294967296)) (div main_~n~0 4294967296)) (+ (div (+ main_~y~0 (- 4294967296)) 4294967296) 1))) (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) 4294967296))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_187_32 Int) (aux_div_aux_mod_v_main_~y~0_224_47_104 Int) (aux_div_v_main_~y~0_224_47 Int)) (or (not (< (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0)) (< (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) (+ 4294967291 main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))) (< (+ (* aux_div_aux_mod_v_main_~y~0_224_47_104 4294967296) main_~n~0 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (< (+ 4294967291 main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~y~0_224_47) aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ v_it_16 aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32) 1) main_~x~0) (<= 1 v_it_16))))) (not (< 0 (mod main_~x~0 4294967296)))) (or (forall ((aux_div_v_main_~x~0_187_32 Int)) (not (= (+ aux_mod_v_main_~x~0_187_32 (* 4294967296 aux_div_v_main_~x~0_187_32)) main_~x~0))) (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 2 (div (+ main_~y~0 (* (- 1) main_~n~0)) 4294967296))) (< (div (+ (- 4294967292) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ 4294967290 main_~y~0) 4294967296))))) (< aux_mod_v_main_~x~0_187_32 0)))} is VALID [2022-04-28 03:49:11,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {4938#true} call #t~ret11 := main(); {4938#true} is VALID [2022-04-28 03:49:11,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4938#true} {4938#true} #61#return; {4938#true} is VALID [2022-04-28 03:49:11,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {4938#true} assume true; {4938#true} is VALID [2022-04-28 03:49:11,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {4938#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4938#true} is VALID [2022-04-28 03:49:11,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {4938#true} call ULTIMATE.init(); {4938#true} is VALID [2022-04-28 03:49:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:11,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398318681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:11,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:11,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 19] total 45 [2022-04-28 03:49:57,566 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:57,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1401375134] [2022-04-28 03:49:57,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1401375134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:57,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:57,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:49:57,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839220646] [2022-04-28 03:49:57,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:57,567 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 16 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:49:57,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:57,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 16 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:49:57,608 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:49:57,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:49:57,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:57,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:49:57,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2091, Unknown=41, NotChecked=0, Total=2352 [2022-04-28 03:49:57,609 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 16 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)