/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:46:28,567 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:46:28,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:46:28,588 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:46:28,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:46:28,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:46:28,589 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:46:28,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:46:28,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:46:28,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:46:28,593 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:46:28,595 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:46:28,596 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:46:28,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:46:28,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:46:28,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:46:28,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:46:28,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:46:28,605 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:46:28,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:46:28,611 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:46:28,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:46:28,612 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:46:28,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:46:28,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:46:28,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:46:28,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:46:28,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:46:28,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:46:28,621 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:46:28,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:46:28,622 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:46:28,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:46:28,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:46:28,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:46:28,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:46:28,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:46:28,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:46:28,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:46:28,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:46:28,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:46:28,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:46:28,627 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:46:28,634 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:46:28,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:46:28,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:46:28,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:46:28,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:46:28,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:46:28,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:46:28,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:46:28,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:46:28,636 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:46:28,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:46:28,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:46:28,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:46:28,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:46:28,636 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:46:28,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:28,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:46:28,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:46:28,637 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:46:28,637 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:46:28,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:46:28,637 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:46:28,637 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:46:28,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:46:28,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:46:28,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:46:28,816 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:46:28,816 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:46:28,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-04-15 12:46:28,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c70c32d/7e79f689472642f6988e9f50edb8d564/FLAGaf99d7c46 [2022-04-15 12:46:29,199 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:46:29,199 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/Mono1_1-1.c [2022-04-15 12:46:29,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c70c32d/7e79f689472642f6988e9f50edb8d564/FLAGaf99d7c46 [2022-04-15 12:46:29,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96c70c32d/7e79f689472642f6988e9f50edb8d564 [2022-04-15 12:46:29,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:46:29,215 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:46:29,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:29,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:46:29,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:46:29,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d35724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29, skipping insertion in model container [2022-04-15 12:46:29,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:46:29,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:46:29,402 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/Mono1_1-1.c[313,326] [2022-04-15 12:46:29,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:29,434 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:46:29,448 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/Mono1_1-1.c[313,326] [2022-04-15 12:46:29,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:46:29,463 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:46:29,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29 WrapperNode [2022-04-15 12:46:29,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:46:29,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:46:29,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:46:29,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:46:29,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,482 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,485 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:46:29,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:46:29,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:46:29,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:46:29,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (1/1) ... [2022-04-15 12:46:29,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:46:29,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:29,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:46:29,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:46:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:46:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:46:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:46:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:46:29,556 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:46:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:46:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:46:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:46:29,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:46:29,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:46:29,600 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:46:29,601 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:46:29,685 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:46:29,689 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:46:29,690 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:46:29,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:29 BoogieIcfgContainer [2022-04-15 12:46:29,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:46:29,692 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:46:29,692 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:46:29,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:46:29,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:46:29" (1/3) ... [2022-04-15 12:46:29,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185da10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:29, skipping insertion in model container [2022-04-15 12:46:29,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:46:29" (2/3) ... [2022-04-15 12:46:29,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185da10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:46:29, skipping insertion in model container [2022-04-15 12:46:29,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:46:29" (3/3) ... [2022-04-15 12:46:29,696 INFO L111 eAbstractionObserver]: Analyzing ICFG Mono1_1-1.c [2022-04-15 12:46:29,700 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:46:29,700 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:46:29,738 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:46:29,743 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:46:29,743 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:46:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:46:29,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:29,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:29,785 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:29,786 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:29,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:29,805 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-15 12:46:29,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:29,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2014740747] [2022-04-15 12:46:29,819 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-15 12:46:29,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:29,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27849579] [2022-04-15 12:46:29,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:29,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:29,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:29,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:46:29,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:46:30,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:46:30,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:30,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-15 12:46:30,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-15 12:46:30,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-15 12:46:30,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-15 12:46:30,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-15 12:46:30,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-15 12:46:30,005 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-15 12:46:30,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 12:46:30,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 12:46:30,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 12:46:30,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:30,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27849579] [2022-04-15 12:46:30,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27849579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:30,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:30,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:30,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:30,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2014740747] [2022-04-15 12:46:30,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2014740747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:30,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:30,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:46:30,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89370747] [2022-04-15 12:46:30,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:30,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:30,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:30,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:46:30,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:30,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:46:30,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:30,063 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:30,146 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:46:30,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:46:30,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:30,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:46:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-15 12:46:30,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-15 12:46:30,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,219 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:46:30,219 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 12:46:30,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:46:30,224 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:30,227 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:30,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 12:46:30,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 12:46:30,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:30,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,255 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,255 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:30,260 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:46:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:46:30,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:30,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:30,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:46:30,261 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 12:46:30,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:30,264 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-15 12:46:30,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:46:30,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:30,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:30,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:30,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-15 12:46:30,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-15 12:46:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:30,270 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-15 12:46:30,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-15 12:46:30,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-15 12:46:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 12:46:30,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:30,288 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:30,288 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:46:30,290 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:30,295 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-15 12:46:30,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:30,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2058616725] [2022-04-15 12:46:30,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:46:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-15 12:46:30,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:30,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208707884] [2022-04-15 12:46:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:30,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:30,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:30,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:46:30,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:46:30,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:46:30,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:30,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-15 12:46:30,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-15 12:46:30,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-15 12:46:30,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-15 12:46:30,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-15 12:46:30,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 100000000); {143#false} is VALID [2022-04-15 12:46:30,407 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-15 12:46:30,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-15 12:46:30,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-15 12:46:30,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-15 12:46:30,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:30,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208707884] [2022-04-15 12:46:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208707884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:30,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:30,409 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:30,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2058616725] [2022-04-15 12:46:30,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2058616725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:30,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:30,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 12:46:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964128270] [2022-04-15 12:46:30,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:30,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:30,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:30,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 12:46:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 12:46:30,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 12:46:30,423 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:30,514 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-15 12:46:30,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 12:46:30,514 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 12:46:30,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:30,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:46:30,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-15 12:46:30,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-15 12:46:30,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,543 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:46:30,543 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:46:30,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:46:30,545 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:30,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:30,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:46:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:46:30,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:30,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,548 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,549 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:30,549 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:46:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:46:30,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:30,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:30,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:46:30,550 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 12:46:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:30,551 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:46:30,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:46:30,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:30,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:30,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:30,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:30,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:46:30,552 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-15 12:46:30,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:30,552 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:46:30,553 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:46:30,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:46:30,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 12:46:30,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:30,567 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:30,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:46:30,568 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:30,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:30,568 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-15 12:46:30,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:30,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [998193377] [2022-04-15 12:46:30,653 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:46:30,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1303175503, now seen corresponding path program 1 times [2022-04-15 12:46:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:30,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061815130] [2022-04-15 12:46:30,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:30,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:30,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-15 12:46:30,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:46:30,820 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:46:30,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:30,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-15 12:46:30,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-15 12:46:30,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-15 12:46:30,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-15 12:46:30,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-15 12:46:30,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} [46] L9-2-->L8-2_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post4_Out_2| 0) (< (mod (+ v_main_~x~0_Out_2 4294967295) 4294967296) 10000000)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post4=|v_main_#t~post4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {263#(or (<= (+ 4284967296 main_~x~0) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)) (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))))} is VALID [2022-04-15 12:46:30,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(or (<= (+ 4284967296 main_~x~0) (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296)) (and (<= main_~x~0 0) (not (<= (+ (div main_~x~0 4294967296) 1) 0))))} [45] L8-2_primed-->L8-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 100000000)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-15 12:46:30,824 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-15 12:46:30,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-15 12:46:30,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-15 12:46:30,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-15 12:46:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:30,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:30,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061815130] [2022-04-15 12:46:30,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061815130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:30,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:30,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:30,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:30,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [998193377] [2022-04-15 12:46:30,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [998193377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:30,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:30,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:30,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304255232] [2022-04-15 12:46:30,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:30,926 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:46:30,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:30,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:30,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:30,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:30,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:30,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:46:30,949 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,127 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 12:46:31,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:31,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 12:46:31,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:31,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:46:31,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-15 12:46:31,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-15 12:46:31,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:31,168 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:46:31,168 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:46:31,169 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-15 12:46:31,169 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:31,170 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 23 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:31,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:46:31,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:46:31,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:31,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,180 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,180 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,182 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:46:31,182 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:46:31,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:31,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:31,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:46:31,183 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:46:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,184 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 12:46:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:46:31,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:31,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:31,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:31,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:31,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 12:46:31,188 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 12:46:31,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:31,188 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 12:46:31,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 12:46:31,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:31,222 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 12:46:31,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:46:31,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:31,223 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:31,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:46:31,223 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:31,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 1 times [2022-04-15 12:46:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:31,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1526470428] [2022-04-15 12:46:31,495 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1244070159, now seen corresponding path program 1 times [2022-04-15 12:46:31,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:31,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814207333] [2022-04-15 12:46:31,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:31,514 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:31,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 2 times [2022-04-15 12:46:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:31,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751901788] [2022-04-15 12:46:31,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:31,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:31,602 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:31,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:31,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:31,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:31,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:31,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:46:31,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:31,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:31,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:31,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:31,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {391#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {386#false} is VALID [2022-04-15 12:46:31,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#false} assume !(~x~0 % 4294967296 < 100000000); {386#false} is VALID [2022-04-15 12:46:31,606 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:46:31,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:46:31,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:46:31,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:46:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:31,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:31,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751901788] [2022-04-15 12:46:31,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751901788] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:31,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350862308] [2022-04-15 12:46:31,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:31,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:31,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:31,609 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:31,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:46:31,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:31,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:31,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:46:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:31,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:31,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:46:31,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:31,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:31,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:31,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:46:31,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:31,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {390#(= main_~x~0 0)} is VALID [2022-04-15 12:46:31,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {417#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:46:31,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !!(~x~0 % 4294967296 < 100000000); {417#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-15 12:46:31,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#(= (+ (- 1) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {424#(= main_~x~0 3)} is VALID [2022-04-15 12:46:31,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {424#(= main_~x~0 3)} assume !(~x~0 % 4294967296 < 100000000); {386#false} is VALID [2022-04-15 12:46:31,717 INFO L272 TraceCheckUtils]: 11: Hoare triple {386#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {386#false} is VALID [2022-04-15 12:46:31,717 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#false} ~cond := #in~cond; {386#false} is VALID [2022-04-15 12:46:31,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:46:31,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:46:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:31,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:31,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-15 12:46:31,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {443#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-15 12:46:31,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {447#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {443#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:31,879 INFO L272 TraceCheckUtils]: 11: Hoare triple {451#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {447#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:31,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {451#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:31,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {455#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:46:31,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {459#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:31,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {466#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {459#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:31,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {466#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {466#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:31,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {466#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:31,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-15 12:46:31,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-15 12:46:31,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-15 12:46:31,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-15 12:46:31,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-15 12:46:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:31,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350862308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:31,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:31,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 13 [2022-04-15 12:46:31,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:31,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1526470428] [2022-04-15 12:46:31,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1526470428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:31,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:31,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:46:31,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155037404] [2022-04-15 12:46:31,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:31,888 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:46:31,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:31,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:31,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:46:31,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:31,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:46:31,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:46:31,907 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:31,998 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 12:46:31,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 12:46:31,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 12:46:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:46:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:32,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-04-15 12:46:32,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2022-04-15 12:46:32,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:32,024 INFO L225 Difference]: With dead ends: 26 [2022-04-15 12:46:32,024 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:46:32,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:46:32,025 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:32,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:46:32,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:46:32,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:32,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:32,042 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:32,043 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:32,044 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:46:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:46:32,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:32,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:32,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:46:32,044 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:46:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:32,045 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 12:46:32,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:46:32,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:32,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:32,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:32,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 12:46:32,046 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 12:46:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:32,046 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 12:46:32,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:32,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 12:46:32,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:32,077 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 12:46:32,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 12:46:32,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:32,078 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:32,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 12:46:32,293 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:32,294 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:32,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:32,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 3 times [2022-04-15 12:46:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:32,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389606840] [2022-04-15 12:46:32,524 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:32,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1184964815, now seen corresponding path program 1 times [2022-04-15 12:46:32,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:32,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037407781] [2022-04-15 12:46:32,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:32,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:32,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:32,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:32,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1870024951, now seen corresponding path program 4 times [2022-04-15 12:46:32,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:32,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590414088] [2022-04-15 12:46:32,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:32,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:32,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:32,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {622#true} is VALID [2022-04-15 12:46:32,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:46:32,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #40#return; {622#true} is VALID [2022-04-15 12:46:32,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:32,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {622#true} is VALID [2022-04-15 12:46:32,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:46:32,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #40#return; {622#true} is VALID [2022-04-15 12:46:32,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret5 := main(); {622#true} is VALID [2022-04-15 12:46:32,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} ~x~0 := 0; {627#(= main_~x~0 0)} is VALID [2022-04-15 12:46:32,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {627#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {627#(= main_~x~0 0)} is VALID [2022-04-15 12:46:32,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:32,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:32,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {629#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:32,656 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {629#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:32,657 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {623#false} is VALID [2022-04-15 12:46:32,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !(~x~0 % 4294967296 < 100000000); {623#false} is VALID [2022-04-15 12:46:32,657 INFO L272 TraceCheckUtils]: 13: Hoare triple {623#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {623#false} is VALID [2022-04-15 12:46:32,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 12:46:32,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 12:46:32,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 12:46:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:32,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590414088] [2022-04-15 12:46:32,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590414088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:32,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227975451] [2022-04-15 12:46:32,658 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:32,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:32,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:32,660 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:32,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:46:32,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:32,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:32,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:46:32,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:32,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:32,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-15 12:46:32,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {622#true} is VALID [2022-04-15 12:46:32,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:46:32,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #40#return; {622#true} is VALID [2022-04-15 12:46:32,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret5 := main(); {622#true} is VALID [2022-04-15 12:46:32,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} ~x~0 := 0; {627#(= main_~x~0 0)} is VALID [2022-04-15 12:46:32,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {627#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {627#(= main_~x~0 0)} is VALID [2022-04-15 12:46:32,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:32,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:32,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:32,923 INFO L290 TraceCheckUtils]: 10: Hoare triple {661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:32,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {661#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {623#false} is VALID [2022-04-15 12:46:32,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !(~x~0 % 4294967296 < 100000000); {623#false} is VALID [2022-04-15 12:46:32,933 INFO L272 TraceCheckUtils]: 13: Hoare triple {623#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {623#false} is VALID [2022-04-15 12:46:32,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 12:46:32,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 12:46:32,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 12:46:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:32,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:33,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 12:46:33,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 12:46:33,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 12:46:33,069 INFO L272 TraceCheckUtils]: 13: Hoare triple {623#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {623#false} is VALID [2022-04-15 12:46:33,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !(~x~0 % 4294967296 < 100000000); {623#false} is VALID [2022-04-15 12:46:33,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {698#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {623#false} is VALID [2022-04-15 12:46:33,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {702#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {698#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:46:33,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {706#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {702#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {706#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {706#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {706#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {713#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} ~x~0 := 0; {713#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:33,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret5 := main(); {622#true} is VALID [2022-04-15 12:46:33,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #40#return; {622#true} is VALID [2022-04-15 12:46:33,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 12:46:33,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {622#true} is VALID [2022-04-15 12:46:33,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-15 12:46:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:33,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227975451] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:33,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:33,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 11 [2022-04-15 12:46:33,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389606840] [2022-04-15 12:46:33,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389606840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:33,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:33,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:46:33,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224252085] [2022-04-15 12:46:33,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:33,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:33,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:33,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:33,090 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:46:33,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:33,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:46:33,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-15 12:46:33,091 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:33,199 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-15 12:46:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 12:46:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 12:46:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:46:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2022-04-15 12:46:33,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2022-04-15 12:46:33,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:33,227 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:46:33,228 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:46:33,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:46:33,229 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:33,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:46:33,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 12:46:33,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:33,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,249 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,249 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:33,250 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:46:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:46:33,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:33,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:33,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:46:33,251 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 12:46:33,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:33,252 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-15 12:46:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:46:33,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:33,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:33,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:33,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:46:33,253 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2022-04-15 12:46:33,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:33,254 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:46:33,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:33,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:46:33,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:33,293 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:46:33,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 12:46:33,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:33,294 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:33,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:33,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2022-04-15 12:46:33,495 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:33,495 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 5 times [2022-04-15 12:46:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:33,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366782879] [2022-04-15 12:46:33,690 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:33,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1125859471, now seen corresponding path program 1 times [2022-04-15 12:46:33,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:33,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404848122] [2022-04-15 12:46:33,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:33,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:33,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:33,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash -555382060, now seen corresponding path program 6 times [2022-04-15 12:46:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:33,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641978886] [2022-04-15 12:46:33,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:33,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:33,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {883#true} is VALID [2022-04-15 12:46:33,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} assume true; {883#true} is VALID [2022-04-15 12:46:33,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {883#true} {883#true} #40#return; {883#true} is VALID [2022-04-15 12:46:33,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {883#true} call ULTIMATE.init(); {892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:33,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {883#true} is VALID [2022-04-15 12:46:33,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume true; {883#true} is VALID [2022-04-15 12:46:33,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {883#true} {883#true} #40#return; {883#true} is VALID [2022-04-15 12:46:33,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {883#true} call #t~ret5 := main(); {883#true} is VALID [2022-04-15 12:46:33,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} ~x~0 := 0; {888#(= main_~x~0 0)} is VALID [2022-04-15 12:46:33,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {888#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {888#(= main_~x~0 0)} is VALID [2022-04-15 12:46:33,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {888#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {889#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:33,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {889#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {889#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:33,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {889#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {890#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:33,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {890#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {890#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:33,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {890#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {891#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 12:46:33,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {891#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !!(~x~0 % 4294967296 < 100000000); {891#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-15 12:46:33,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {891#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {884#false} is VALID [2022-04-15 12:46:33,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {884#false} assume !(~x~0 % 4294967296 < 100000000); {884#false} is VALID [2022-04-15 12:46:33,858 INFO L272 TraceCheckUtils]: 15: Hoare triple {884#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {884#false} is VALID [2022-04-15 12:46:33,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} ~cond := #in~cond; {884#false} is VALID [2022-04-15 12:46:33,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} assume 0 == ~cond; {884#false} is VALID [2022-04-15 12:46:33,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-04-15 12:46:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:33,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:33,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641978886] [2022-04-15 12:46:33,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641978886] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:33,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243157064] [2022-04-15 12:46:33,859 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:33,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:33,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:46:33,921 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:46:33,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:33,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:46:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:33,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:34,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {883#true} call ULTIMATE.init(); {883#true} is VALID [2022-04-15 12:46:34,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {883#true} is VALID [2022-04-15 12:46:34,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume true; {883#true} is VALID [2022-04-15 12:46:34,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {883#true} {883#true} #40#return; {883#true} is VALID [2022-04-15 12:46:34,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {883#true} call #t~ret5 := main(); {883#true} is VALID [2022-04-15 12:46:34,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} ~x~0 := 0; {883#true} is VALID [2022-04-15 12:46:34,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} assume !!(~x~0 % 4294967296 < 100000000); {883#true} is VALID [2022-04-15 12:46:34,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {883#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {883#true} is VALID [2022-04-15 12:46:34,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#true} assume !!(~x~0 % 4294967296 < 100000000); {883#true} is VALID [2022-04-15 12:46:34,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {923#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:34,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {923#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {923#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:34,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {923#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {930#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-15 12:46:34,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {930#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} is VALID [2022-04-15 12:46:34,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {930#(and (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000) (< (mod (+ main_~x~0 4294967295) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {937#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:34,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {937#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 100000000); {884#false} is VALID [2022-04-15 12:46:34,057 INFO L272 TraceCheckUtils]: 15: Hoare triple {884#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {884#false} is VALID [2022-04-15 12:46:34,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {884#false} ~cond := #in~cond; {884#false} is VALID [2022-04-15 12:46:34,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {884#false} assume 0 == ~cond; {884#false} is VALID [2022-04-15 12:46:34,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-04-15 12:46:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:46:34,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:34,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {884#false} assume !false; {884#false} is VALID [2022-04-15 12:46:34,220 INFO L290 TraceCheckUtils]: 17: Hoare triple {956#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {884#false} is VALID [2022-04-15 12:46:34,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {960#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {956#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:34,221 INFO L272 TraceCheckUtils]: 15: Hoare triple {964#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {960#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:34,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {968#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {964#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:34,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {972#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {968#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:46:34,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {972#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {972#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:34,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {883#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {972#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:34,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#true} assume !!(~x~0 % 4294967296 < 100000000); {883#true} is VALID [2022-04-15 12:46:34,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {883#true} is VALID [2022-04-15 12:46:34,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#true} assume !!(~x~0 % 4294967296 < 100000000); {883#true} is VALID [2022-04-15 12:46:34,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {883#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {883#true} is VALID [2022-04-15 12:46:34,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#true} assume !!(~x~0 % 4294967296 < 100000000); {883#true} is VALID [2022-04-15 12:46:34,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#true} ~x~0 := 0; {883#true} is VALID [2022-04-15 12:46:34,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {883#true} call #t~ret5 := main(); {883#true} is VALID [2022-04-15 12:46:34,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {883#true} {883#true} #40#return; {883#true} is VALID [2022-04-15 12:46:34,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#true} assume true; {883#true} is VALID [2022-04-15 12:46:34,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {883#true} is VALID [2022-04-15 12:46:34,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {883#true} call ULTIMATE.init(); {883#true} is VALID [2022-04-15 12:46:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 12:46:34,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243157064] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:34,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:34,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 15 [2022-04-15 12:46:34,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:34,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366782879] [2022-04-15 12:46:34,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366782879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:34,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:34,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:46:34,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785133484] [2022-04-15 12:46:34,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:34,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:46:34,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:34,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:34,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:46:34,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:34,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:46:34,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-04-15 12:46:34,248 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:34,410 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 12:46:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:46:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 12:46:34,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:46:34,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-15 12:46:34,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-15 12:46:34,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:34,437 INFO L225 Difference]: With dead ends: 30 [2022-04-15 12:46:34,437 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:46:34,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:46:34,438 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:34,438 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:46:34,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:46:34,463 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:34,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,463 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,463 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:34,464 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:46:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:46:34,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:34,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:34,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:46:34,465 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:46:34,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:34,465 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 12:46:34,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:46:34,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:34,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:34,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:34,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-04-15 12:46:34,467 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 19 [2022-04-15 12:46:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:34,467 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-04-15 12:46:34,467 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:34,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 25 transitions. [2022-04-15 12:46:34,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-15 12:46:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 12:46:34,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:34,530 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:34,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 12:46:34,730 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:34,731 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:34,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:34,731 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 7 times [2022-04-15 12:46:34,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:34,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [647203458] [2022-04-15 12:46:34,936 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1066754127, now seen corresponding path program 1 times [2022-04-15 12:46:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:34,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341751480] [2022-04-15 12:46:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:34,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:34,956 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:34,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:34,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:34,966 INFO L85 PathProgramCache]: Analyzing trace with hash 795722097, now seen corresponding path program 8 times [2022-04-15 12:46:34,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:34,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371232398] [2022-04-15 12:46:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:35,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 12:46:35,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 12:46:35,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1174#true} {1174#true} #40#return; {1174#true} is VALID [2022-04-15 12:46:35,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:35,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 12:46:35,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 12:46:35,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #40#return; {1174#true} is VALID [2022-04-15 12:46:35,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret5 := main(); {1174#true} is VALID [2022-04-15 12:46:35,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~x~0 := 0; {1179#(= main_~x~0 0)} is VALID [2022-04-15 12:46:35,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {1179#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1179#(= main_~x~0 0)} is VALID [2022-04-15 12:46:35,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:35,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:35,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:35,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:35,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:35,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:35,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:35,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:35,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {1183#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1175#false} is VALID [2022-04-15 12:46:35,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {1175#false} assume !(~x~0 % 4294967296 < 100000000); {1175#false} is VALID [2022-04-15 12:46:35,120 INFO L272 TraceCheckUtils]: 17: Hoare triple {1175#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1175#false} is VALID [2022-04-15 12:46:35,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {1175#false} ~cond := #in~cond; {1175#false} is VALID [2022-04-15 12:46:35,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 12:46:35,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 12:46:35,121 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:35,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:35,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371232398] [2022-04-15 12:46:35,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371232398] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:35,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674637434] [2022-04-15 12:46:35,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:35,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:35,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:35,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:35,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:46:35,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:35,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:35,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:46:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:35,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:35,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-15 12:46:35,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 12:46:35,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 12:46:35,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #40#return; {1174#true} is VALID [2022-04-15 12:46:35,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret5 := main(); {1174#true} is VALID [2022-04-15 12:46:35,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~x~0 := 0; {1179#(= main_~x~0 0)} is VALID [2022-04-15 12:46:35,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {1179#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1179#(= main_~x~0 0)} is VALID [2022-04-15 12:46:35,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:35,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:35,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {1180#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:35,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:35,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {1181#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:35,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:35,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {1182#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:35,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:35,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1234#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:35,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {1234#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 100000000); {1175#false} is VALID [2022-04-15 12:46:35,355 INFO L272 TraceCheckUtils]: 17: Hoare triple {1175#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1175#false} is VALID [2022-04-15 12:46:35,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {1175#false} ~cond := #in~cond; {1175#false} is VALID [2022-04-15 12:46:35,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {1175#false} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 12:46:35,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 12:46:35,355 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:35,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:35,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2022-04-15 12:46:35,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {1253#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1175#false} is VALID [2022-04-15 12:46:35,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {1257#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1253#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:35,634 INFO L272 TraceCheckUtils]: 17: Hoare triple {1261#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1257#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:35,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {1265#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {1261#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:35,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {1269#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1265#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {1269#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1269#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {1276#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1269#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {1276#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1276#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {1283#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1276#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {1283#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {1283#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} is VALID [2022-04-15 12:46:35,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1283#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} is VALID [2022-04-15 12:46:35,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {1290#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {1290#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {1297#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1290#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:46:35,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {1297#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {1297#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:46:35,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#true} ~x~0 := 0; {1297#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:46:35,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret5 := main(); {1174#true} is VALID [2022-04-15 12:46:35,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #40#return; {1174#true} is VALID [2022-04-15 12:46:35,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2022-04-15 12:46:35,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1174#true} is VALID [2022-04-15 12:46:35,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2022-04-15 12:46:35,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:35,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674637434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:35,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 19 [2022-04-15 12:46:35,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:35,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [647203458] [2022-04-15 12:46:35,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [647203458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:35,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:46:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120824497] [2022-04-15 12:46:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:35,649 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:46:35,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:35,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:35,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:35,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:46:35,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:35,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:46:35,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:46:35,666 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:35,845 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-15 12:46:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:46:35,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 12:46:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:46:35,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:35,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2022-04-15 12:46:35,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2022-04-15 12:46:35,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:35,872 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:46:35,872 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:46:35,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:46:35,873 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:35,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:46:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:46:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 12:46:35,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:35,904 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-15 12:46:35,904 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-15 12:46:35,904 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-15 12:46:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:35,905 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:46:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:46:35,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:35,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:35,905 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-15 12:46:35,906 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-15 12:46:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:35,906 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 12:46:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:46:35,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:35,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:35,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:35,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:35,907 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-15 12:46:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 12:46:35,908 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2022-04-15 12:46:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:35,908 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 12:46:35,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:35,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 12:46:35,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 12:46:35,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 12:46:35,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:35,954 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:35,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:36,155 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:36,155 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:36,156 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 9 times [2022-04-15 12:46:36,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:36,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [875674123] [2022-04-15 12:46:36,383 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:36,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1007648783, now seen corresponding path program 1 times [2022-04-15 12:46:36,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:36,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203262295] [2022-04-15 12:46:36,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:36,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:36,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:36,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:36,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2126693582, now seen corresponding path program 10 times [2022-04-15 12:46:36,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:36,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608178338] [2022-04-15 12:46:36,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:36,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:36,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:36,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {1506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 12:46:36,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 12:46:36,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1495#true} {1495#true} #40#return; {1495#true} is VALID [2022-04-15 12:46:36,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:36,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 12:46:36,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 12:46:36,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #40#return; {1495#true} is VALID [2022-04-15 12:46:36,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret5 := main(); {1495#true} is VALID [2022-04-15 12:46:36,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#true} ~x~0 := 0; {1500#(= main_~x~0 0)} is VALID [2022-04-15 12:46:36,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {1500#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1500#(= main_~x~0 0)} is VALID [2022-04-15 12:46:36,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {1500#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:36,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:36,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:36,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:36,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:36,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:36,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:36,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:36,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1505#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:36,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {1505#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1505#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:36,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {1505#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1496#false} is VALID [2022-04-15 12:46:36,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {1496#false} assume !(~x~0 % 4294967296 < 100000000); {1496#false} is VALID [2022-04-15 12:46:36,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {1496#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1496#false} is VALID [2022-04-15 12:46:36,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {1496#false} ~cond := #in~cond; {1496#false} is VALID [2022-04-15 12:46:36,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1496#false} assume 0 == ~cond; {1496#false} is VALID [2022-04-15 12:46:36,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2022-04-15 12:46:36,508 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:36,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608178338] [2022-04-15 12:46:36,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608178338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:36,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167397202] [2022-04-15 12:46:36,508 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:36,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:36,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:36,509 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:36,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:36,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:36,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:46:36,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:46:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:36,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:36,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1495#true} is VALID [2022-04-15 12:46:36,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 12:46:36,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 12:46:36,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #40#return; {1495#true} is VALID [2022-04-15 12:46:36,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret5 := main(); {1495#true} is VALID [2022-04-15 12:46:36,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#true} ~x~0 := 0; {1500#(= main_~x~0 0)} is VALID [2022-04-15 12:46:36,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {1500#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1500#(= main_~x~0 0)} is VALID [2022-04-15 12:46:36,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {1500#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:36,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:36,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {1501#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:36,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:36,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {1502#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:36,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:36,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {1503#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:36,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:36,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {1504#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:36,774 INFO L290 TraceCheckUtils]: 16: Hoare triple {1555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:36,775 INFO L290 TraceCheckUtils]: 17: Hoare triple {1555#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1496#false} is VALID [2022-04-15 12:46:36,775 INFO L290 TraceCheckUtils]: 18: Hoare triple {1496#false} assume !(~x~0 % 4294967296 < 100000000); {1496#false} is VALID [2022-04-15 12:46:36,775 INFO L272 TraceCheckUtils]: 19: Hoare triple {1496#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1496#false} is VALID [2022-04-15 12:46:36,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {1496#false} ~cond := #in~cond; {1496#false} is VALID [2022-04-15 12:46:36,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {1496#false} assume 0 == ~cond; {1496#false} is VALID [2022-04-15 12:46:36,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2022-04-15 12:46:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:36,776 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:37,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {1496#false} assume !false; {1496#false} is VALID [2022-04-15 12:46:37,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {1496#false} assume 0 == ~cond; {1496#false} is VALID [2022-04-15 12:46:37,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {1496#false} ~cond := #in~cond; {1496#false} is VALID [2022-04-15 12:46:37,043 INFO L272 TraceCheckUtils]: 19: Hoare triple {1496#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1496#false} is VALID [2022-04-15 12:46:37,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {1496#false} assume !(~x~0 % 4294967296 < 100000000); {1496#false} is VALID [2022-04-15 12:46:37,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {1592#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1496#false} is VALID [2022-04-15 12:46:37,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1592#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:46:37,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {1600#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1596#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {1600#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1600#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {1607#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1600#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {1607#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1607#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {1614#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1607#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {1614#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1614#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:46:37,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {1621#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1614#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:46:37,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {1621#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1621#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {1628#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1621#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:37,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {1628#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:37,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {1495#true} ~x~0 := 0; {1628#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:37,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {1495#true} call #t~ret5 := main(); {1495#true} is VALID [2022-04-15 12:46:37,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1495#true} {1495#true} #40#return; {1495#true} is VALID [2022-04-15 12:46:37,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {1495#true} assume true; {1495#true} is VALID [2022-04-15 12:46:37,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {1495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1495#true} is VALID [2022-04-15 12:46:37,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {1495#true} call ULTIMATE.init(); {1495#true} is VALID [2022-04-15 12:46:37,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:37,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167397202] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:37,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:37,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-04-15 12:46:37,069 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:37,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [875674123] [2022-04-15 12:46:37,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [875674123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:37,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:37,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 12:46:37,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427098626] [2022-04-15 12:46:37,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:46:37,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:37,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:37,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 12:46:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:37,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 12:46:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:46:37,087 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,347 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:46:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:46:37,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 12:46:37,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:37,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:46:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 35 transitions. [2022-04-15 12:46:37,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 35 transitions. [2022-04-15 12:46:37,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:37,377 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:46:37,377 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:46:37,377 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:46:37,378 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:37,378 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 39 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:37,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:46:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:46:37,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:37,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,413 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,413 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,414 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:46:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:46:37,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:37,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:37,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:46:37,415 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:46:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:37,416 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 12:46:37,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:46:37,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:37,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:37,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:37,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 12:46:37,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 23 [2022-04-15 12:46:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:37,417 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 12:46:37,418 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:37,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 12:46:37,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:37,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 12:46:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 12:46:37,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:37,471 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:37,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:37,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12 [2022-04-15 12:46:37,672 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:37,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 11 times [2022-04-15 12:46:37,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:37,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1066891779] [2022-04-15 12:46:37,849 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:37,852 INFO L85 PathProgramCache]: Analyzing trace with hash -948543439, now seen corresponding path program 1 times [2022-04-15 12:46:37,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695943770] [2022-04-15 12:46:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:37,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:37,861 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:37,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:37,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:37,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1290036459, now seen corresponding path program 12 times [2022-04-15 12:46:37,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:37,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066781463] [2022-04-15 12:46:37,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:37,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:37,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {1852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1840#true} is VALID [2022-04-15 12:46:37,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1840#true} assume true; {1840#true} is VALID [2022-04-15 12:46:37,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1840#true} {1840#true} #40#return; {1840#true} is VALID [2022-04-15 12:46:37,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {1840#true} call ULTIMATE.init(); {1852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:37,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {1852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1840#true} is VALID [2022-04-15 12:46:37,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {1840#true} assume true; {1840#true} is VALID [2022-04-15 12:46:37,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1840#true} {1840#true} #40#return; {1840#true} is VALID [2022-04-15 12:46:37,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {1840#true} call #t~ret5 := main(); {1840#true} is VALID [2022-04-15 12:46:37,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {1840#true} ~x~0 := 0; {1845#(= main_~x~0 0)} is VALID [2022-04-15 12:46:37,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {1845#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {1845#(= main_~x~0 0)} is VALID [2022-04-15 12:46:37,994 INFO L290 TraceCheckUtils]: 7: Hoare triple {1845#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:37,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {1846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:37,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:37,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {1847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {1847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:37,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1847#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:37,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {1848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:37,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:37,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {1849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:37,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {1849#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:37,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {1850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {1850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:37,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {1850#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1851#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:37,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {1851#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {1851#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:38,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {1851#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1841#false} is VALID [2022-04-15 12:46:38,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {1841#false} assume !(~x~0 % 4294967296 < 100000000); {1841#false} is VALID [2022-04-15 12:46:38,000 INFO L272 TraceCheckUtils]: 21: Hoare triple {1841#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1841#false} is VALID [2022-04-15 12:46:38,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {1841#false} ~cond := #in~cond; {1841#false} is VALID [2022-04-15 12:46:38,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {1841#false} assume 0 == ~cond; {1841#false} is VALID [2022-04-15 12:46:38,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#false} assume !false; {1841#false} is VALID [2022-04-15 12:46:38,000 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:38,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066781463] [2022-04-15 12:46:38,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066781463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:38,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677997194] [2022-04-15 12:46:38,001 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:38,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:38,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:38,002 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:38,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:46:38,083 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:38,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:38,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 12:46:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:38,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:38,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {1840#true} call ULTIMATE.init(); {1840#true} is VALID [2022-04-15 12:46:38,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {1840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1840#true} is VALID [2022-04-15 12:46:38,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {1840#true} assume true; {1840#true} is VALID [2022-04-15 12:46:38,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1840#true} {1840#true} #40#return; {1840#true} is VALID [2022-04-15 12:46:38,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {1840#true} call #t~ret5 := main(); {1840#true} is VALID [2022-04-15 12:46:38,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1840#true} ~x~0 := 0; {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 6: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:38,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:38,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1901#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:38,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {1901#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1901#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:38,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {1901#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1908#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} is VALID [2022-04-15 12:46:38,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {1908#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {1908#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} is VALID [2022-04-15 12:46:38,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {1908#(< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1915#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:46:38,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {1915#(and (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)) (< (mod (+ 4294967292 main_~x~0) 4294967296) 10000000))} assume !(~x~0 % 4294967296 < 100000000); {1841#false} is VALID [2022-04-15 12:46:38,239 INFO L272 TraceCheckUtils]: 21: Hoare triple {1841#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1841#false} is VALID [2022-04-15 12:46:38,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {1841#false} ~cond := #in~cond; {1841#false} is VALID [2022-04-15 12:46:38,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {1841#false} assume 0 == ~cond; {1841#false} is VALID [2022-04-15 12:46:38,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#false} assume !false; {1841#false} is VALID [2022-04-15 12:46:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:46:38,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:39,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {1841#false} assume !false; {1841#false} is VALID [2022-04-15 12:46:39,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1934#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1841#false} is VALID [2022-04-15 12:46:39,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {1938#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1934#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:39,237 INFO L272 TraceCheckUtils]: 21: Hoare triple {1942#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {1938#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:39,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {1946#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {1942#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:39,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {1950#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {1946#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:46:39,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {1954#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1950#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:39,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {1958#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1954#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {1958#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {1958#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1958#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:39,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {1840#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {1840#true} assume !!(~x~0 % 4294967296 < 100000000); {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {1840#true} ~x~0 := 0; {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {1840#true} call #t~ret5 := main(); {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1840#true} {1840#true} #40#return; {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {1840#true} assume true; {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {1840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {1840#true} call ULTIMATE.init(); {1840#true} is VALID [2022-04-15 12:46:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:46:39,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677997194] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:39,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:39,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 9] total 20 [2022-04-15 12:46:39,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:39,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1066891779] [2022-04-15 12:46:39,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1066891779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:39,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:39,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:46:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021292008] [2022-04-15 12:46:39,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:39,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:46:39,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:39,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:39,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:46:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:39,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:46:39,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:46:39,287 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:39,566 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 12:46:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 12:46:39,566 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 12:46:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:46:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 37 transitions. [2022-04-15 12:46:39,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 37 transitions. [2022-04-15 12:46:39,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:39,598 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:46:39,598 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 12:46:39,599 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=529, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:46:39,599 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:39,599 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:39,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 12:46:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 12:46:39,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:39,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,640 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,640 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:39,640 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:46:39,641 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:46:39,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:39,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:39,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:46:39,641 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 12:46:39,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:39,642 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-15 12:46:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:46:39,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:39,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:39,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:39,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 12:46:39,643 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2022-04-15 12:46:39,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:39,643 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 12:46:39,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:39,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 12:46:39,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 12:46:39,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 12:46:39,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:39,699 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:39,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 12:46:39,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 12:46:39,904 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:39,904 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 13 times [2022-04-15 12:46:39,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:39,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670236935] [2022-04-15 12:46:40,107 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -889438095, now seen corresponding path program 1 times [2022-04-15 12:46:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:40,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318993243] [2022-04-15 12:46:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:40,115 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:40,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:40,121 INFO L85 PathProgramCache]: Analyzing trace with hash 421425608, now seen corresponding path program 14 times [2022-04-15 12:46:40,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:40,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046133470] [2022-04-15 12:46:40,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:40,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:40,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {2227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2214#true} is VALID [2022-04-15 12:46:40,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 12:46:40,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2214#true} {2214#true} #40#return; {2214#true} is VALID [2022-04-15 12:46:40,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:40,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {2227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2214#true} is VALID [2022-04-15 12:46:40,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 12:46:40,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #40#return; {2214#true} is VALID [2022-04-15 12:46:40,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret5 := main(); {2214#true} is VALID [2022-04-15 12:46:40,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {2214#true} ~x~0 := 0; {2219#(= main_~x~0 0)} is VALID [2022-04-15 12:46:40,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {2219#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2219#(= main_~x~0 0)} is VALID [2022-04-15 12:46:40,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {2219#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:40,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:40,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:40,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:40,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:40,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:40,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:40,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:40,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:40,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:40,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:40,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:40,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2226#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:46:40,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {2226#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !!(~x~0 % 4294967296 < 100000000); {2226#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} is VALID [2022-04-15 12:46:40,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {2226#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 7))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2215#false} is VALID [2022-04-15 12:46:40,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {2215#false} assume !(~x~0 % 4294967296 < 100000000); {2215#false} is VALID [2022-04-15 12:46:40,249 INFO L272 TraceCheckUtils]: 23: Hoare triple {2215#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2215#false} is VALID [2022-04-15 12:46:40,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#false} ~cond := #in~cond; {2215#false} is VALID [2022-04-15 12:46:40,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#false} assume 0 == ~cond; {2215#false} is VALID [2022-04-15 12:46:40,249 INFO L290 TraceCheckUtils]: 26: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-15 12:46:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:40,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:40,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046133470] [2022-04-15 12:46:40,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046133470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:40,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116805407] [2022-04-15 12:46:40,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:40,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:40,263 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:40,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:46:40,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:40,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:40,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 12:46:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:40,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:40,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2022-04-15 12:46:40,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2214#true} is VALID [2022-04-15 12:46:40,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 12:46:40,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #40#return; {2214#true} is VALID [2022-04-15 12:46:40,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret5 := main(); {2214#true} is VALID [2022-04-15 12:46:40,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {2214#true} ~x~0 := 0; {2219#(= main_~x~0 0)} is VALID [2022-04-15 12:46:40,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {2219#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2219#(= main_~x~0 0)} is VALID [2022-04-15 12:46:40,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {2219#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:40,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:40,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {2220#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:40,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:40,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {2221#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:40,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:40,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {2222#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:40,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:40,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {2223#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:40,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:40,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {2224#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:40,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:40,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {2225#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:40,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {2288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:40,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {2288#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:40,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {2295#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2215#false} is VALID [2022-04-15 12:46:40,567 INFO L272 TraceCheckUtils]: 23: Hoare triple {2215#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2215#false} is VALID [2022-04-15 12:46:40,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#false} ~cond := #in~cond; {2215#false} is VALID [2022-04-15 12:46:40,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#false} assume 0 == ~cond; {2215#false} is VALID [2022-04-15 12:46:40,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-15 12:46:40,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:40,567 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:40,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {2215#false} assume !false; {2215#false} is VALID [2022-04-15 12:46:40,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {2215#false} assume 0 == ~cond; {2215#false} is VALID [2022-04-15 12:46:40,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {2215#false} ~cond := #in~cond; {2215#false} is VALID [2022-04-15 12:46:40,821 INFO L272 TraceCheckUtils]: 23: Hoare triple {2215#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2215#false} is VALID [2022-04-15 12:46:40,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {2323#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {2215#false} is VALID [2022-04-15 12:46:40,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {2327#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2323#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {2327#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2327#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2327#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2334#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {2341#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2334#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {2341#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2341#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {2348#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2341#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {2348#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2348#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {2355#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2348#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {2355#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2355#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {2362#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2355#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {2362#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2362#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {2369#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2362#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {2369#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2369#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {2376#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2369#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {2376#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2376#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {2214#true} ~x~0 := 0; {2376#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:40,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {2214#true} call #t~ret5 := main(); {2214#true} is VALID [2022-04-15 12:46:40,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2214#true} {2214#true} #40#return; {2214#true} is VALID [2022-04-15 12:46:40,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {2214#true} assume true; {2214#true} is VALID [2022-04-15 12:46:40,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2214#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2214#true} is VALID [2022-04-15 12:46:40,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {2214#true} call ULTIMATE.init(); {2214#true} is VALID [2022-04-15 12:46:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:40,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116805407] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:40,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:40,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-04-15 12:46:40,832 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:40,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670236935] [2022-04-15 12:46:40,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670236935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:40,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:40,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 12:46:40,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979122430] [2022-04-15 12:46:40,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:40,833 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:46:40,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:40,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:40,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:40,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 12:46:40,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 12:46:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-04-15 12:46:40,853 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:41,229 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-15 12:46:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:46:41,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 12:46:41,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:41,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:46:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 12:46:41,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-15 12:46:41,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:41,262 INFO L225 Difference]: With dead ends: 38 [2022-04-15 12:46:41,262 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:46:41,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=613, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:46:41,263 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:41,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 39 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:46:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:46:41,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:41,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,309 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,309 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:41,310 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:46:41,310 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:46:41,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:41,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:41,311 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:46:41,312 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:46:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:41,312 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-04-15 12:46:41,312 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:46:41,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:41,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:41,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:41,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-15 12:46:41,313 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2022-04-15 12:46:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:41,313 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-15 12:46:41,314 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:41,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2022-04-15 12:46:41,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-15 12:46:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:46:41,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:41,355 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:41,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:41,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:41,559 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:41,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:41,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 15 times [2022-04-15 12:46:41,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:41,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [37244431] [2022-04-15 12:46:41,738 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:41,740 INFO L85 PathProgramCache]: Analyzing trace with hash -830332751, now seen corresponding path program 1 times [2022-04-15 12:46:41,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:41,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879929039] [2022-04-15 12:46:41,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:41,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:41,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:41,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1089946779, now seen corresponding path program 16 times [2022-04-15 12:46:41,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:41,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812722920] [2022-04-15 12:46:41,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:41,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:41,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {2630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2616#true} is VALID [2022-04-15 12:46:41,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2616#true} assume true; {2616#true} is VALID [2022-04-15 12:46:41,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2616#true} {2616#true} #40#return; {2616#true} is VALID [2022-04-15 12:46:41,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {2616#true} call ULTIMATE.init(); {2630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:41,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {2630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2616#true} is VALID [2022-04-15 12:46:41,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {2616#true} assume true; {2616#true} is VALID [2022-04-15 12:46:41,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2616#true} {2616#true} #40#return; {2616#true} is VALID [2022-04-15 12:46:41,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {2616#true} call #t~ret5 := main(); {2616#true} is VALID [2022-04-15 12:46:41,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {2616#true} ~x~0 := 0; {2621#(= main_~x~0 0)} is VALID [2022-04-15 12:46:41,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {2621#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2621#(= main_~x~0 0)} is VALID [2022-04-15 12:46:41,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {2621#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:41,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:41,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:41,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:41,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:41,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:41,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:41,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:41,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:41,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:41,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:41,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:41,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:41,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:41,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2629#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:41,916 INFO L290 TraceCheckUtils]: 22: Hoare triple {2629#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {2629#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:41,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {2629#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2617#false} is VALID [2022-04-15 12:46:41,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {2617#false} assume !(~x~0 % 4294967296 < 100000000); {2617#false} is VALID [2022-04-15 12:46:41,916 INFO L272 TraceCheckUtils]: 25: Hoare triple {2617#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2617#false} is VALID [2022-04-15 12:46:41,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {2617#false} ~cond := #in~cond; {2617#false} is VALID [2022-04-15 12:46:41,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {2617#false} assume 0 == ~cond; {2617#false} is VALID [2022-04-15 12:46:41,917 INFO L290 TraceCheckUtils]: 28: Hoare triple {2617#false} assume !false; {2617#false} is VALID [2022-04-15 12:46:41,917 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:41,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:41,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812722920] [2022-04-15 12:46:41,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812722920] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:41,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361092187] [2022-04-15 12:46:41,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:41,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:41,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:41,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:41,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:46:41,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:41,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:41,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 12:46:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:41,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:42,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {2616#true} call ULTIMATE.init(); {2616#true} is VALID [2022-04-15 12:46:42,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {2616#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2616#true} is VALID [2022-04-15 12:46:42,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {2616#true} assume true; {2616#true} is VALID [2022-04-15 12:46:42,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2616#true} {2616#true} #40#return; {2616#true} is VALID [2022-04-15 12:46:42,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {2616#true} call #t~ret5 := main(); {2616#true} is VALID [2022-04-15 12:46:42,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {2616#true} ~x~0 := 0; {2621#(= main_~x~0 0)} is VALID [2022-04-15 12:46:42,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {2621#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {2621#(= main_~x~0 0)} is VALID [2022-04-15 12:46:42,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {2621#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:42,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:42,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {2622#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:42,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:42,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {2623#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:42,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:42,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {2624#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:42,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:42,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {2625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:42,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:42,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {2626#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:42,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:42,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {2627#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:42,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:42,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {2628#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2697#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:42,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {2697#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {2697#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:42,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {2697#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2704#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:42,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {2704#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {2617#false} is VALID [2022-04-15 12:46:42,225 INFO L272 TraceCheckUtils]: 25: Hoare triple {2617#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2617#false} is VALID [2022-04-15 12:46:42,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {2617#false} ~cond := #in~cond; {2617#false} is VALID [2022-04-15 12:46:42,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {2617#false} assume 0 == ~cond; {2617#false} is VALID [2022-04-15 12:46:42,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {2617#false} assume !false; {2617#false} is VALID [2022-04-15 12:46:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:42,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:42,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {2617#false} assume !false; {2617#false} is VALID [2022-04-15 12:46:42,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {2617#false} assume 0 == ~cond; {2617#false} is VALID [2022-04-15 12:46:42,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {2617#false} ~cond := #in~cond; {2617#false} is VALID [2022-04-15 12:46:42,521 INFO L272 TraceCheckUtils]: 25: Hoare triple {2617#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {2617#false} is VALID [2022-04-15 12:46:42,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {2732#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {2617#false} is VALID [2022-04-15 12:46:42,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {2736#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {2732#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {2736#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2736#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {2743#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2736#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {2743#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2743#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {2750#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2743#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {2750#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2750#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {2757#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2750#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {2757#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2757#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {2764#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2757#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {2764#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2764#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {2771#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2764#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2771#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {2778#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2771#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {2778#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2778#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2778#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2785#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {2785#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {2792#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {2792#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {2616#true} ~x~0 := 0; {2792#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:42,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {2616#true} call #t~ret5 := main(); {2616#true} is VALID [2022-04-15 12:46:42,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2616#true} {2616#true} #40#return; {2616#true} is VALID [2022-04-15 12:46:42,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {2616#true} assume true; {2616#true} is VALID [2022-04-15 12:46:42,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {2616#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {2616#true} is VALID [2022-04-15 12:46:42,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {2616#true} call ULTIMATE.init(); {2616#true} is VALID [2022-04-15 12:46:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:42,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361092187] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:42,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:42,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2022-04-15 12:46:42,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:42,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [37244431] [2022-04-15 12:46:42,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [37244431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:42,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:42,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:46:42,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465413860] [2022-04-15 12:46:42,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:42,539 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:46:42,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:42,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:42,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:42,561 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:46:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:46:42,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:46:42,562 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:42,999 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-15 12:46:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 12:46:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 12:46:43,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:46:43,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2022-04-15 12:46:43,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2022-04-15 12:46:43,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:43,035 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:46:43,035 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 12:46:43,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=750, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:46:43,036 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:43,036 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 44 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:46:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 12:46:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 12:46:43,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:43,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,085 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,085 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:43,086 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:46:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:46:43,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:43,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:43,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:46:43,086 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 12:46:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:43,087 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 12:46:43,087 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:46:43,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:43,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:43,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:43,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 12:46:43,088 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 29 [2022-04-15 12:46:43,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:43,088 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 12:46:43,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:43,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 12:46:43,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 12:46:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 12:46:43,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:43,134 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:43,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:43,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:46:43,335 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 17 times [2022-04-15 12:46:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:43,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [384457130] [2022-04-15 12:46:43,518 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:43,520 INFO L85 PathProgramCache]: Analyzing trace with hash -771227407, now seen corresponding path program 1 times [2022-04-15 12:46:43,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:43,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433080009] [2022-04-15 12:46:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:43,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:43,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:43,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:43,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:43,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1819864638, now seen corresponding path program 18 times [2022-04-15 12:46:43,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:43,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641296782] [2022-04-15 12:46:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:43,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:43,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:43,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {3061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3046#true} is VALID [2022-04-15 12:46:43,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {3046#true} assume true; {3046#true} is VALID [2022-04-15 12:46:43,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3046#true} {3046#true} #40#return; {3046#true} is VALID [2022-04-15 12:46:43,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {3046#true} call ULTIMATE.init(); {3061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:43,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {3061#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3046#true} is VALID [2022-04-15 12:46:43,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {3046#true} assume true; {3046#true} is VALID [2022-04-15 12:46:43,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3046#true} {3046#true} #40#return; {3046#true} is VALID [2022-04-15 12:46:43,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {3046#true} call #t~ret5 := main(); {3046#true} is VALID [2022-04-15 12:46:43,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {3046#true} ~x~0 := 0; {3051#(= main_~x~0 0)} is VALID [2022-04-15 12:46:43,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {3051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3051#(= main_~x~0 0)} is VALID [2022-04-15 12:46:43,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {3051#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3052#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:43,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {3052#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3052#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:43,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {3052#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3053#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:43,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {3053#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3053#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:43,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {3053#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3054#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:43,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {3054#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3054#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:43,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {3054#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3055#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:43,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {3055#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3055#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:43,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {3055#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3056#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:43,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {3056#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3056#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:43,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {3056#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3057#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:43,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {3057#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3057#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:43,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {3057#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3058#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:43,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {3058#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3058#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:43,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {3058#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3059#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:43,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {3059#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3059#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:43,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {3059#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3060#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:43,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {3060#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {3060#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:43,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {3060#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3047#false} is VALID [2022-04-15 12:46:43,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {3047#false} assume !(~x~0 % 4294967296 < 100000000); {3047#false} is VALID [2022-04-15 12:46:43,731 INFO L272 TraceCheckUtils]: 27: Hoare triple {3047#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3047#false} is VALID [2022-04-15 12:46:43,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {3047#false} ~cond := #in~cond; {3047#false} is VALID [2022-04-15 12:46:43,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {3047#false} assume 0 == ~cond; {3047#false} is VALID [2022-04-15 12:46:43,731 INFO L290 TraceCheckUtils]: 30: Hoare triple {3047#false} assume !false; {3047#false} is VALID [2022-04-15 12:46:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:43,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641296782] [2022-04-15 12:46:43,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641296782] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:43,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103011488] [2022-04-15 12:46:43,731 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:43,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:43,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:43,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:43,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:46:43,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:43,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:43,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:46:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:43,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:43,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {3046#true} call ULTIMATE.init(); {3046#true} is VALID [2022-04-15 12:46:43,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {3046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3046#true} is VALID [2022-04-15 12:46:43,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {3046#true} assume true; {3046#true} is VALID [2022-04-15 12:46:43,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3046#true} {3046#true} #40#return; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {3046#true} call #t~ret5 := main(); {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3046#true} ~x~0 := 0; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:43,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:43,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3134#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:43,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {3134#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {3134#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:43,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {3134#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3141#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:46:43,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {3141#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {3047#false} is VALID [2022-04-15 12:46:43,924 INFO L272 TraceCheckUtils]: 27: Hoare triple {3047#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3047#false} is VALID [2022-04-15 12:46:43,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {3047#false} ~cond := #in~cond; {3047#false} is VALID [2022-04-15 12:46:43,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {3047#false} assume 0 == ~cond; {3047#false} is VALID [2022-04-15 12:46:43,925 INFO L290 TraceCheckUtils]: 30: Hoare triple {3047#false} assume !false; {3047#false} is VALID [2022-04-15 12:46:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 12:46:43,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:44,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {3047#false} assume !false; {3047#false} is VALID [2022-04-15 12:46:44,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {3160#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3047#false} is VALID [2022-04-15 12:46:44,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {3164#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3160#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:44,733 INFO L272 TraceCheckUtils]: 27: Hoare triple {3168#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3164#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:44,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {3172#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {3168#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:44,735 INFO L290 TraceCheckUtils]: 25: Hoare triple {3176#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3172#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:46:44,735 INFO L290 TraceCheckUtils]: 24: Hoare triple {3180#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {3176#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3180#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {3046#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {3046#true} assume !!(~x~0 % 4294967296 < 100000000); {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {3046#true} ~x~0 := 0; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {3046#true} call #t~ret5 := main(); {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3046#true} {3046#true} #40#return; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {3046#true} assume true; {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {3046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3046#true} is VALID [2022-04-15 12:46:44,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {3046#true} call ULTIMATE.init(); {3046#true} is VALID [2022-04-15 12:46:44,739 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-15 12:46:44,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103011488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:44,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:44,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 8] total 21 [2022-04-15 12:46:44,739 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:44,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [384457130] [2022-04-15 12:46:44,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [384457130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:44,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:44,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 12:46:44,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728924734] [2022-04-15 12:46:44,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:44,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:46:44,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:44,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:44,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:44,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 12:46:44,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:44,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 12:46:44,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2022-04-15 12:46:44,769 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:45,273 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-15 12:46:45,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:46:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 12:46:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:46:45,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 43 transitions. [2022-04-15 12:46:45,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 43 transitions. [2022-04-15 12:46:45,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:45,317 INFO L225 Difference]: With dead ends: 42 [2022-04-15 12:46:45,317 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:46:45,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=739, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:46:45,318 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:45,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 24 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:46:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:46:45,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:45,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,396 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,396 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:45,398 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:46:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:46:45,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:45,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:45,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:46:45,398 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:46:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:45,399 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-04-15 12:46:45,399 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:46:45,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:45,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:45,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:45,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 12:46:45,400 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 31 [2022-04-15 12:46:45,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:45,400 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 12:46:45,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:45,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 12:46:45,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:45,460 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 12:46:45,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 12:46:45,462 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:45,463 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:45,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:45,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:45,676 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:45,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 19 times [2022-04-15 12:46:45,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:45,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944268332] [2022-04-15 12:46:45,818 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash -712122063, now seen corresponding path program 1 times [2022-04-15 12:46:45,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:45,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201879350] [2022-04-15 12:46:45,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:45,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:45,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:45,862 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:45,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1103709407, now seen corresponding path program 20 times [2022-04-15 12:46:45,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:45,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664598333] [2022-04-15 12:46:45,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:45,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:46,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:46,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {3515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3499#true} is VALID [2022-04-15 12:46:46,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {3499#true} assume true; {3499#true} is VALID [2022-04-15 12:46:46,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3499#true} {3499#true} #40#return; {3499#true} is VALID [2022-04-15 12:46:46,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {3499#true} call ULTIMATE.init(); {3515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:46,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {3515#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3499#true} is VALID [2022-04-15 12:46:46,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {3499#true} assume true; {3499#true} is VALID [2022-04-15 12:46:46,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3499#true} {3499#true} #40#return; {3499#true} is VALID [2022-04-15 12:46:46,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {3499#true} call #t~ret5 := main(); {3499#true} is VALID [2022-04-15 12:46:46,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {3499#true} ~x~0 := 0; {3504#(= main_~x~0 0)} is VALID [2022-04-15 12:46:46,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {3504#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3504#(= main_~x~0 0)} is VALID [2022-04-15 12:46:46,074 INFO L290 TraceCheckUtils]: 7: Hoare triple {3504#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:46,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:46,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:46,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:46,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:46,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:46,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:46,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:46,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:46,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:46,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:46,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:46,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:46,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:46,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:46,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:46,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:46,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:46,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3514#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:46,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {3514#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {3514#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:46,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {3514#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3500#false} is VALID [2022-04-15 12:46:46,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {3500#false} assume !(~x~0 % 4294967296 < 100000000); {3500#false} is VALID [2022-04-15 12:46:46,085 INFO L272 TraceCheckUtils]: 29: Hoare triple {3500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3500#false} is VALID [2022-04-15 12:46:46,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {3500#false} ~cond := #in~cond; {3500#false} is VALID [2022-04-15 12:46:46,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {3500#false} assume 0 == ~cond; {3500#false} is VALID [2022-04-15 12:46:46,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {3500#false} assume !false; {3500#false} is VALID [2022-04-15 12:46:46,085 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:46,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664598333] [2022-04-15 12:46:46,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664598333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:46,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510028369] [2022-04-15 12:46:46,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:46,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:46,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:46,087 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:46,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:46:46,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:46,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:46,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 12:46:46,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:46,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:46,458 INFO L272 TraceCheckUtils]: 0: Hoare triple {3499#true} call ULTIMATE.init(); {3499#true} is VALID [2022-04-15 12:46:46,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {3499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3499#true} is VALID [2022-04-15 12:46:46,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {3499#true} assume true; {3499#true} is VALID [2022-04-15 12:46:46,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3499#true} {3499#true} #40#return; {3499#true} is VALID [2022-04-15 12:46:46,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {3499#true} call #t~ret5 := main(); {3499#true} is VALID [2022-04-15 12:46:46,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {3499#true} ~x~0 := 0; {3504#(= main_~x~0 0)} is VALID [2022-04-15 12:46:46,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {3504#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3504#(= main_~x~0 0)} is VALID [2022-04-15 12:46:46,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {3504#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:46,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:46,461 INFO L290 TraceCheckUtils]: 9: Hoare triple {3505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:46,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:46,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {3506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:46,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:46,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {3507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:46,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:46,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {3508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:46,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:46,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {3509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:46,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:46,466 INFO L290 TraceCheckUtils]: 19: Hoare triple {3510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:46,466 INFO L290 TraceCheckUtils]: 20: Hoare triple {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:46,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {3511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:46,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:46,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {3512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:46,468 INFO L290 TraceCheckUtils]: 24: Hoare triple {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:46,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {3513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3594#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:46,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {3594#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3594#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:46,470 INFO L290 TraceCheckUtils]: 27: Hoare triple {3594#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3601#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:46,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {3601#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {3500#false} is VALID [2022-04-15 12:46:46,471 INFO L272 TraceCheckUtils]: 29: Hoare triple {3500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3500#false} is VALID [2022-04-15 12:46:46,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {3500#false} ~cond := #in~cond; {3500#false} is VALID [2022-04-15 12:46:46,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {3500#false} assume 0 == ~cond; {3500#false} is VALID [2022-04-15 12:46:46,471 INFO L290 TraceCheckUtils]: 32: Hoare triple {3500#false} assume !false; {3500#false} is VALID [2022-04-15 12:46:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:46,471 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:46,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {3500#false} assume !false; {3500#false} is VALID [2022-04-15 12:46:46,867 INFO L290 TraceCheckUtils]: 31: Hoare triple {3500#false} assume 0 == ~cond; {3500#false} is VALID [2022-04-15 12:46:46,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {3500#false} ~cond := #in~cond; {3500#false} is VALID [2022-04-15 12:46:46,867 INFO L272 TraceCheckUtils]: 29: Hoare triple {3500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3500#false} is VALID [2022-04-15 12:46:46,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {3629#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {3500#false} is VALID [2022-04-15 12:46:46,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {3633#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3629#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {3633#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3633#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {3640#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3633#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {3640#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3640#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {3647#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3640#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {3647#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3647#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {3654#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3647#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {3654#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3654#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {3661#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3654#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,872 INFO L290 TraceCheckUtils]: 18: Hoare triple {3661#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3661#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {3668#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3661#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {3668#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3668#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {3675#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3668#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {3675#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3675#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {3682#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3675#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {3682#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3682#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {3689#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3682#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {3689#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3689#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {3696#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3689#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {3696#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3696#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3703#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3696#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {3703#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {3703#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {3499#true} ~x~0 := 0; {3703#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:46,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {3499#true} call #t~ret5 := main(); {3499#true} is VALID [2022-04-15 12:46:46,879 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3499#true} {3499#true} #40#return; {3499#true} is VALID [2022-04-15 12:46:46,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {3499#true} assume true; {3499#true} is VALID [2022-04-15 12:46:46,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {3499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3499#true} is VALID [2022-04-15 12:46:46,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {3499#true} call ULTIMATE.init(); {3499#true} is VALID [2022-04-15 12:46:46,879 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:46,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510028369] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:46,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:46,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2022-04-15 12:46:46,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:46,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944268332] [2022-04-15 12:46:46,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944268332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:46,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:46,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:46:46,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11082737] [2022-04-15 12:46:46,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:46:46,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:46,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:46,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:46,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:46:46,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:46,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:46:46,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=536, Unknown=0, NotChecked=0, Total=756 [2022-04-15 12:46:46,906 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:47,535 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 12:46:47,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 12:46:47,535 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 12:46:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:46:47,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 45 transitions. [2022-04-15 12:46:47,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 45 transitions. [2022-04-15 12:46:47,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:47,575 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:46:47,575 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 12:46:47,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=416, Invalid=1066, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:46:47,576 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:47,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 69 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:47,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 12:46:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 12:46:47,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:47,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,634 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,634 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:47,635 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:46:47,635 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:46:47,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:47,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:47,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:46:47,635 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 12:46:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:47,636 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-04-15 12:46:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:46:47,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:47,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:47,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:47,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:47,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 12:46:47,637 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 33 [2022-04-15 12:46:47,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:47,637 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 12:46:47,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:47,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 12:46:47,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 12:46:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 12:46:47,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:47,704 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:47,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-15 12:46:47,904 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2022-04-15 12:46:47,904 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:47,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:47,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 21 times [2022-04-15 12:46:47,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:47,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [883640940] [2022-04-15 12:46:48,093 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:48,095 INFO L85 PathProgramCache]: Analyzing trace with hash -653016719, now seen corresponding path program 1 times [2022-04-15 12:46:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:48,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912515081] [2022-04-15 12:46:48,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:48,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:48,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:48,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:48,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:48,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1749755068, now seen corresponding path program 22 times [2022-04-15 12:46:48,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:48,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076651884] [2022-04-15 12:46:48,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:48,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:48,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:48,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {4002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3985#true} is VALID [2022-04-15 12:46:48,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {3985#true} assume true; {3985#true} is VALID [2022-04-15 12:46:48,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3985#true} {3985#true} #40#return; {3985#true} is VALID [2022-04-15 12:46:48,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {3985#true} call ULTIMATE.init(); {4002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:48,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {4002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3985#true} is VALID [2022-04-15 12:46:48,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {3985#true} assume true; {3985#true} is VALID [2022-04-15 12:46:48,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3985#true} {3985#true} #40#return; {3985#true} is VALID [2022-04-15 12:46:48,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {3985#true} call #t~ret5 := main(); {3985#true} is VALID [2022-04-15 12:46:48,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {3985#true} ~x~0 := 0; {3990#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {3990#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3990#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:48,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:48,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4001#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:48,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {4001#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {4001#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:48,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {4001#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {3986#false} is VALID [2022-04-15 12:46:48,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {3986#false} assume !(~x~0 % 4294967296 < 100000000); {3986#false} is VALID [2022-04-15 12:46:48,357 INFO L272 TraceCheckUtils]: 31: Hoare triple {3986#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3986#false} is VALID [2022-04-15 12:46:48,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {3986#false} ~cond := #in~cond; {3986#false} is VALID [2022-04-15 12:46:48,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {3986#false} assume 0 == ~cond; {3986#false} is VALID [2022-04-15 12:46:48,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#false} assume !false; {3986#false} is VALID [2022-04-15 12:46:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:48,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:48,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076651884] [2022-04-15 12:46:48,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076651884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:48,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466954393] [2022-04-15 12:46:48,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:48,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:48,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:48,359 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:48,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:46:48,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:48,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:48,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 12:46:48,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:48,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:48,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {3985#true} call ULTIMATE.init(); {3985#true} is VALID [2022-04-15 12:46:48,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {3985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3985#true} is VALID [2022-04-15 12:46:48,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {3985#true} assume true; {3985#true} is VALID [2022-04-15 12:46:48,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3985#true} {3985#true} #40#return; {3985#true} is VALID [2022-04-15 12:46:48,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {3985#true} call #t~ret5 := main(); {3985#true} is VALID [2022-04-15 12:46:48,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {3985#true} ~x~0 := 0; {3990#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {3990#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {3990#(= main_~x~0 0)} is VALID [2022-04-15 12:46:48,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {3990#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:48,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {3991#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:48,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {3992#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:48,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {3993#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:48,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {3994#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:48,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {3995#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:48,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {3996#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:48,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {3997#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:48,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {3998#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:48,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {3999#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:48,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:48,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {4000#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4087#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:48,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {4087#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4087#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:48,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {4087#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4094#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:48,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {4094#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {3986#false} is VALID [2022-04-15 12:46:48,766 INFO L272 TraceCheckUtils]: 31: Hoare triple {3986#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3986#false} is VALID [2022-04-15 12:46:48,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {3986#false} ~cond := #in~cond; {3986#false} is VALID [2022-04-15 12:46:48,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {3986#false} assume 0 == ~cond; {3986#false} is VALID [2022-04-15 12:46:48,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#false} assume !false; {3986#false} is VALID [2022-04-15 12:46:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:48,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:49,135 INFO L290 TraceCheckUtils]: 34: Hoare triple {3986#false} assume !false; {3986#false} is VALID [2022-04-15 12:46:49,136 INFO L290 TraceCheckUtils]: 33: Hoare triple {3986#false} assume 0 == ~cond; {3986#false} is VALID [2022-04-15 12:46:49,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {3986#false} ~cond := #in~cond; {3986#false} is VALID [2022-04-15 12:46:49,136 INFO L272 TraceCheckUtils]: 31: Hoare triple {3986#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {3986#false} is VALID [2022-04-15 12:46:49,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {4122#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {3986#false} is VALID [2022-04-15 12:46:49,138 INFO L290 TraceCheckUtils]: 29: Hoare triple {4126#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4122#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {4126#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4126#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,139 INFO L290 TraceCheckUtils]: 27: Hoare triple {4133#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4126#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {4133#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4133#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {4140#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4133#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,140 INFO L290 TraceCheckUtils]: 24: Hoare triple {4140#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4140#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {4147#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4140#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {4147#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4147#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {4154#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4147#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {4154#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4154#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {4161#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4154#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {4161#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4161#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {4168#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4161#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {4168#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4168#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {4175#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4168#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {4175#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4175#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {4182#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4175#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {4182#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4182#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {4189#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4182#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {4189#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4189#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {4196#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4189#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {4196#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4196#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {4203#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4196#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {4203#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {4203#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {3985#true} ~x~0 := 0; {4203#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:49,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {3985#true} call #t~ret5 := main(); {3985#true} is VALID [2022-04-15 12:46:49,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3985#true} {3985#true} #40#return; {3985#true} is VALID [2022-04-15 12:46:49,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {3985#true} assume true; {3985#true} is VALID [2022-04-15 12:46:49,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {3985#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {3985#true} is VALID [2022-04-15 12:46:49,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {3985#true} call ULTIMATE.init(); {3985#true} is VALID [2022-04-15 12:46:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:49,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466954393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:49,154 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:49,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2022-04-15 12:46:49,154 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:49,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [883640940] [2022-04-15 12:46:49,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [883640940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:49,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:49,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 12:46:49,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734732736] [2022-04-15 12:46:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:49,156 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:46:49,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:49,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:49,176 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 12:46:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:49,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 12:46:49,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=619, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:46:49,177 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:49,726 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-04-15 12:46:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:46:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 12:46:49,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:49,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:46:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 47 transitions. [2022-04-15 12:46:49,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 47 transitions. [2022-04-15 12:46:49,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:49,757 INFO L225 Difference]: With dead ends: 46 [2022-04-15 12:46:49,757 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:46:49,758 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=477, Invalid=1245, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:46:49,758 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:49,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 24 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:46:49,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:46:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:46:49,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:49,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,799 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,799 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:49,800 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:46:49,800 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:46:49,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:49,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:49,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:46:49,800 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:46:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:49,801 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-15 12:46:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:46:49,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:49,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:49,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:49,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:49,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 12:46:49,802 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 35 [2022-04-15 12:46:49,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:49,802 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 12:46:49,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.066666666666667) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:49,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 12:46:49,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 12:46:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 12:46:49,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:49,850 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:49,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 12:46:50,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2022-04-15 12:46:50,051 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:50,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:50,051 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 23 times [2022-04-15 12:46:50,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:50,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1889099016] [2022-04-15 12:46:50,180 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -593911375, now seen corresponding path program 1 times [2022-04-15 12:46:50,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:50,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614073195] [2022-04-15 12:46:50,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:50,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:50,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:50,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:50,210 INFO L85 PathProgramCache]: Analyzing trace with hash -170622631, now seen corresponding path program 24 times [2022-04-15 12:46:50,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:50,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080748848] [2022-04-15 12:46:50,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:50,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:50,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:50,420 INFO L290 TraceCheckUtils]: 0: Hoare triple {4517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4499#true} is VALID [2022-04-15 12:46:50,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {4499#true} assume true; {4499#true} is VALID [2022-04-15 12:46:50,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4499#true} {4499#true} #40#return; {4499#true} is VALID [2022-04-15 12:46:50,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {4499#true} call ULTIMATE.init(); {4517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:50,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {4517#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4499#true} is VALID [2022-04-15 12:46:50,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {4499#true} assume true; {4499#true} is VALID [2022-04-15 12:46:50,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4499#true} {4499#true} #40#return; {4499#true} is VALID [2022-04-15 12:46:50,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {4499#true} call #t~ret5 := main(); {4499#true} is VALID [2022-04-15 12:46:50,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {4499#true} ~x~0 := 0; {4504#(= main_~x~0 0)} is VALID [2022-04-15 12:46:50,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {4504#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {4504#(= main_~x~0 0)} is VALID [2022-04-15 12:46:50,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {4504#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:50,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {4505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {4505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:50,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {4505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:50,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {4506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {4506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:50,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {4506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:50,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {4507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:50,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {4507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:50,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {4508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:50,426 INFO L290 TraceCheckUtils]: 15: Hoare triple {4508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:50,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {4509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {4509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:50,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {4509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:50,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {4510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {4510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:50,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {4510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:50,429 INFO L290 TraceCheckUtils]: 20: Hoare triple {4511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:50,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {4511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:50,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {4512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:50,430 INFO L290 TraceCheckUtils]: 23: Hoare triple {4512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:50,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {4513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:50,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {4513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:50,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:50,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:50,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {4515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {4515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:50,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {4515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4516#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:50,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {4516#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {4516#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:50,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {4516#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4500#false} is VALID [2022-04-15 12:46:50,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {4500#false} assume !(~x~0 % 4294967296 < 100000000); {4500#false} is VALID [2022-04-15 12:46:50,435 INFO L272 TraceCheckUtils]: 33: Hoare triple {4500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {4500#false} is VALID [2022-04-15 12:46:50,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {4500#false} ~cond := #in~cond; {4500#false} is VALID [2022-04-15 12:46:50,435 INFO L290 TraceCheckUtils]: 35: Hoare triple {4500#false} assume 0 == ~cond; {4500#false} is VALID [2022-04-15 12:46:50,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {4500#false} assume !false; {4500#false} is VALID [2022-04-15 12:46:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:50,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:50,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080748848] [2022-04-15 12:46:50,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080748848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:50,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674671834] [2022-04-15 12:46:50,436 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:50,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:50,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:50,437 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:50,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:46:50,484 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:50,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:50,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:46:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:50,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:50,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {4499#true} call ULTIMATE.init(); {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {4499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {4499#true} assume true; {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4499#true} {4499#true} #40#return; {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {4499#true} call #t~ret5 := main(); {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {4499#true} ~x~0 := 0; {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:50,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:50,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4608#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:50,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {4608#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {4608#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:50,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {4608#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4615#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:46:50,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {4615#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {4500#false} is VALID [2022-04-15 12:46:50,642 INFO L272 TraceCheckUtils]: 33: Hoare triple {4500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {4500#false} is VALID [2022-04-15 12:46:50,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {4500#false} ~cond := #in~cond; {4500#false} is VALID [2022-04-15 12:46:50,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {4500#false} assume 0 == ~cond; {4500#false} is VALID [2022-04-15 12:46:50,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {4500#false} assume !false; {4500#false} is VALID [2022-04-15 12:46:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-15 12:46:50,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:51,532 INFO L290 TraceCheckUtils]: 36: Hoare triple {4500#false} assume !false; {4500#false} is VALID [2022-04-15 12:46:51,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {4634#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4500#false} is VALID [2022-04-15 12:46:51,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {4638#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4634#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:46:51,533 INFO L272 TraceCheckUtils]: 33: Hoare triple {4642#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {4638#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:46:51,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {4646#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {4642#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:46:51,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {4650#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {4646#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:46:51,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {4654#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {4650#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4654#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {4499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {4499#true} assume !!(~x~0 % 4294967296 < 100000000); {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {4499#true} ~x~0 := 0; {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {4499#true} call #t~ret5 := main(); {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4499#true} {4499#true} #40#return; {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {4499#true} assume true; {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {4499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {4499#true} call ULTIMATE.init(); {4499#true} is VALID [2022-04-15 12:46:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-15 12:46:51,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674671834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:51,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:51,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 4, 8] total 24 [2022-04-15 12:46:51,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:51,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1889099016] [2022-04-15 12:46:51,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1889099016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:51,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:51,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:46:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095970027] [2022-04-15 12:46:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:51,541 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:46:51,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:51,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:51,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:51,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:46:51,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:51,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:46:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=436, Unknown=0, NotChecked=0, Total=552 [2022-04-15 12:46:51,574 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:52,479 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-04-15 12:46:52,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 12:46:52,479 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 12:46:52,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:52,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:46:52,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-15 12:46:52,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-15 12:46:52,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:52,525 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:46:52,525 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 12:46:52,526 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 12:46:52,526 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:52,526 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 79 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:46:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 12:46:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 12:46:52,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:52,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,602 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,602 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:52,603 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:46:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:46:52,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:52,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:52,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:46:52,604 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 12:46:52,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:52,604 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-04-15 12:46:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:46:52,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:52,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:52,605 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:52,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:52,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 36 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 12:46:52,605 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2022-04-15 12:46:52,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:52,606 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 12:46:52,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:52,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 12:46:52,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 12:46:52,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 12:46:52,684 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:52,684 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:52,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:52,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2022-04-15 12:46:52,884 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:52,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 25 times [2022-04-15 12:46:52,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:52,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1352363335] [2022-04-15 12:46:53,085 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:53,087 INFO L85 PathProgramCache]: Analyzing trace with hash -534806031, now seen corresponding path program 1 times [2022-04-15 12:46:53,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:53,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787379723] [2022-04-15 12:46:53,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:53,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:53,093 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:53,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:53,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:53,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1182345910, now seen corresponding path program 26 times [2022-04-15 12:46:53,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:53,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446245179] [2022-04-15 12:46:53,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:53,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:53,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,318 INFO L290 TraceCheckUtils]: 0: Hoare triple {5052#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5033#true} is VALID [2022-04-15 12:46:53,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {5033#true} assume true; {5033#true} is VALID [2022-04-15 12:46:53,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5033#true} {5033#true} #40#return; {5033#true} is VALID [2022-04-15 12:46:53,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {5033#true} call ULTIMATE.init(); {5052#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:53,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {5052#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5033#true} is VALID [2022-04-15 12:46:53,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {5033#true} assume true; {5033#true} is VALID [2022-04-15 12:46:53,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5033#true} {5033#true} #40#return; {5033#true} is VALID [2022-04-15 12:46:53,319 INFO L272 TraceCheckUtils]: 4: Hoare triple {5033#true} call #t~ret5 := main(); {5033#true} is VALID [2022-04-15 12:46:53,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {5033#true} ~x~0 := 0; {5038#(= main_~x~0 0)} is VALID [2022-04-15 12:46:53,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5038#(= main_~x~0 0)} is VALID [2022-04-15 12:46:53,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:53,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:53,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:53,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:53,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:53,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:53,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:53,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:53,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:53,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:53,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:53,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:53,327 INFO L290 TraceCheckUtils]: 19: Hoare triple {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:53,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:53,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:53,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:53,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:53,330 INFO L290 TraceCheckUtils]: 24: Hoare triple {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:53,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:53,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:53,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:53,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:53,333 INFO L290 TraceCheckUtils]: 29: Hoare triple {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:53,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:53,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5051#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:53,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {5051#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {5051#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:53,335 INFO L290 TraceCheckUtils]: 33: Hoare triple {5051#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5034#false} is VALID [2022-04-15 12:46:53,335 INFO L290 TraceCheckUtils]: 34: Hoare triple {5034#false} assume !(~x~0 % 4294967296 < 100000000); {5034#false} is VALID [2022-04-15 12:46:53,335 INFO L272 TraceCheckUtils]: 35: Hoare triple {5034#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {5034#false} is VALID [2022-04-15 12:46:53,335 INFO L290 TraceCheckUtils]: 36: Hoare triple {5034#false} ~cond := #in~cond; {5034#false} is VALID [2022-04-15 12:46:53,335 INFO L290 TraceCheckUtils]: 37: Hoare triple {5034#false} assume 0 == ~cond; {5034#false} is VALID [2022-04-15 12:46:53,335 INFO L290 TraceCheckUtils]: 38: Hoare triple {5034#false} assume !false; {5034#false} is VALID [2022-04-15 12:46:53,335 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:53,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446245179] [2022-04-15 12:46:53,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446245179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:53,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267015439] [2022-04-15 12:46:53,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:46:53,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:53,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:53,337 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:53,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:46:53,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:46:53,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:53,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 12:46:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:53,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:53,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {5033#true} call ULTIMATE.init(); {5033#true} is VALID [2022-04-15 12:46:53,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {5033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5033#true} is VALID [2022-04-15 12:46:53,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {5033#true} assume true; {5033#true} is VALID [2022-04-15 12:46:53,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5033#true} {5033#true} #40#return; {5033#true} is VALID [2022-04-15 12:46:53,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {5033#true} call #t~ret5 := main(); {5033#true} is VALID [2022-04-15 12:46:53,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {5033#true} ~x~0 := 0; {5038#(= main_~x~0 0)} is VALID [2022-04-15 12:46:53,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {5038#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5038#(= main_~x~0 0)} is VALID [2022-04-15 12:46:53,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {5038#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:53,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:53,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {5039#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:53,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:53,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {5040#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:53,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:53,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {5041#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:53,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:53,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {5042#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:53,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:53,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {5043#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:53,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:53,778 INFO L290 TraceCheckUtils]: 19: Hoare triple {5044#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:53,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:53,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {5045#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:53,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:53,780 INFO L290 TraceCheckUtils]: 23: Hoare triple {5046#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:53,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:53,781 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:53,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:53,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {5048#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:53,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:53,783 INFO L290 TraceCheckUtils]: 29: Hoare triple {5049#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:53,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:53,784 INFO L290 TraceCheckUtils]: 31: Hoare triple {5050#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5149#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:53,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {5149#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5149#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:53,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {5149#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5156#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:46:53,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {5156#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 100000000); {5034#false} is VALID [2022-04-15 12:46:53,786 INFO L272 TraceCheckUtils]: 35: Hoare triple {5034#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {5034#false} is VALID [2022-04-15 12:46:53,786 INFO L290 TraceCheckUtils]: 36: Hoare triple {5034#false} ~cond := #in~cond; {5034#false} is VALID [2022-04-15 12:46:53,786 INFO L290 TraceCheckUtils]: 37: Hoare triple {5034#false} assume 0 == ~cond; {5034#false} is VALID [2022-04-15 12:46:53,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {5034#false} assume !false; {5034#false} is VALID [2022-04-15 12:46:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:53,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:54,450 INFO L290 TraceCheckUtils]: 38: Hoare triple {5034#false} assume !false; {5034#false} is VALID [2022-04-15 12:46:54,450 INFO L290 TraceCheckUtils]: 37: Hoare triple {5034#false} assume 0 == ~cond; {5034#false} is VALID [2022-04-15 12:46:54,450 INFO L290 TraceCheckUtils]: 36: Hoare triple {5034#false} ~cond := #in~cond; {5034#false} is VALID [2022-04-15 12:46:54,450 INFO L272 TraceCheckUtils]: 35: Hoare triple {5034#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {5034#false} is VALID [2022-04-15 12:46:54,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {5184#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {5034#false} is VALID [2022-04-15 12:46:54,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {5188#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5184#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {5188#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5188#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {5195#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5188#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {5195#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5195#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {5202#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5195#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {5202#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5202#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {5209#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5202#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {5209#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5209#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {5216#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5209#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {5216#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5216#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {5223#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5216#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {5223#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5223#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,459 INFO L290 TraceCheckUtils]: 21: Hoare triple {5230#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5223#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {5230#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5230#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {5237#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5230#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {5237#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5237#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {5244#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5237#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {5244#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5244#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {5251#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5244#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {5251#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5251#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {5258#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5251#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {5258#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5258#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {5265#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5258#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {5265#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5265#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {5272#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5265#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {5272#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5272#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {5279#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5272#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {5279#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5279#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {5033#true} ~x~0 := 0; {5279#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:46:54,468 INFO L272 TraceCheckUtils]: 4: Hoare triple {5033#true} call #t~ret5 := main(); {5033#true} is VALID [2022-04-15 12:46:54,468 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5033#true} {5033#true} #40#return; {5033#true} is VALID [2022-04-15 12:46:54,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {5033#true} assume true; {5033#true} is VALID [2022-04-15 12:46:54,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {5033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5033#true} is VALID [2022-04-15 12:46:54,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {5033#true} call ULTIMATE.init(); {5033#true} is VALID [2022-04-15 12:46:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:54,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267015439] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:54,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:54,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-04-15 12:46:54,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:54,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1352363335] [2022-04-15 12:46:54,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1352363335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:54,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:54,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 12:46:54,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060264548] [2022-04-15 12:46:54,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:46:54,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:54,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:54,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:54,503 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 12:46:54,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 12:46:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=803, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 12:46:54,504 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,519 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-15 12:46:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:46:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 12:46:55,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:46:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-15 12:46:55,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-15 12:46:55,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,567 INFO L225 Difference]: With dead ends: 50 [2022-04-15 12:46:55,567 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:46:55,568 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=611, Invalid=1645, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:46:55,568 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:55,568 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:46:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:46:55,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:46:55,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:55,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,642 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,642 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,642 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:46:55,642 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:46:55,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:55,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:55,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:46:55,643 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:46:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:55,644 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2022-04-15 12:46:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:46:55,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:55,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:55,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:55,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:55,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 38 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-04-15 12:46:55,645 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 39 [2022-04-15 12:46:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:55,645 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-04-15 12:46:55,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 16 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:55,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 45 transitions. [2022-04-15 12:46:55,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-04-15 12:46:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 12:46:55,715 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:55,715 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:55,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:55,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27,SelfDestructingSolverStorable28 [2022-04-15 12:46:55,915 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:55,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 27 times [2022-04-15 12:46:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:55,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087555785] [2022-04-15 12:46:56,080 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash -475700687, now seen corresponding path program 1 times [2022-04-15 12:46:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:56,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003533949] [2022-04-15 12:46:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:56,089 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:56,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:56,093 INFO L85 PathProgramCache]: Analyzing trace with hash 10023123, now seen corresponding path program 28 times [2022-04-15 12:46:56,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:56,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84819755] [2022-04-15 12:46:56,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:56,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {5623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5603#true} is VALID [2022-04-15 12:46:56,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-15 12:46:56,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5603#true} {5603#true} #40#return; {5603#true} is VALID [2022-04-15 12:46:56,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:56,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {5623#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5603#true} is VALID [2022-04-15 12:46:56,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-15 12:46:56,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #40#return; {5603#true} is VALID [2022-04-15 12:46:56,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret5 := main(); {5603#true} is VALID [2022-04-15 12:46:56,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} ~x~0 := 0; {5608#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {5608#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5608#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {5608#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,341 INFO L290 TraceCheckUtils]: 18: Hoare triple {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:56,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:56,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:56,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:56,345 INFO L290 TraceCheckUtils]: 25: Hoare triple {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:56,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:56,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:56,347 INFO L290 TraceCheckUtils]: 28: Hoare triple {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:56,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:56,348 INFO L290 TraceCheckUtils]: 30: Hoare triple {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:56,348 INFO L290 TraceCheckUtils]: 31: Hoare triple {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:56,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:56,350 INFO L290 TraceCheckUtils]: 33: Hoare triple {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5622#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:56,350 INFO L290 TraceCheckUtils]: 34: Hoare triple {5622#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {5622#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:46:56,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {5622#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5604#false} is VALID [2022-04-15 12:46:56,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {5604#false} assume !(~x~0 % 4294967296 < 100000000); {5604#false} is VALID [2022-04-15 12:46:56,351 INFO L272 TraceCheckUtils]: 37: Hoare triple {5604#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {5604#false} is VALID [2022-04-15 12:46:56,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {5604#false} ~cond := #in~cond; {5604#false} is VALID [2022-04-15 12:46:56,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {5604#false} assume 0 == ~cond; {5604#false} is VALID [2022-04-15 12:46:56,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-15 12:46:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:56,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:56,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84819755] [2022-04-15 12:46:56,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84819755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:56,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48106472] [2022-04-15 12:46:56,352 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:46:56,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:56,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:56,353 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:56,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:46:56,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:46:56,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:56,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 12:46:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:56,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:56,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2022-04-15 12:46:56,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5603#true} is VALID [2022-04-15 12:46:56,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-15 12:46:56,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #40#return; {5603#true} is VALID [2022-04-15 12:46:56,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret5 := main(); {5603#true} is VALID [2022-04-15 12:46:56,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} ~x~0 := 0; {5608#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {5608#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {5608#(= main_~x~0 0)} is VALID [2022-04-15 12:46:56,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {5608#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:56,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {5609#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:56,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {5610#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:56,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {5611#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:56,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {5612#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:56,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {5613#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:56,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {5614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:56,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {5615#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:56,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:56,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {5616#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:56,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:56,764 INFO L290 TraceCheckUtils]: 25: Hoare triple {5617#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:56,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:56,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:56,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:56,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {5619#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:56,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:56,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {5620#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:56,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:56,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {5621#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:46:56,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {5726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {5726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:46:56,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {5726#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5733#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:46:56,770 INFO L290 TraceCheckUtils]: 36: Hoare triple {5733#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {5604#false} is VALID [2022-04-15 12:46:56,770 INFO L272 TraceCheckUtils]: 37: Hoare triple {5604#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {5604#false} is VALID [2022-04-15 12:46:56,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {5604#false} ~cond := #in~cond; {5604#false} is VALID [2022-04-15 12:46:56,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {5604#false} assume 0 == ~cond; {5604#false} is VALID [2022-04-15 12:46:56,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-15 12:46:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:56,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:46:57,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {5604#false} assume !false; {5604#false} is VALID [2022-04-15 12:46:57,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {5604#false} assume 0 == ~cond; {5604#false} is VALID [2022-04-15 12:46:57,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {5604#false} ~cond := #in~cond; {5604#false} is VALID [2022-04-15 12:46:57,495 INFO L272 TraceCheckUtils]: 37: Hoare triple {5604#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {5604#false} is VALID [2022-04-15 12:46:57,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {5761#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {5604#false} is VALID [2022-04-15 12:46:57,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {5765#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {5761#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {5765#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5765#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,499 INFO L290 TraceCheckUtils]: 33: Hoare triple {5772#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5765#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,500 INFO L290 TraceCheckUtils]: 32: Hoare triple {5772#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5772#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {5779#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5772#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {5779#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5779#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {5786#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5779#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {5786#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5786#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {5793#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5786#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,504 INFO L290 TraceCheckUtils]: 26: Hoare triple {5793#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5793#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {5800#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5793#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {5800#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5800#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {5807#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5800#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {5807#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5807#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {5814#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5807#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {5814#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5814#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {5821#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5814#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {5821#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5821#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {5828#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5821#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,510 INFO L290 TraceCheckUtils]: 16: Hoare triple {5828#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5828#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,510 INFO L290 TraceCheckUtils]: 15: Hoare triple {5835#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5828#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {5835#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5835#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {5842#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5835#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {5842#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5842#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {5849#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5842#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,513 INFO L290 TraceCheckUtils]: 10: Hoare triple {5849#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5849#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {5856#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5849#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {5856#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5856#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {5863#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {5856#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {5863#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {5863#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {5603#true} ~x~0 := 0; {5863#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:46:57,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {5603#true} call #t~ret5 := main(); {5603#true} is VALID [2022-04-15 12:46:57,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5603#true} {5603#true} #40#return; {5603#true} is VALID [2022-04-15 12:46:57,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {5603#true} assume true; {5603#true} is VALID [2022-04-15 12:46:57,516 INFO L290 TraceCheckUtils]: 1: Hoare triple {5603#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {5603#true} is VALID [2022-04-15 12:46:57,516 INFO L272 TraceCheckUtils]: 0: Hoare triple {5603#true} call ULTIMATE.init(); {5603#true} is VALID [2022-04-15 12:46:57,517 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48106472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:46:57,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:46:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2022-04-15 12:46:57,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:46:57,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087555785] [2022-04-15 12:46:57,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087555785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:46:57,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:46:57,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:46:57,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513065045] [2022-04-15 12:46:57,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:46:57,518 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:46:57,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:46:57,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:57,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:57,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:46:57,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:57,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:46:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=904, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:46:57,556 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:58,763 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 12:46:58,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 12:46:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 12:46:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:46:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:46:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-15 12:46:58,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2022-04-15 12:46:58,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:58,817 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:46:58,817 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 12:46:58,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=684, Invalid=1866, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:46:58,818 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:46:58,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 79 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:46:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 12:46:58,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 12:46:58,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:46:58,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,877 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,877 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:58,878 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:46:58,878 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:46:58,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:58,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:58,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:46:58,878 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 12:46:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:46:58,879 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2022-04-15 12:46:58,879 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:46:58,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:46:58,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:46:58,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:46:58,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:46:58,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.075) internal successors, (43), 40 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 12:46:58,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 41 [2022-04-15 12:46:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:46:58,880 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 12:46:58,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:46:58,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 12:46:58,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:46:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 12:46:58,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 12:46:58,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:46:58,981 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:46:58,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:46:59,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:59,203 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:46:59,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:46:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 29 times [2022-04-15 12:46:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:46:59,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [104845633] [2022-04-15 12:46:59,301 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:46:59,302 INFO L85 PathProgramCache]: Analyzing trace with hash -416595343, now seen corresponding path program 1 times [2022-04-15 12:46:59,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:59,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777583257] [2022-04-15 12:46:59,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:59,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:59,308 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:46:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:46:59,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:46:59,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1310743632, now seen corresponding path program 30 times [2022-04-15 12:46:59,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:46:59,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838794974] [2022-04-15 12:46:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:46:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:46:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:46:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {6222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6201#true} is VALID [2022-04-15 12:46:59,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {6201#true} assume true; {6201#true} is VALID [2022-04-15 12:46:59,599 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6201#true} {6201#true} #40#return; {6201#true} is VALID [2022-04-15 12:46:59,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {6201#true} call ULTIMATE.init(); {6222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:46:59,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {6222#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6201#true} is VALID [2022-04-15 12:46:59,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {6201#true} assume true; {6201#true} is VALID [2022-04-15 12:46:59,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6201#true} {6201#true} #40#return; {6201#true} is VALID [2022-04-15 12:46:59,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {6201#true} call #t~ret5 := main(); {6201#true} is VALID [2022-04-15 12:46:59,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {6201#true} ~x~0 := 0; {6206#(= main_~x~0 0)} is VALID [2022-04-15 12:46:59,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {6206#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {6206#(= main_~x~0 0)} is VALID [2022-04-15 12:46:59,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {6206#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6207#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:59,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {6207#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {6207#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:46:59,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {6207#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6208#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:59,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {6208#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {6208#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:46:59,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {6208#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6209#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:59,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {6209#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6209#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:46:59,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {6209#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6210#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:59,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {6210#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6210#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:46:59,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {6210#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6211#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:59,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {6211#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {6211#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:46:59,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {6211#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6212#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:59,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {6212#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {6212#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:46:59,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {6212#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6213#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:59,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {6213#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6213#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:46:59,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {6213#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6214#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:59,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {6214#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6214#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:46:59,612 INFO L290 TraceCheckUtils]: 23: Hoare triple {6214#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6215#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:59,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {6215#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6215#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:46:59,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {6215#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6216#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:59,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {6216#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6216#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:46:59,614 INFO L290 TraceCheckUtils]: 27: Hoare triple {6216#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6217#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:59,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {6217#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6217#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:46:59,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {6217#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6218#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:59,616 INFO L290 TraceCheckUtils]: 30: Hoare triple {6218#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6218#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:46:59,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {6218#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6219#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:59,617 INFO L290 TraceCheckUtils]: 32: Hoare triple {6219#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6219#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:46:59,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {6219#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6220#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:46:59,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {6220#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {6220#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:46:59,619 INFO L290 TraceCheckUtils]: 35: Hoare triple {6220#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6221#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:46:59,619 INFO L290 TraceCheckUtils]: 36: Hoare triple {6221#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {6221#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} is VALID [2022-04-15 12:46:59,620 INFO L290 TraceCheckUtils]: 37: Hoare triple {6221#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 15))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6202#false} is VALID [2022-04-15 12:46:59,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {6202#false} assume !(~x~0 % 4294967296 < 100000000); {6202#false} is VALID [2022-04-15 12:46:59,620 INFO L272 TraceCheckUtils]: 39: Hoare triple {6202#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {6202#false} is VALID [2022-04-15 12:46:59,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {6202#false} ~cond := #in~cond; {6202#false} is VALID [2022-04-15 12:46:59,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {6202#false} assume 0 == ~cond; {6202#false} is VALID [2022-04-15 12:46:59,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {6202#false} assume !false; {6202#false} is VALID [2022-04-15 12:46:59,620 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:46:59,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:46:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838794974] [2022-04-15 12:46:59,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838794974] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:46:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130811952] [2022-04-15 12:46:59,621 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:46:59,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:46:59,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:46:59,622 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:46:59,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:46:59,697 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:46:59,698 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:46:59,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:46:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:46:59,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:46:59,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {6201#true} call ULTIMATE.init(); {6201#true} is VALID [2022-04-15 12:46:59,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {6201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6201#true} is VALID [2022-04-15 12:46:59,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {6201#true} assume true; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6201#true} {6201#true} #40#return; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {6201#true} call #t~ret5 := main(); {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {6201#true} ~x~0 := 0; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 13: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:46:59,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:46:59,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6331#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:59,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {6331#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {6331#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:46:59,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {6331#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6338#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:46:59,873 INFO L290 TraceCheckUtils]: 38: Hoare triple {6338#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {6202#false} is VALID [2022-04-15 12:46:59,873 INFO L272 TraceCheckUtils]: 39: Hoare triple {6202#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {6202#false} is VALID [2022-04-15 12:46:59,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {6202#false} ~cond := #in~cond; {6202#false} is VALID [2022-04-15 12:46:59,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {6202#false} assume 0 == ~cond; {6202#false} is VALID [2022-04-15 12:46:59,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {6202#false} assume !false; {6202#false} is VALID [2022-04-15 12:46:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:46:59,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:00,752 INFO L290 TraceCheckUtils]: 42: Hoare triple {6202#false} assume !false; {6202#false} is VALID [2022-04-15 12:47:00,752 INFO L290 TraceCheckUtils]: 41: Hoare triple {6357#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6202#false} is VALID [2022-04-15 12:47:00,753 INFO L290 TraceCheckUtils]: 40: Hoare triple {6361#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6357#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:00,753 INFO L272 TraceCheckUtils]: 39: Hoare triple {6365#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {6361#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:00,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {6369#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {6365#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:00,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {6373#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6369#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:47:00,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {6377#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {6373#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 35: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6377#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {6201#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {6201#true} assume !!(~x~0 % 4294967296 < 100000000); {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {6201#true} ~x~0 := 0; {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {6201#true} call #t~ret5 := main(); {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6201#true} {6201#true} #40#return; {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {6201#true} assume true; {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {6201#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {6201#true} call ULTIMATE.init(); {6201#true} is VALID [2022-04-15 12:47:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 45 proven. 1 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-04-15 12:47:00,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130811952] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:00,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:00,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 4, 8] total 27 [2022-04-15 12:47:00,762 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:00,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [104845633] [2022-04-15 12:47:00,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [104845633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:00,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:00,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 12:47:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236979060] [2022-04-15 12:47:00,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:00,763 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:47:00,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:00,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:00,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:00,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 12:47:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:00,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 12:47:00,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:47:00,797 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,062 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 12:47:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:47:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 12:47:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:47:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 55 transitions. [2022-04-15 12:47:02,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 55 transitions. [2022-04-15 12:47:02,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:02,121 INFO L225 Difference]: With dead ends: 54 [2022-04-15 12:47:02,121 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:47:02,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1513, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:47:02,122 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:02,122 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 69 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:47:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:47:02,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:47:02,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:02,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,212 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,212 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,212 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:47:02,212 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:47:02,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:02,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:02,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:47:02,213 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:47:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:02,213 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-04-15 12:47:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:47:02,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:02,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:02,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:02,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 42 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 12:47:02,214 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 43 [2022-04-15 12:47:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:02,215 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 12:47:02,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:02,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 12:47:02,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 12:47:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 12:47:02,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:02,292 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:02,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:02,492 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:02,493 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 31 times [2022-04-15 12:47:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:02,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [24566949] [2022-04-15 12:47:02,643 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:02,645 INFO L85 PathProgramCache]: Analyzing trace with hash -357489999, now seen corresponding path program 1 times [2022-04-15 12:47:02,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:02,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385544392] [2022-04-15 12:47:02,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:02,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:02,652 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:02,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 742724429, now seen corresponding path program 32 times [2022-04-15 12:47:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149594264] [2022-04-15 12:47:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:02,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {6838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:02,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:02,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:02,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:02,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {6838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:02,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:02,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:02,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret5 := main(); {6816#true} is VALID [2022-04-15 12:47:02,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} ~x~0 := 0; {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:02,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:02,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:02,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:02,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:02,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:02,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:02,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:02,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:02,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:02,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:02,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:02,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:02,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:02,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:02,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:02,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:02,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:02,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:02,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:02,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:02,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:02,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:02,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:02,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:02,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:02,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:02,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:02,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:02,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:02,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:02,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:02,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:02,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:02,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {6837#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6817#false} is VALID [2022-04-15 12:47:02,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {6817#false} assume !(~x~0 % 4294967296 < 100000000); {6817#false} is VALID [2022-04-15 12:47:02,984 INFO L272 TraceCheckUtils]: 41: Hoare triple {6817#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {6817#false} is VALID [2022-04-15 12:47:02,984 INFO L290 TraceCheckUtils]: 42: Hoare triple {6817#false} ~cond := #in~cond; {6817#false} is VALID [2022-04-15 12:47:02,984 INFO L290 TraceCheckUtils]: 43: Hoare triple {6817#false} assume 0 == ~cond; {6817#false} is VALID [2022-04-15 12:47:02,984 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-15 12:47:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:02,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:02,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149594264] [2022-04-15 12:47:02,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149594264] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:02,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396527104] [2022-04-15 12:47:02,985 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:47:02,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:02,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:02,986 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:02,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:47:03,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:47:03,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:03,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:47:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:03,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:03,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6816#true} is VALID [2022-04-15 12:47:03,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:03,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:03,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:03,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret5 := main(); {6816#true} is VALID [2022-04-15 12:47:03,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} ~x~0 := 0; {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:03,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {6821#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {6821#(= main_~x~0 0)} is VALID [2022-04-15 12:47:03,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {6821#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:03,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:03,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {6822#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:03,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:03,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {6823#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:03,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:03,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {6824#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:03,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:03,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {6825#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:03,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:03,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {6826#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:03,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:03,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {6827#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:03,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:03,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {6828#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:03,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:03,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {6829#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:03,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:03,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {6830#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:03,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:03,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {6831#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:03,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:03,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {6832#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:03,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:03,389 INFO L290 TraceCheckUtils]: 31: Hoare triple {6833#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:03,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:03,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {6834#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:03,391 INFO L290 TraceCheckUtils]: 34: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:03,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {6835#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:03,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:03,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {6836#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:03,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:03,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {6953#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6960#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:03,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {6960#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {6817#false} is VALID [2022-04-15 12:47:03,395 INFO L272 TraceCheckUtils]: 41: Hoare triple {6817#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {6817#false} is VALID [2022-04-15 12:47:03,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {6817#false} ~cond := #in~cond; {6817#false} is VALID [2022-04-15 12:47:03,395 INFO L290 TraceCheckUtils]: 43: Hoare triple {6817#false} assume 0 == ~cond; {6817#false} is VALID [2022-04-15 12:47:03,395 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-15 12:47:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:03,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:04,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {6817#false} assume !false; {6817#false} is VALID [2022-04-15 12:47:04,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {6979#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6817#false} is VALID [2022-04-15 12:47:04,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {6983#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6979#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:04,504 INFO L272 TraceCheckUtils]: 41: Hoare triple {6987#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {6983#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:04,504 INFO L290 TraceCheckUtils]: 40: Hoare triple {6991#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {6987#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:04,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {6995#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {6991#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {6995#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {6995#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {7002#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {6995#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,508 INFO L290 TraceCheckUtils]: 36: Hoare triple {7002#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {7002#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,509 INFO L290 TraceCheckUtils]: 35: Hoare triple {7009#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7002#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,509 INFO L290 TraceCheckUtils]: 34: Hoare triple {7009#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {7009#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {7016#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7009#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {7016#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {7016#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {7023#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7016#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {7023#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {7023#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:47:04,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {7030#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7023#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:47:04,514 INFO L290 TraceCheckUtils]: 28: Hoare triple {7030#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {7030#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:47:04,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {7037#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7030#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:47:04,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {7037#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {7037#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:47:04,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {7044#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7037#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:47:04,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {7044#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {7044#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {7051#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7044#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {7051#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {7051#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {7058#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7051#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {7058#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {7058#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {7065#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7058#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} is VALID [2022-04-15 12:47:04,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {7065#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {7065#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {7072#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7065#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {7072#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {7072#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-15 12:47:04,524 INFO L290 TraceCheckUtils]: 15: Hoare triple {7079#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7072#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-15 12:47:04,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {7079#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {7079#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {7086#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7079#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {7086#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {7086#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-15 12:47:04,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {7093#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7086#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-15 12:47:04,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {7093#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {7093#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {7100#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7093#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {7100#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {7100#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-15 12:47:04,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {7107#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7100#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-15 12:47:04,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {7107#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {7107#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {6816#true} ~x~0 := 0; {7107#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} is VALID [2022-04-15 12:47:04,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {6816#true} call #t~ret5 := main(); {6816#true} is VALID [2022-04-15 12:47:04,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6816#true} {6816#true} #40#return; {6816#true} is VALID [2022-04-15 12:47:04,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {6816#true} assume true; {6816#true} is VALID [2022-04-15 12:47:04,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {6816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {6816#true} is VALID [2022-04-15 12:47:04,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {6816#true} call ULTIMATE.init(); {6816#true} is VALID [2022-04-15 12:47:04,532 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:04,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396527104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:04,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:04,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 23] total 43 [2022-04-15 12:47:04,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:04,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [24566949] [2022-04-15 12:47:04,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [24566949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:04,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:04,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:47:04,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991987790] [2022-04-15 12:47:04,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:04,534 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:47:04,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:04,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:04,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:04,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:47:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:47:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=1363, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:47:04,585 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:06,218 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 12:47:06,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 12:47:06,219 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 12:47:06,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:06,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:47:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 57 transitions. [2022-04-15 12:47:06,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 57 transitions. [2022-04-15 12:47:06,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:06,293 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:47:06,293 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 12:47:06,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=849, Invalid=2691, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:47:06,294 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:06,295 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 99 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:47:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 12:47:06,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 12:47:06,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:06,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,372 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,372 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:06,373 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:47:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:47:06,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:06,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:06,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:47:06,374 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 12:47:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:06,377 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2022-04-15 12:47:06,377 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:47:06,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:06,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:06,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:06,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2022-04-15 12:47:06,379 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 45 [2022-04-15 12:47:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:06,379 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2022-04-15 12:47:06,379 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) internal successors, (41), 19 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:06,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 51 transitions. [2022-04-15 12:47:06,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2022-04-15 12:47:06,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 12:47:06,459 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:06,460 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:06,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:06,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33,SelfDestructingSolverStorable34 [2022-04-15 12:47:06,676 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:06,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 33 times [2022-04-15 12:47:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:06,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2054358200] [2022-04-15 12:47:06,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash -298384655, now seen corresponding path program 1 times [2022-04-15 12:47:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:06,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857583716] [2022-04-15 12:47:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:06,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:06,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1559425110, now seen corresponding path program 34 times [2022-04-15 12:47:06,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:06,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933478864] [2022-04-15 12:47:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:07,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {7496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7473#true} is VALID [2022-04-15 12:47:07,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {7473#true} assume true; {7473#true} is VALID [2022-04-15 12:47:07,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7473#true} {7473#true} #40#return; {7473#true} is VALID [2022-04-15 12:47:07,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {7473#true} call ULTIMATE.init(); {7496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:07,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {7496#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7473#true} is VALID [2022-04-15 12:47:07,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {7473#true} assume true; {7473#true} is VALID [2022-04-15 12:47:07,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7473#true} {7473#true} #40#return; {7473#true} is VALID [2022-04-15 12:47:07,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {7473#true} call #t~ret5 := main(); {7473#true} is VALID [2022-04-15 12:47:07,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {7473#true} ~x~0 := 0; {7478#(= main_~x~0 0)} is VALID [2022-04-15 12:47:07,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {7478#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {7478#(= main_~x~0 0)} is VALID [2022-04-15 12:47:07,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {7478#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:07,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:07,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:07,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:07,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:07,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:07,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:07,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:07,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:07,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:07,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:07,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:07,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:07,187 INFO L290 TraceCheckUtils]: 20: Hoare triple {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:07,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:07,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:07,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:07,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:07,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:07,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:07,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:07,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:07,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:07,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:07,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:07,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:07,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:07,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:07,198 INFO L290 TraceCheckUtils]: 35: Hoare triple {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:07,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:07,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:07,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:07,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7495#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:07,201 INFO L290 TraceCheckUtils]: 40: Hoare triple {7495#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {7495#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:07,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {7495#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {7474#false} is VALID [2022-04-15 12:47:07,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {7474#false} assume !(~x~0 % 4294967296 < 100000000); {7474#false} is VALID [2022-04-15 12:47:07,202 INFO L272 TraceCheckUtils]: 43: Hoare triple {7474#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {7474#false} is VALID [2022-04-15 12:47:07,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {7474#false} ~cond := #in~cond; {7474#false} is VALID [2022-04-15 12:47:07,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {7474#false} assume 0 == ~cond; {7474#false} is VALID [2022-04-15 12:47:07,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {7474#false} assume !false; {7474#false} is VALID [2022-04-15 12:47:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933478864] [2022-04-15 12:47:07,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933478864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:07,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798416856] [2022-04-15 12:47:07,203 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:47:07,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:07,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:07,204 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:07,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:47:07,262 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:47:07,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:07,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:47:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:07,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:07,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {7473#true} call ULTIMATE.init(); {7473#true} is VALID [2022-04-15 12:47:07,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {7473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7473#true} is VALID [2022-04-15 12:47:07,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {7473#true} assume true; {7473#true} is VALID [2022-04-15 12:47:07,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7473#true} {7473#true} #40#return; {7473#true} is VALID [2022-04-15 12:47:07,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {7473#true} call #t~ret5 := main(); {7473#true} is VALID [2022-04-15 12:47:07,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {7473#true} ~x~0 := 0; {7478#(= main_~x~0 0)} is VALID [2022-04-15 12:47:07,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {7478#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {7478#(= main_~x~0 0)} is VALID [2022-04-15 12:47:07,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {7478#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:07,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:07,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {7479#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:07,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:07,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {7480#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:07,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:07,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {7481#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:07,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:07,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {7482#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:07,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:07,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {7483#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:07,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:07,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {7484#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:07,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:07,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {7485#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:07,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:07,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {7486#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:07,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:07,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {7487#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:07,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:07,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {7488#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:07,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:07,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {7489#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:07,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:07,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {7490#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:07,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:07,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {7491#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:07,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:07,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {7492#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:07,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:07,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {7493#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:07,731 INFO L290 TraceCheckUtils]: 38: Hoare triple {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:07,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {7494#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7617#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:07,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {7617#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {7617#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:07,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {7617#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {7474#false} is VALID [2022-04-15 12:47:07,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {7474#false} assume !(~x~0 % 4294967296 < 100000000); {7474#false} is VALID [2022-04-15 12:47:07,733 INFO L272 TraceCheckUtils]: 43: Hoare triple {7474#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {7474#false} is VALID [2022-04-15 12:47:07,733 INFO L290 TraceCheckUtils]: 44: Hoare triple {7474#false} ~cond := #in~cond; {7474#false} is VALID [2022-04-15 12:47:07,733 INFO L290 TraceCheckUtils]: 45: Hoare triple {7474#false} assume 0 == ~cond; {7474#false} is VALID [2022-04-15 12:47:07,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {7474#false} assume !false; {7474#false} is VALID [2022-04-15 12:47:07,734 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:07,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:09,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {7474#false} assume !false; {7474#false} is VALID [2022-04-15 12:47:09,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {7474#false} assume 0 == ~cond; {7474#false} is VALID [2022-04-15 12:47:09,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {7474#false} ~cond := #in~cond; {7474#false} is VALID [2022-04-15 12:47:09,088 INFO L272 TraceCheckUtils]: 43: Hoare triple {7474#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {7474#false} is VALID [2022-04-15 12:47:09,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {7474#false} assume !(~x~0 % 4294967296 < 100000000); {7474#false} is VALID [2022-04-15 12:47:09,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {7654#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {7474#false} is VALID [2022-04-15 12:47:09,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {7658#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7654#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:09,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {7662#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7658#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {7662#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7662#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {7669#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7662#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {7669#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7669#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {7676#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7669#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {7676#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7676#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {7683#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7676#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {7683#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7683#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {7690#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7683#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {7690#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7690#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {7697#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7690#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {7697#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7697#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {7704#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7697#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {7704#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7704#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {7711#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7704#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,104 INFO L290 TraceCheckUtils]: 24: Hoare triple {7711#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7711#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,105 INFO L290 TraceCheckUtils]: 23: Hoare triple {7718#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7711#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {7718#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7718#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {7725#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7718#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {7725#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7725#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {7732#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7725#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {7732#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7732#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {7739#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7732#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {7739#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {7739#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {7746#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7739#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:09,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {7746#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7746#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {7753#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7746#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {7753#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7753#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {7760#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7753#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {7760#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7760#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {7767#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7760#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {7767#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7767#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {7774#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {7767#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {7774#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {7774#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {7473#true} ~x~0 := 0; {7774#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:09,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {7473#true} call #t~ret5 := main(); {7473#true} is VALID [2022-04-15 12:47:09,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7473#true} {7473#true} #40#return; {7473#true} is VALID [2022-04-15 12:47:09,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {7473#true} assume true; {7473#true} is VALID [2022-04-15 12:47:09,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {7473#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {7473#true} is VALID [2022-04-15 12:47:09,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {7473#true} call ULTIMATE.init(); {7473#true} is VALID [2022-04-15 12:47:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798416856] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:09,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:09,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 41 [2022-04-15 12:47:09,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:09,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2054358200] [2022-04-15 12:47:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2054358200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:09,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:09,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 12:47:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604174347] [2022-04-15 12:47:09,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:47:09,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:09,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:09,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:09,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 12:47:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:09,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 12:47:09,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 12:47:09,174 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,778 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 12:47:10,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:47:10,779 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 12:47:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:47:10,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2022-04-15 12:47:10,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 59 transitions. [2022-04-15 12:47:10,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:10,862 INFO L225 Difference]: With dead ends: 58 [2022-04-15 12:47:10,862 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:47:10,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=907, Invalid=2515, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:47:10,865 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:10,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 59 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:47:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:47:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:47:10,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:10,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,953 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,953 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,954 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:47:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:47:10,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:10,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:10,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:47:10,954 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:47:10,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:10,955 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2022-04-15 12:47:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:47:10,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:10,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:10,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:10,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2022-04-15 12:47:10,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2022-04-15 12:47:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:10,956 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2022-04-15 12:47:10,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 20 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:10,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 53 transitions. [2022-04-15 12:47:11,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2022-04-15 12:47:11,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 12:47:11,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:11,090 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:11,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:11,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 12:47:11,291 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:11,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:11,291 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 35 times [2022-04-15 12:47:11,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:11,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557945275] [2022-04-15 12:47:11,483 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -239279311, now seen corresponding path program 1 times [2022-04-15 12:47:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565236200] [2022-04-15 12:47:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:11,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:11,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:11,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2016974649, now seen corresponding path program 36 times [2022-04-15 12:47:11,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:11,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103160078] [2022-04-15 12:47:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:11,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:11,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {8178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8154#true} is VALID [2022-04-15 12:47:11,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {8154#true} assume true; {8154#true} is VALID [2022-04-15 12:47:11,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8154#true} {8154#true} #40#return; {8154#true} is VALID [2022-04-15 12:47:11,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {8154#true} call ULTIMATE.init(); {8178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:11,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {8178#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8154#true} is VALID [2022-04-15 12:47:11,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {8154#true} assume true; {8154#true} is VALID [2022-04-15 12:47:11,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8154#true} {8154#true} #40#return; {8154#true} is VALID [2022-04-15 12:47:11,822 INFO L272 TraceCheckUtils]: 4: Hoare triple {8154#true} call #t~ret5 := main(); {8154#true} is VALID [2022-04-15 12:47:11,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {8154#true} ~x~0 := 0; {8159#(= main_~x~0 0)} is VALID [2022-04-15 12:47:11,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {8159#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {8159#(= main_~x~0 0)} is VALID [2022-04-15 12:47:11,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {8159#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8160#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:11,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {8160#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {8160#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:11,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {8160#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8161#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:11,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {8161#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {8161#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:11,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {8161#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8162#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:11,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {8162#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8162#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:11,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {8162#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8163#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:11,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {8163#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8163#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:11,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {8163#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8164#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:11,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {8164#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {8164#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:11,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {8164#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8165#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:11,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {8165#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {8165#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:11,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {8165#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8166#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:11,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {8166#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8166#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:11,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {8166#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8167#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:11,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {8167#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8167#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:11,837 INFO L290 TraceCheckUtils]: 23: Hoare triple {8167#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8168#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:11,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {8168#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8168#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:11,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {8168#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8169#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:11,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {8169#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8169#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:11,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {8169#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8170#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:11,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {8170#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8170#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:11,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {8170#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8171#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:11,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {8171#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8171#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:11,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {8171#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8172#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:11,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {8172#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8172#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:11,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {8172#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8173#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:11,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {8173#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {8173#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:11,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {8173#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8174#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:11,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {8174#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {8174#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:11,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {8174#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:11,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {8175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:11,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {8175#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8176#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:11,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {8176#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {8176#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:11,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {8176#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8177#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:11,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {8177#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {8177#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:11,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {8177#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8155#false} is VALID [2022-04-15 12:47:11,851 INFO L290 TraceCheckUtils]: 44: Hoare triple {8155#false} assume !(~x~0 % 4294967296 < 100000000); {8155#false} is VALID [2022-04-15 12:47:11,851 INFO L272 TraceCheckUtils]: 45: Hoare triple {8155#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {8155#false} is VALID [2022-04-15 12:47:11,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {8155#false} ~cond := #in~cond; {8155#false} is VALID [2022-04-15 12:47:11,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {8155#false} assume 0 == ~cond; {8155#false} is VALID [2022-04-15 12:47:11,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {8155#false} assume !false; {8155#false} is VALID [2022-04-15 12:47:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:11,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103160078] [2022-04-15 12:47:11,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103160078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:11,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256679559] [2022-04-15 12:47:11,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:11,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:11,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:11,853 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:11,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:47:11,892 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:47:11,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:11,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:47:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:11,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:12,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {8154#true} call ULTIMATE.init(); {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {8154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {8154#true} assume true; {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8154#true} {8154#true} #40#return; {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {8154#true} call #t~ret5 := main(); {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {8154#true} ~x~0 := 0; {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 36: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:12,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:12,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8305#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:12,089 INFO L290 TraceCheckUtils]: 42: Hoare triple {8305#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {8305#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:12,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {8305#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8312#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:47:12,100 INFO L290 TraceCheckUtils]: 44: Hoare triple {8312#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {8155#false} is VALID [2022-04-15 12:47:12,100 INFO L272 TraceCheckUtils]: 45: Hoare triple {8155#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {8155#false} is VALID [2022-04-15 12:47:12,100 INFO L290 TraceCheckUtils]: 46: Hoare triple {8155#false} ~cond := #in~cond; {8155#false} is VALID [2022-04-15 12:47:12,100 INFO L290 TraceCheckUtils]: 47: Hoare triple {8155#false} assume 0 == ~cond; {8155#false} is VALID [2022-04-15 12:47:12,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {8155#false} assume !false; {8155#false} is VALID [2022-04-15 12:47:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-04-15 12:47:12,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:13,046 INFO L290 TraceCheckUtils]: 48: Hoare triple {8155#false} assume !false; {8155#false} is VALID [2022-04-15 12:47:13,047 INFO L290 TraceCheckUtils]: 47: Hoare triple {8331#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8155#false} is VALID [2022-04-15 12:47:13,047 INFO L290 TraceCheckUtils]: 46: Hoare triple {8335#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8331#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:13,048 INFO L272 TraceCheckUtils]: 45: Hoare triple {8339#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {8335#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:13,048 INFO L290 TraceCheckUtils]: 44: Hoare triple {8343#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {8339#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:13,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {8347#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8343#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:47:13,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {8351#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {8347#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:13,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8351#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:13,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 31: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {8154#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {8154#true} assume !!(~x~0 % 4294967296 < 100000000); {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {8154#true} ~x~0 := 0; {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {8154#true} call #t~ret5 := main(); {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8154#true} {8154#true} #40#return; {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {8154#true} assume true; {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {8154#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {8154#true} call ULTIMATE.init(); {8154#true} is VALID [2022-04-15 12:47:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2022-04-15 12:47:13,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256679559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:13,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:13,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4, 8] total 30 [2022-04-15 12:47:13,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:13,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557945275] [2022-04-15 12:47:13,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557945275] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:13,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:13,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:47:13,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399353081] [2022-04-15 12:47:13,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:13,063 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:47:13,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:13,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:13,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:13,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:47:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:47:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-15 12:47:13,120 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:15,365 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 12:47:15,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 12:47:15,365 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 12:47:15,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:47:15,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 61 transitions. [2022-04-15 12:47:15,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 61 transitions. [2022-04-15 12:47:15,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:15,454 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:47:15,454 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 12:47:15,454 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 12:47:15,455 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:15,455 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 109 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:47:15,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 12:47:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 12:47:15,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:15,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,558 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,558 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:15,559 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:47:15,559 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:47:15,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:15,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:15,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:47:15,559 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 12:47:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:15,560 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-04-15 12:47:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:47:15,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:15,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:15,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:15,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-04-15 12:47:15,561 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 49 [2022-04-15 12:47:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:15,561 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-04-15 12:47:15,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0454545454545454) internal successors, (45), 21 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:15,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 55 transitions. [2022-04-15 12:47:15,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:15,729 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-04-15 12:47:15,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 12:47:15,729 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:15,729 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:15,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-15 12:47:15,929 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37,SelfDestructingSolverStorable38 [2022-04-15 12:47:15,930 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:15,930 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 37 times [2022-04-15 12:47:15,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:15,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2041435994] [2022-04-15 12:47:16,099 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:16,101 INFO L85 PathProgramCache]: Analyzing trace with hash -180173967, now seen corresponding path program 1 times [2022-04-15 12:47:16,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:16,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099211804] [2022-04-15 12:47:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:16,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:16,106 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:16,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 659549860, now seen corresponding path program 38 times [2022-04-15 12:47:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:16,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974761921] [2022-04-15 12:47:16,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:16,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:16,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:16,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {8875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8850#true} is VALID [2022-04-15 12:47:16,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {8850#true} assume true; {8850#true} is VALID [2022-04-15 12:47:16,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8850#true} {8850#true} #40#return; {8850#true} is VALID [2022-04-15 12:47:16,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {8850#true} call ULTIMATE.init(); {8875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:16,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {8875#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8850#true} is VALID [2022-04-15 12:47:16,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {8850#true} assume true; {8850#true} is VALID [2022-04-15 12:47:16,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8850#true} {8850#true} #40#return; {8850#true} is VALID [2022-04-15 12:47:16,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {8850#true} call #t~ret5 := main(); {8850#true} is VALID [2022-04-15 12:47:16,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {8850#true} ~x~0 := 0; {8855#(= main_~x~0 0)} is VALID [2022-04-15 12:47:16,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {8855#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {8855#(= main_~x~0 0)} is VALID [2022-04-15 12:47:16,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {8855#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:16,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:16,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:16,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:16,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:16,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:16,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:16,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:16,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:16,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:16,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:16,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:16,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:16,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:16,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:16,463 INFO L290 TraceCheckUtils]: 22: Hoare triple {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:16,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:16,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:16,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:16,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:16,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:16,467 INFO L290 TraceCheckUtils]: 28: Hoare triple {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:16,468 INFO L290 TraceCheckUtils]: 29: Hoare triple {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:16,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:16,470 INFO L290 TraceCheckUtils]: 31: Hoare triple {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:16,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:16,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:16,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:16,473 INFO L290 TraceCheckUtils]: 35: Hoare triple {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:16,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:16,475 INFO L290 TraceCheckUtils]: 37: Hoare triple {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:16,476 INFO L290 TraceCheckUtils]: 38: Hoare triple {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:16,477 INFO L290 TraceCheckUtils]: 39: Hoare triple {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:16,477 INFO L290 TraceCheckUtils]: 40: Hoare triple {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:16,478 INFO L290 TraceCheckUtils]: 41: Hoare triple {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:16,479 INFO L290 TraceCheckUtils]: 42: Hoare triple {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:16,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8874#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:16,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {8874#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {8874#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:16,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {8874#(and (<= main_~x~0 19) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8851#false} is VALID [2022-04-15 12:47:16,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {8851#false} assume !(~x~0 % 4294967296 < 100000000); {8851#false} is VALID [2022-04-15 12:47:16,481 INFO L272 TraceCheckUtils]: 47: Hoare triple {8851#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {8851#false} is VALID [2022-04-15 12:47:16,481 INFO L290 TraceCheckUtils]: 48: Hoare triple {8851#false} ~cond := #in~cond; {8851#false} is VALID [2022-04-15 12:47:16,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {8851#false} assume 0 == ~cond; {8851#false} is VALID [2022-04-15 12:47:16,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {8851#false} assume !false; {8851#false} is VALID [2022-04-15 12:47:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:16,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:16,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974761921] [2022-04-15 12:47:16,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974761921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:16,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858415094] [2022-04-15 12:47:16,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:47:16,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:16,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:16,483 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:16,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:47:16,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:47:16,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:16,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:47:16,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:16,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:16,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {8850#true} call ULTIMATE.init(); {8850#true} is VALID [2022-04-15 12:47:16,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {8850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8850#true} is VALID [2022-04-15 12:47:16,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {8850#true} assume true; {8850#true} is VALID [2022-04-15 12:47:16,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8850#true} {8850#true} #40#return; {8850#true} is VALID [2022-04-15 12:47:16,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {8850#true} call #t~ret5 := main(); {8850#true} is VALID [2022-04-15 12:47:16,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {8850#true} ~x~0 := 0; {8855#(= main_~x~0 0)} is VALID [2022-04-15 12:47:16,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {8855#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {8855#(= main_~x~0 0)} is VALID [2022-04-15 12:47:16,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {8855#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:16,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:16,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {8856#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:16,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:16,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {8857#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:16,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:16,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {8858#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:16,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:16,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {8859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:16,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:16,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {8860#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:16,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:16,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {8861#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:16,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:16,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {8862#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:16,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:16,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {8863#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:16,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:16,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {8864#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:16,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:16,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {8865#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:16,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:16,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {8866#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:16,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:16,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {8867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:16,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:16,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {8868#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:16,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:16,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {8869#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:16,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:16,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {8870#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:16,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:16,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {8871#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:16,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:16,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {8872#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:16,921 INFO L290 TraceCheckUtils]: 42: Hoare triple {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:16,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {8873#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9008#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:16,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {9008#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {9008#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:16,923 INFO L290 TraceCheckUtils]: 45: Hoare triple {9008#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8851#false} is VALID [2022-04-15 12:47:16,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {8851#false} assume !(~x~0 % 4294967296 < 100000000); {8851#false} is VALID [2022-04-15 12:47:16,924 INFO L272 TraceCheckUtils]: 47: Hoare triple {8851#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {8851#false} is VALID [2022-04-15 12:47:16,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {8851#false} ~cond := #in~cond; {8851#false} is VALID [2022-04-15 12:47:16,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {8851#false} assume 0 == ~cond; {8851#false} is VALID [2022-04-15 12:47:16,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {8851#false} assume !false; {8851#false} is VALID [2022-04-15 12:47:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:16,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:18,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {8851#false} assume !false; {8851#false} is VALID [2022-04-15 12:47:18,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {8851#false} assume 0 == ~cond; {8851#false} is VALID [2022-04-15 12:47:18,621 INFO L290 TraceCheckUtils]: 48: Hoare triple {8851#false} ~cond := #in~cond; {8851#false} is VALID [2022-04-15 12:47:18,621 INFO L272 TraceCheckUtils]: 47: Hoare triple {8851#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {8851#false} is VALID [2022-04-15 12:47:18,621 INFO L290 TraceCheckUtils]: 46: Hoare triple {8851#false} assume !(~x~0 % 4294967296 < 100000000); {8851#false} is VALID [2022-04-15 12:47:18,622 INFO L290 TraceCheckUtils]: 45: Hoare triple {9045#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {8851#false} is VALID [2022-04-15 12:47:18,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {9049#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9045#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:18,624 INFO L290 TraceCheckUtils]: 43: Hoare triple {9053#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9049#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,624 INFO L290 TraceCheckUtils]: 42: Hoare triple {9053#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9053#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {9060#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9053#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {9060#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9060#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {9067#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9060#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {9067#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9067#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {9074#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9067#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,631 INFO L290 TraceCheckUtils]: 36: Hoare triple {9074#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9074#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,632 INFO L290 TraceCheckUtils]: 35: Hoare triple {9081#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9074#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,632 INFO L290 TraceCheckUtils]: 34: Hoare triple {9081#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9081#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {9088#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9081#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {9088#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9088#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {9095#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9088#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {9095#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9095#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {9102#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9095#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {9102#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9102#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {9109#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9102#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {9109#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9109#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {9116#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9109#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {9116#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9116#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {9123#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9116#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {9123#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9123#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,643 INFO L290 TraceCheckUtils]: 21: Hoare triple {9130#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9123#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,643 INFO L290 TraceCheckUtils]: 20: Hoare triple {9130#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {9130#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {9137#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9130#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:18,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {9137#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9137#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {9144#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9137#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {9144#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9144#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {9151#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9144#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {9151#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9151#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {9158#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9151#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {9158#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9158#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {9165#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9158#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {9165#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9165#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {9172#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9165#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {9172#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9172#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {9179#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9172#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {9179#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {9179#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {8850#true} ~x~0 := 0; {9179#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:18,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {8850#true} call #t~ret5 := main(); {8850#true} is VALID [2022-04-15 12:47:18,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8850#true} {8850#true} #40#return; {8850#true} is VALID [2022-04-15 12:47:18,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {8850#true} assume true; {8850#true} is VALID [2022-04-15 12:47:18,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {8850#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {8850#true} is VALID [2022-04-15 12:47:18,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {8850#true} call ULTIMATE.init(); {8850#true} is VALID [2022-04-15 12:47:18,653 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:18,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858415094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:18,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:18,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 23] total 45 [2022-04-15 12:47:18,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:18,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2041435994] [2022-04-15 12:47:18,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2041435994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:18,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:18,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 12:47:18,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205316035] [2022-04-15 12:47:18,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:18,654 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:47:18,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:18,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:18,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:18,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 12:47:18,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:18,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 12:47:18,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=1431, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:47:18,762 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:21,093 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 12:47:21,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:47:21,093 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 12:47:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:47:21,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 63 transitions. [2022-04-15 12:47:21,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 63 transitions. [2022-04-15 12:47:21,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:21,184 INFO L225 Difference]: With dead ends: 62 [2022-04-15 12:47:21,184 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:47:21,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1087, Invalid=3073, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 12:47:21,186 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:21,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 29 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:47:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:47:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 12:47:21,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:21,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,293 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,293 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:21,294 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:47:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:47:21,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:21,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:21,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:47:21,295 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:47:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:21,295 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2022-04-15 12:47:21,295 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:47:21,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:21,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:21,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:21,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2022-04-15 12:47:21,296 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 51 [2022-04-15 12:47:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:21,296 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2022-04-15 12:47:21,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:21,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 57 transitions. [2022-04-15 12:47:21,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:21,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2022-04-15 12:47:21,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 12:47:21,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:21,409 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:21,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:21,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 12:47:21,610 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:21,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:21,610 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 39 times [2022-04-15 12:47:21,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:21,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1288709165] [2022-04-15 12:47:21,721 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash -121068623, now seen corresponding path program 1 times [2022-04-15 12:47:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:21,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214087061] [2022-04-15 12:47:21,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:21,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:21,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 114192705, now seen corresponding path program 40 times [2022-04-15 12:47:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:21,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481196272] [2022-04-15 12:47:21,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:22,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:22,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {9613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9587#true} is VALID [2022-04-15 12:47:22,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-15 12:47:22,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9587#true} {9587#true} #40#return; {9587#true} is VALID [2022-04-15 12:47:22,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {9587#true} call ULTIMATE.init(); {9613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:22,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {9613#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9587#true} is VALID [2022-04-15 12:47:22,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-15 12:47:22,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9587#true} {9587#true} #40#return; {9587#true} is VALID [2022-04-15 12:47:22,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {9587#true} call #t~ret5 := main(); {9587#true} is VALID [2022-04-15 12:47:22,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {9587#true} ~x~0 := 0; {9592#(= main_~x~0 0)} is VALID [2022-04-15 12:47:22,144 INFO L290 TraceCheckUtils]: 6: Hoare triple {9592#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {9592#(= main_~x~0 0)} is VALID [2022-04-15 12:47:22,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {9592#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:22,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:22,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:22,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:22,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:22,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:22,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:22,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:22,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:22,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:22,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:22,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:22,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:22,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:22,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:22,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:22,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:22,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:22,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:22,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:22,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:22,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:22,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:22,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:22,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:22,169 INFO L290 TraceCheckUtils]: 32: Hoare triple {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:22,170 INFO L290 TraceCheckUtils]: 33: Hoare triple {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:22,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:22,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:22,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:22,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:22,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:22,176 INFO L290 TraceCheckUtils]: 39: Hoare triple {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:22,176 INFO L290 TraceCheckUtils]: 40: Hoare triple {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:22,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:22,178 INFO L290 TraceCheckUtils]: 42: Hoare triple {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:22,179 INFO L290 TraceCheckUtils]: 43: Hoare triple {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:22,179 INFO L290 TraceCheckUtils]: 44: Hoare triple {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:22,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9612#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:22,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {9612#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {9612#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:22,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {9612#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {9588#false} is VALID [2022-04-15 12:47:22,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {9588#false} assume !(~x~0 % 4294967296 < 100000000); {9588#false} is VALID [2022-04-15 12:47:22,182 INFO L272 TraceCheckUtils]: 49: Hoare triple {9588#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {9588#false} is VALID [2022-04-15 12:47:22,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {9588#false} ~cond := #in~cond; {9588#false} is VALID [2022-04-15 12:47:22,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {9588#false} assume 0 == ~cond; {9588#false} is VALID [2022-04-15 12:47:22,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {9588#false} assume !false; {9588#false} is VALID [2022-04-15 12:47:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 21 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:22,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:22,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481196272] [2022-04-15 12:47:22,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481196272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801023658] [2022-04-15 12:47:22,183 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:47:22,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:22,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:22,184 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:22,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:47:22,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:47:22,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:22,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 12:47:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:22,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:22,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {9587#true} call ULTIMATE.init(); {9587#true} is VALID [2022-04-15 12:47:22,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9587#true} is VALID [2022-04-15 12:47:22,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-15 12:47:22,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9587#true} {9587#true} #40#return; {9587#true} is VALID [2022-04-15 12:47:22,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {9587#true} call #t~ret5 := main(); {9587#true} is VALID [2022-04-15 12:47:22,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {9587#true} ~x~0 := 0; {9592#(= main_~x~0 0)} is VALID [2022-04-15 12:47:22,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {9592#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {9592#(= main_~x~0 0)} is VALID [2022-04-15 12:47:22,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {9592#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:22,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:22,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {9593#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:22,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:22,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {9594#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:22,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:22,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {9595#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:22,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:22,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {9596#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:22,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:22,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {9597#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:22,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:22,768 INFO L290 TraceCheckUtils]: 19: Hoare triple {9598#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:22,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:22,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {9599#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:22,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:22,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {9600#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:22,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:22,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {9601#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:22,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:22,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {9602#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:22,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:22,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {9603#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:22,777 INFO L290 TraceCheckUtils]: 30: Hoare triple {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:22,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {9604#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:22,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:22,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {9605#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:22,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:22,782 INFO L290 TraceCheckUtils]: 35: Hoare triple {9606#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:22,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:22,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {9607#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:22,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:22,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {9608#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:22,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:22,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {9609#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:22,787 INFO L290 TraceCheckUtils]: 42: Hoare triple {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:22,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {9610#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:22,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:22,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {9611#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9752#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:22,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {9752#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {9752#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:22,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {9752#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {9759#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:22,793 INFO L290 TraceCheckUtils]: 48: Hoare triple {9759#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 100000000); {9588#false} is VALID [2022-04-15 12:47:22,793 INFO L272 TraceCheckUtils]: 49: Hoare triple {9588#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {9588#false} is VALID [2022-04-15 12:47:22,793 INFO L290 TraceCheckUtils]: 50: Hoare triple {9588#false} ~cond := #in~cond; {9588#false} is VALID [2022-04-15 12:47:22,793 INFO L290 TraceCheckUtils]: 51: Hoare triple {9588#false} assume 0 == ~cond; {9588#false} is VALID [2022-04-15 12:47:22,794 INFO L290 TraceCheckUtils]: 52: Hoare triple {9588#false} assume !false; {9588#false} is VALID [2022-04-15 12:47:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:22,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:24,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {9588#false} assume !false; {9588#false} is VALID [2022-04-15 12:47:24,400 INFO L290 TraceCheckUtils]: 51: Hoare triple {9588#false} assume 0 == ~cond; {9588#false} is VALID [2022-04-15 12:47:24,400 INFO L290 TraceCheckUtils]: 50: Hoare triple {9588#false} ~cond := #in~cond; {9588#false} is VALID [2022-04-15 12:47:24,400 INFO L272 TraceCheckUtils]: 49: Hoare triple {9588#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {9588#false} is VALID [2022-04-15 12:47:24,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {9787#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {9588#false} is VALID [2022-04-15 12:47:24,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {9791#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {9787#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,402 INFO L290 TraceCheckUtils]: 46: Hoare triple {9791#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9791#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,404 INFO L290 TraceCheckUtils]: 45: Hoare triple {9798#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9791#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {9798#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9798#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {9805#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9798#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {9805#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9805#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,408 INFO L290 TraceCheckUtils]: 41: Hoare triple {9812#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9805#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {9812#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9812#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {9819#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9812#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,410 INFO L290 TraceCheckUtils]: 38: Hoare triple {9819#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9819#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,411 INFO L290 TraceCheckUtils]: 37: Hoare triple {9826#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9819#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,411 INFO L290 TraceCheckUtils]: 36: Hoare triple {9826#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9826#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {9833#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9826#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {9833#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9833#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {9840#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9833#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {9840#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9840#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {9847#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9840#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {9847#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9847#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {9854#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9847#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {9854#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9854#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,418 INFO L290 TraceCheckUtils]: 27: Hoare triple {9861#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9854#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {9861#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9861#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {9868#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9861#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,420 INFO L290 TraceCheckUtils]: 24: Hoare triple {9868#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9868#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {9875#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9868#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {9875#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9875#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {9882#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9875#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {9882#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9882#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {9889#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9882#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {9889#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9889#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {9896#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9889#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {9896#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9896#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {9903#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9896#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {9903#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9903#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {9910#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9903#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {9910#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9910#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,430 INFO L290 TraceCheckUtils]: 11: Hoare triple {9917#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9910#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {9917#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9917#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {9924#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9917#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {9924#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9924#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {9931#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {9924#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {9931#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {9931#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {9587#true} ~x~0 := 0; {9931#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:47:24,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {9587#true} call #t~ret5 := main(); {9587#true} is VALID [2022-04-15 12:47:24,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9587#true} {9587#true} #40#return; {9587#true} is VALID [2022-04-15 12:47:24,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {9587#true} assume true; {9587#true} is VALID [2022-04-15 12:47:24,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {9587#true} is VALID [2022-04-15 12:47:24,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {9587#true} call ULTIMATE.init(); {9587#true} is VALID [2022-04-15 12:47:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:24,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801023658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:24,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:24,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2022-04-15 12:47:24,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:24,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1288709165] [2022-04-15 12:47:24,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1288709165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:24,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:24,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:47:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201377953] [2022-04-15 12:47:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:24,437 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:47:24,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:24,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:24,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:24,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:47:24,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:24,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:47:24,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=1636, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:47:24,517 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:27,333 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2022-04-15 12:47:27,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 12:47:27,333 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 12:47:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:47:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 12:47:27,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-15 12:47:27,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:27,488 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:47:27,488 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 12:47:27,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1206, Invalid=3486, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:47:27,489 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:27,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 59 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 12:47:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 12:47:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-15 12:47:27,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:27,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,604 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,604 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:27,605 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:47:27,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:47:27,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:27,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:27,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:47:27,605 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-15 12:47:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:27,606 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2022-04-15 12:47:27,606 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:47:27,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:27,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:27,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:27,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:27,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2022-04-15 12:47:27,607 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 53 [2022-04-15 12:47:27,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:27,607 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2022-04-15 12:47:27,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 23 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:27,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 59 transitions. [2022-04-15 12:47:27,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2022-04-15 12:47:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 12:47:27,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:27,770 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:27,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:27,970 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41,SelfDestructingSolverStorable42 [2022-04-15 12:47:27,970 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:27,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:27,970 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 41 times [2022-04-15 12:47:27,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:27,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [869475895] [2022-04-15 12:47:28,144 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:28,146 INFO L85 PathProgramCache]: Analyzing trace with hash -61963279, now seen corresponding path program 1 times [2022-04-15 12:47:28,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:28,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353170306] [2022-04-15 12:47:28,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:28,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:28,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:28,171 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 11976862, now seen corresponding path program 42 times [2022-04-15 12:47:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:28,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528025393] [2022-04-15 12:47:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:28,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:28,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {10380#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10353#true} is VALID [2022-04-15 12:47:28,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {10353#true} assume true; {10353#true} is VALID [2022-04-15 12:47:28,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10353#true} {10353#true} #40#return; {10353#true} is VALID [2022-04-15 12:47:28,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {10353#true} call ULTIMATE.init(); {10380#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:28,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {10380#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10353#true} is VALID [2022-04-15 12:47:28,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {10353#true} assume true; {10353#true} is VALID [2022-04-15 12:47:28,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10353#true} {10353#true} #40#return; {10353#true} is VALID [2022-04-15 12:47:28,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {10353#true} call #t~ret5 := main(); {10353#true} is VALID [2022-04-15 12:47:28,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {10353#true} ~x~0 := 0; {10358#(= main_~x~0 0)} is VALID [2022-04-15 12:47:28,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {10358#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {10358#(= main_~x~0 0)} is VALID [2022-04-15 12:47:28,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {10358#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10359#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:28,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {10359#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {10359#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:28,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {10359#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10360#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:28,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {10360#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {10360#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:28,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {10360#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10361#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:28,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {10361#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10361#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:28,618 INFO L290 TraceCheckUtils]: 13: Hoare triple {10361#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10362#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:28,618 INFO L290 TraceCheckUtils]: 14: Hoare triple {10362#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10362#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:28,619 INFO L290 TraceCheckUtils]: 15: Hoare triple {10362#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10363#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:28,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {10363#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {10363#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:28,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {10363#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10364#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:28,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {10364#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {10364#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:28,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {10364#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10365#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:28,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {10365#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10365#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:28,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {10365#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:28,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {10366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:28,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {10366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10367#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:28,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {10367#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10367#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:28,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {10367#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10368#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:28,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {10368#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10368#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:28,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {10368#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10369#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:28,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {10369#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10369#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:28,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {10369#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10370#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:28,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {10370#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10370#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:28,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {10370#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10371#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:28,639 INFO L290 TraceCheckUtils]: 32: Hoare triple {10371#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10371#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:28,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {10371#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10372#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:28,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {10372#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {10372#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:28,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {10372#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10373#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:28,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {10373#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {10373#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:28,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {10373#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:28,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:28,646 INFO L290 TraceCheckUtils]: 39: Hoare triple {10374#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10375#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:28,646 INFO L290 TraceCheckUtils]: 40: Hoare triple {10375#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {10375#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:28,648 INFO L290 TraceCheckUtils]: 41: Hoare triple {10375#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:28,648 INFO L290 TraceCheckUtils]: 42: Hoare triple {10376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:28,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {10376#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10377#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:28,649 INFO L290 TraceCheckUtils]: 44: Hoare triple {10377#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {10377#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:28,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {10377#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10378#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:28,652 INFO L290 TraceCheckUtils]: 46: Hoare triple {10378#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {10378#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:28,652 INFO L290 TraceCheckUtils]: 47: Hoare triple {10378#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:28,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {10379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {10379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:28,653 INFO L290 TraceCheckUtils]: 49: Hoare triple {10379#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 21))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {10354#false} is VALID [2022-04-15 12:47:28,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {10354#false} assume !(~x~0 % 4294967296 < 100000000); {10354#false} is VALID [2022-04-15 12:47:28,653 INFO L272 TraceCheckUtils]: 51: Hoare triple {10354#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {10354#false} is VALID [2022-04-15 12:47:28,654 INFO L290 TraceCheckUtils]: 52: Hoare triple {10354#false} ~cond := #in~cond; {10354#false} is VALID [2022-04-15 12:47:28,654 INFO L290 TraceCheckUtils]: 53: Hoare triple {10354#false} assume 0 == ~cond; {10354#false} is VALID [2022-04-15 12:47:28,654 INFO L290 TraceCheckUtils]: 54: Hoare triple {10354#false} assume !false; {10354#false} is VALID [2022-04-15 12:47:28,654 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:28,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:28,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528025393] [2022-04-15 12:47:28,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528025393] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194812155] [2022-04-15 12:47:28,660 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:28,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:28,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:28,661 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:28,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:47:28,718 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:47:28,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:28,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:47:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:28,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:28,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {10353#true} call ULTIMATE.init(); {10353#true} is VALID [2022-04-15 12:47:28,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {10353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10353#true} is VALID [2022-04-15 12:47:28,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {10353#true} assume true; {10353#true} is VALID [2022-04-15 12:47:28,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10353#true} {10353#true} #40#return; {10353#true} is VALID [2022-04-15 12:47:28,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {10353#true} call #t~ret5 := main(); {10353#true} is VALID [2022-04-15 12:47:28,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {10353#true} ~x~0 := 0; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 10: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 34: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 38: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 39: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 41: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:28,893 INFO L290 TraceCheckUtils]: 46: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:28,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10525#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:28,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {10525#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {10525#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:28,902 INFO L290 TraceCheckUtils]: 49: Hoare triple {10525#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {10532#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:47:28,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {10532#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {10354#false} is VALID [2022-04-15 12:47:28,907 INFO L272 TraceCheckUtils]: 51: Hoare triple {10354#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {10354#false} is VALID [2022-04-15 12:47:28,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {10354#false} ~cond := #in~cond; {10354#false} is VALID [2022-04-15 12:47:28,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {10354#false} assume 0 == ~cond; {10354#false} is VALID [2022-04-15 12:47:28,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {10354#false} assume !false; {10354#false} is VALID [2022-04-15 12:47:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:47:28,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:29,683 INFO L290 TraceCheckUtils]: 54: Hoare triple {10354#false} assume !false; {10354#false} is VALID [2022-04-15 12:47:29,683 INFO L290 TraceCheckUtils]: 53: Hoare triple {10551#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10354#false} is VALID [2022-04-15 12:47:29,684 INFO L290 TraceCheckUtils]: 52: Hoare triple {10555#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10551#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:29,684 INFO L272 TraceCheckUtils]: 51: Hoare triple {10559#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {10555#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:29,684 INFO L290 TraceCheckUtils]: 50: Hoare triple {10563#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {10559#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:29,687 INFO L290 TraceCheckUtils]: 49: Hoare triple {10567#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {10563#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:47:29,696 INFO L290 TraceCheckUtils]: 48: Hoare triple {10571#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {10567#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 47: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10571#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 43: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,698 INFO L290 TraceCheckUtils]: 39: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 29: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 28: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {10353#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {10353#true} assume !!(~x~0 % 4294967296 < 100000000); {10353#true} is VALID [2022-04-15 12:47:29,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {10353#true} ~x~0 := 0; {10353#true} is VALID [2022-04-15 12:47:29,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {10353#true} call #t~ret5 := main(); {10353#true} is VALID [2022-04-15 12:47:29,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10353#true} {10353#true} #40#return; {10353#true} is VALID [2022-04-15 12:47:29,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {10353#true} assume true; {10353#true} is VALID [2022-04-15 12:47:29,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {10353#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {10353#true} is VALID [2022-04-15 12:47:29,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {10353#true} call ULTIMATE.init(); {10353#true} is VALID [2022-04-15 12:47:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 63 proven. 1 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 12:47:29,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194812155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:29,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:29,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 4, 8] total 33 [2022-04-15 12:47:29,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [869475895] [2022-04-15 12:47:29,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [869475895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:29,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:29,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 12:47:29,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953426502] [2022-04-15 12:47:29,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:29,719 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:47:29,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:29,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:29,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:29,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 12:47:29,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:29,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 12:47:29,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:47:29,855 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:33,869 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 12:47:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:47:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 12:47:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:47:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 67 transitions. [2022-04-15 12:47:33,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 67 transitions. [2022-04-15 12:47:33,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:33,999 INFO L225 Difference]: With dead ends: 66 [2022-04-15 12:47:33,999 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:47:34,000 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=395, Invalid=2575, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:47:34,000 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:34,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 39 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:47:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:47:34,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 12:47:34,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:34,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:34,072 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:34,072 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:34,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:34,073 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:47:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:47:34,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:34,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:34,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:47:34,074 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:47:34,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:34,074 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2022-04-15 12:47:34,074 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:47:34,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:34,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:34,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:34,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 54 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-04-15 12:47:34,075 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2022-04-15 12:47:34,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:34,075 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-04-15 12:47:34,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 24 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:34,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 61 transitions. [2022-04-15 12:47:34,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-04-15 12:47:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 12:47:34,228 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:34,228 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:34,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:34,429 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44 [2022-04-15 12:47:34,429 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:34,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 43 times [2022-04-15 12:47:34,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:34,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1111635173] [2022-04-15 12:47:34,595 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2857935, now seen corresponding path program 1 times [2022-04-15 12:47:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:34,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854824973] [2022-04-15 12:47:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:34,603 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:34,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash 566799547, now seen corresponding path program 44 times [2022-04-15 12:47:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:34,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910451818] [2022-04-15 12:47:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:34,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:34,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11130#true} is VALID [2022-04-15 12:47:34,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {11130#true} assume true; {11130#true} is VALID [2022-04-15 12:47:34,967 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11130#true} {11130#true} #40#return; {11130#true} is VALID [2022-04-15 12:47:34,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {11130#true} call ULTIMATE.init(); {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:34,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {11158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11130#true} is VALID [2022-04-15 12:47:34,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {11130#true} assume true; {11130#true} is VALID [2022-04-15 12:47:34,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11130#true} {11130#true} #40#return; {11130#true} is VALID [2022-04-15 12:47:34,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {11130#true} call #t~ret5 := main(); {11130#true} is VALID [2022-04-15 12:47:34,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {11130#true} ~x~0 := 0; {11135#(= main_~x~0 0)} is VALID [2022-04-15 12:47:34,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {11135#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11135#(= main_~x~0 0)} is VALID [2022-04-15 12:47:34,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {11135#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:34,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:34,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:34,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:34,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:34,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:34,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:34,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:34,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:34,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:34,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:34,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:34,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:34,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:34,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:34,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:34,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:34,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:34,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:34,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:34,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:34,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:34,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:34,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:35,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:35,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:35,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:35,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:35,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:35,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:35,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:35,009 INFO L290 TraceCheckUtils]: 38: Hoare triple {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:35,011 INFO L290 TraceCheckUtils]: 39: Hoare triple {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:35,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:35,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:35,020 INFO L290 TraceCheckUtils]: 42: Hoare triple {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:35,023 INFO L290 TraceCheckUtils]: 43: Hoare triple {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:35,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:35,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:35,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:35,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:35,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:35,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11157#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:35,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {11157#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11157#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:35,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {11157#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11131#false} is VALID [2022-04-15 12:47:35,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {11131#false} assume !(~x~0 % 4294967296 < 100000000); {11131#false} is VALID [2022-04-15 12:47:35,032 INFO L272 TraceCheckUtils]: 53: Hoare triple {11131#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {11131#false} is VALID [2022-04-15 12:47:35,032 INFO L290 TraceCheckUtils]: 54: Hoare triple {11131#false} ~cond := #in~cond; {11131#false} is VALID [2022-04-15 12:47:35,032 INFO L290 TraceCheckUtils]: 55: Hoare triple {11131#false} assume 0 == ~cond; {11131#false} is VALID [2022-04-15 12:47:35,032 INFO L290 TraceCheckUtils]: 56: Hoare triple {11131#false} assume !false; {11131#false} is VALID [2022-04-15 12:47:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:35,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910451818] [2022-04-15 12:47:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910451818] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:35,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081742182] [2022-04-15 12:47:35,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:47:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:35,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:35,034 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:35,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:47:35,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:47:35,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:35,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 12:47:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:35,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:35,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {11130#true} call ULTIMATE.init(); {11130#true} is VALID [2022-04-15 12:47:35,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {11130#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11130#true} is VALID [2022-04-15 12:47:35,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {11130#true} assume true; {11130#true} is VALID [2022-04-15 12:47:35,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11130#true} {11130#true} #40#return; {11130#true} is VALID [2022-04-15 12:47:35,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {11130#true} call #t~ret5 := main(); {11130#true} is VALID [2022-04-15 12:47:35,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {11130#true} ~x~0 := 0; {11135#(= main_~x~0 0)} is VALID [2022-04-15 12:47:35,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {11135#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11135#(= main_~x~0 0)} is VALID [2022-04-15 12:47:35,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {11135#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:35,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:35,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {11136#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:35,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:35,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {11137#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:35,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:35,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {11138#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:35,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:35,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {11139#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:35,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:35,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {11140#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:35,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:35,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {11141#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:35,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:35,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {11142#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:35,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:35,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {11143#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:35,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:35,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {11144#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:35,458 INFO L290 TraceCheckUtils]: 26: Hoare triple {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:35,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {11145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:35,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:35,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {11146#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:35,462 INFO L290 TraceCheckUtils]: 30: Hoare triple {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:35,464 INFO L290 TraceCheckUtils]: 31: Hoare triple {11147#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:35,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:35,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {11148#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:35,466 INFO L290 TraceCheckUtils]: 34: Hoare triple {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:35,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {11149#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:35,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:35,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {11150#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:35,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:35,472 INFO L290 TraceCheckUtils]: 39: Hoare triple {11151#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:35,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:35,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {11152#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:35,475 INFO L290 TraceCheckUtils]: 42: Hoare triple {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:35,477 INFO L290 TraceCheckUtils]: 43: Hoare triple {11153#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:35,477 INFO L290 TraceCheckUtils]: 44: Hoare triple {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:35,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {11154#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:35,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:35,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {11155#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:35,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:35,484 INFO L290 TraceCheckUtils]: 49: Hoare triple {11156#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:35,485 INFO L290 TraceCheckUtils]: 50: Hoare triple {11309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:35,486 INFO L290 TraceCheckUtils]: 51: Hoare triple {11309#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11316#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:47:35,487 INFO L290 TraceCheckUtils]: 52: Hoare triple {11316#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {11131#false} is VALID [2022-04-15 12:47:35,487 INFO L272 TraceCheckUtils]: 53: Hoare triple {11131#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {11131#false} is VALID [2022-04-15 12:47:35,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {11131#false} ~cond := #in~cond; {11131#false} is VALID [2022-04-15 12:47:35,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {11131#false} assume 0 == ~cond; {11131#false} is VALID [2022-04-15 12:47:35,487 INFO L290 TraceCheckUtils]: 56: Hoare triple {11131#false} assume !false; {11131#false} is VALID [2022-04-15 12:47:35,488 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:35,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:37,649 INFO L290 TraceCheckUtils]: 56: Hoare triple {11131#false} assume !false; {11131#false} is VALID [2022-04-15 12:47:37,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {11131#false} assume 0 == ~cond; {11131#false} is VALID [2022-04-15 12:47:37,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {11131#false} ~cond := #in~cond; {11131#false} is VALID [2022-04-15 12:47:37,650 INFO L272 TraceCheckUtils]: 53: Hoare triple {11131#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {11131#false} is VALID [2022-04-15 12:47:37,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {11344#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {11131#false} is VALID [2022-04-15 12:47:37,653 INFO L290 TraceCheckUtils]: 51: Hoare triple {11348#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11344#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,653 INFO L290 TraceCheckUtils]: 50: Hoare triple {11348#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11348#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {11355#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11348#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {11355#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11355#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {11362#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11355#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {11362#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11362#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {11369#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11362#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {11369#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11369#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {11376#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11369#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,665 INFO L290 TraceCheckUtils]: 42: Hoare triple {11376#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11376#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {11383#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11376#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,669 INFO L290 TraceCheckUtils]: 40: Hoare triple {11383#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11383#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {11390#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11383#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {11390#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11390#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {11397#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11390#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {11397#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11397#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {11404#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11397#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {11404#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11404#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {11411#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11404#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,680 INFO L290 TraceCheckUtils]: 32: Hoare triple {11411#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11411#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {11418#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11411#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {11418#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11418#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {11425#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11418#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {11425#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11425#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {11432#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11425#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {11432#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11432#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {11439#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11432#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {11439#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11439#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {11446#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11439#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {11446#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11446#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {11453#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11446#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {11453#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11453#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {11460#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11453#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {11460#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11460#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {11467#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11460#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {11467#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11467#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {11474#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11467#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {11474#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11474#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {11481#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11474#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {11481#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11481#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {11488#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11481#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {11488#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11488#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {11495#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11488#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {11495#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11495#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {11502#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11495#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {11502#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {11502#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {11130#true} ~x~0 := 0; {11502#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:47:37,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {11130#true} call #t~ret5 := main(); {11130#true} is VALID [2022-04-15 12:47:37,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11130#true} {11130#true} #40#return; {11130#true} is VALID [2022-04-15 12:47:37,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {11130#true} assume true; {11130#true} is VALID [2022-04-15 12:47:37,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {11130#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11130#true} is VALID [2022-04-15 12:47:37,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {11130#true} call ULTIMATE.init(); {11130#true} is VALID [2022-04-15 12:47:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:37,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081742182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:37,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:37,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2022-04-15 12:47:37,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:37,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1111635173] [2022-04-15 12:47:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1111635173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:37,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:37,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:47:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913988278] [2022-04-15 12:47:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:37,726 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:47:37,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:37,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:37,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:37,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:47:37,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:47:37,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=1928, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 12:47:37,919 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:44,450 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 12:47:44,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 12:47:44,450 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-15 12:47:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:47:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 69 transitions. [2022-04-15 12:47:44,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 69 transitions. [2022-04-15 12:47:44,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:44,715 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:47:44,715 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 12:47:44,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1412, Invalid=4138, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:47:44,716 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:44,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 124 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 12:47:44,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 12:47:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-15 12:47:44,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:44,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,851 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,851 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:44,859 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:47:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:47:44,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:44,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:44,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 12:47:44,860 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-15 12:47:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:44,861 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2022-04-15 12:47:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:47:44,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:44,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:44,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:44,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2022-04-15 12:47:44,863 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2022-04-15 12:47:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:44,863 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2022-04-15 12:47:44,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 25 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:44,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 63 transitions. [2022-04-15 12:47:45,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2022-04-15 12:47:45,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 12:47:45,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:45,030 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:45,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:45,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:45,231 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:45,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:45,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 45 times [2022-04-15 12:47:45,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:45,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955019000] [2022-04-15 12:47:45,362 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:45,363 INFO L85 PathProgramCache]: Analyzing trace with hash 56247409, now seen corresponding path program 1 times [2022-04-15 12:47:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:45,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284734059] [2022-04-15 12:47:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:45,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:45,404 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:45,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1175455128, now seen corresponding path program 46 times [2022-04-15 12:47:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517574904] [2022-04-15 12:47:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:45,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:45,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {11981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11952#true} is VALID [2022-04-15 12:47:45,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {11952#true} assume true; {11952#true} is VALID [2022-04-15 12:47:45,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11952#true} {11952#true} #40#return; {11952#true} is VALID [2022-04-15 12:47:45,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {11952#true} call ULTIMATE.init(); {11981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:45,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {11981#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11952#true} is VALID [2022-04-15 12:47:45,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {11952#true} assume true; {11952#true} is VALID [2022-04-15 12:47:45,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11952#true} {11952#true} #40#return; {11952#true} is VALID [2022-04-15 12:47:45,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {11952#true} call #t~ret5 := main(); {11952#true} is VALID [2022-04-15 12:47:45,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {11952#true} ~x~0 := 0; {11957#(= main_~x~0 0)} is VALID [2022-04-15 12:47:45,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {11957#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11957#(= main_~x~0 0)} is VALID [2022-04-15 12:47:45,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {11957#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:45,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:45,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:45,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:45,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:45,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:45,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:45,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:45,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:45,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:45,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:45,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:45,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:45,911 INFO L290 TraceCheckUtils]: 20: Hoare triple {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:45,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:45,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:45,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:45,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:45,917 INFO L290 TraceCheckUtils]: 25: Hoare triple {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:45,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:45,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:45,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:45,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:45,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:45,924 INFO L290 TraceCheckUtils]: 31: Hoare triple {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:45,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:45,934 INFO L290 TraceCheckUtils]: 33: Hoare triple {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:45,934 INFO L290 TraceCheckUtils]: 34: Hoare triple {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:45,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:45,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:45,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:45,959 INFO L290 TraceCheckUtils]: 38: Hoare triple {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:45,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:45,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:45,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:45,964 INFO L290 TraceCheckUtils]: 42: Hoare triple {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:45,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:45,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:45,968 INFO L290 TraceCheckUtils]: 45: Hoare triple {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:45,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:45,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:45,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:45,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:45,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:45,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11980#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:45,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {11980#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {11980#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:45,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {11980#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11953#false} is VALID [2022-04-15 12:47:45,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {11953#false} assume !(~x~0 % 4294967296 < 100000000); {11953#false} is VALID [2022-04-15 12:47:45,975 INFO L272 TraceCheckUtils]: 55: Hoare triple {11953#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {11953#false} is VALID [2022-04-15 12:47:45,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {11953#false} ~cond := #in~cond; {11953#false} is VALID [2022-04-15 12:47:45,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {11953#false} assume 0 == ~cond; {11953#false} is VALID [2022-04-15 12:47:45,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {11953#false} assume !false; {11953#false} is VALID [2022-04-15 12:47:45,976 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:45,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517574904] [2022-04-15 12:47:45,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517574904] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:45,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198835712] [2022-04-15 12:47:45,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:47:45,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:45,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:45,978 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:45,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:47:46,033 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:47:46,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:46,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 12:47:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:46,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:46,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {11952#true} call ULTIMATE.init(); {11952#true} is VALID [2022-04-15 12:47:46,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {11952#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11952#true} is VALID [2022-04-15 12:47:46,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {11952#true} assume true; {11952#true} is VALID [2022-04-15 12:47:46,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11952#true} {11952#true} #40#return; {11952#true} is VALID [2022-04-15 12:47:46,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {11952#true} call #t~ret5 := main(); {11952#true} is VALID [2022-04-15 12:47:46,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {11952#true} ~x~0 := 0; {11957#(= main_~x~0 0)} is VALID [2022-04-15 12:47:46,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {11957#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {11957#(= main_~x~0 0)} is VALID [2022-04-15 12:47:46,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {11957#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:46,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:46,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {11958#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:46,339 INFO L290 TraceCheckUtils]: 10: Hoare triple {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:46,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {11959#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:46,343 INFO L290 TraceCheckUtils]: 12: Hoare triple {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:46,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {11960#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:46,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:46,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {11961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:46,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:46,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {11962#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:46,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:46,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {11963#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:46,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:46,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {11964#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:46,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:46,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {11965#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:46,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:46,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {11966#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:46,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:46,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {11967#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:46,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:46,364 INFO L290 TraceCheckUtils]: 29: Hoare triple {11968#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:46,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:46,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {11969#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:46,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:46,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {11970#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:46,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:46,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {11971#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:46,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:46,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {11972#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:46,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:46,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {11973#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:46,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:46,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {11974#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:46,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:46,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {11975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:46,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:46,380 INFO L290 TraceCheckUtils]: 45: Hoare triple {11976#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:46,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:46,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {11977#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:46,383 INFO L290 TraceCheckUtils]: 48: Hoare triple {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:46,385 INFO L290 TraceCheckUtils]: 49: Hoare triple {11978#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:46,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:46,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {11979#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12138#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:46,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {12138#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {12138#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:46,389 INFO L290 TraceCheckUtils]: 53: Hoare triple {12138#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11953#false} is VALID [2022-04-15 12:47:46,389 INFO L290 TraceCheckUtils]: 54: Hoare triple {11953#false} assume !(~x~0 % 4294967296 < 100000000); {11953#false} is VALID [2022-04-15 12:47:46,389 INFO L272 TraceCheckUtils]: 55: Hoare triple {11953#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {11953#false} is VALID [2022-04-15 12:47:46,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {11953#false} ~cond := #in~cond; {11953#false} is VALID [2022-04-15 12:47:46,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {11953#false} assume 0 == ~cond; {11953#false} is VALID [2022-04-15 12:47:46,390 INFO L290 TraceCheckUtils]: 58: Hoare triple {11953#false} assume !false; {11953#false} is VALID [2022-04-15 12:47:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:46,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:48,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {11953#false} assume !false; {11953#false} is VALID [2022-04-15 12:47:48,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {11953#false} assume 0 == ~cond; {11953#false} is VALID [2022-04-15 12:47:48,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {11953#false} ~cond := #in~cond; {11953#false} is VALID [2022-04-15 12:47:48,947 INFO L272 TraceCheckUtils]: 55: Hoare triple {11953#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {11953#false} is VALID [2022-04-15 12:47:48,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {11953#false} assume !(~x~0 % 4294967296 < 100000000); {11953#false} is VALID [2022-04-15 12:47:48,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {12175#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {11953#false} is VALID [2022-04-15 12:47:48,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {12179#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12175#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:47:48,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {12183#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12179#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {12183#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12183#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,954 INFO L290 TraceCheckUtils]: 49: Hoare triple {12190#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12183#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,954 INFO L290 TraceCheckUtils]: 48: Hoare triple {12190#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12190#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {12197#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12190#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {12197#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12197#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {12204#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12197#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {12204#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12204#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,962 INFO L290 TraceCheckUtils]: 43: Hoare triple {12211#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12204#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {12211#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12211#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,964 INFO L290 TraceCheckUtils]: 41: Hoare triple {12218#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12211#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,964 INFO L290 TraceCheckUtils]: 40: Hoare triple {12218#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12218#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,967 INFO L290 TraceCheckUtils]: 39: Hoare triple {12225#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12218#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,967 INFO L290 TraceCheckUtils]: 38: Hoare triple {12225#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12225#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {12232#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12225#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {12232#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12232#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,970 INFO L290 TraceCheckUtils]: 35: Hoare triple {12239#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12232#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,970 INFO L290 TraceCheckUtils]: 34: Hoare triple {12239#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12239#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {12246#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12239#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,971 INFO L290 TraceCheckUtils]: 32: Hoare triple {12246#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12246#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {12253#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12246#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {12253#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12253#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {12260#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12253#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {12260#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {12260#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {12267#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12260#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:47:48,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {12267#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12267#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {12274#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12267#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {12274#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12274#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {12281#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12274#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {12281#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12281#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {12288#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12281#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {12288#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12288#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {12295#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12288#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {12295#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12295#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {12302#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12295#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {12302#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12302#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {12309#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12302#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {12309#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12309#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {12316#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12309#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {12316#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12316#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {12323#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12316#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {12323#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12323#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {12330#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12323#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {12330#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12330#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {12337#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12330#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {12337#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {12337#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {11952#true} ~x~0 := 0; {12337#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:47:48,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {11952#true} call #t~ret5 := main(); {11952#true} is VALID [2022-04-15 12:47:48,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11952#true} {11952#true} #40#return; {11952#true} is VALID [2022-04-15 12:47:48,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {11952#true} assume true; {11952#true} is VALID [2022-04-15 12:47:48,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {11952#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {11952#true} is VALID [2022-04-15 12:47:48,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {11952#true} call ULTIMATE.init(); {11952#true} is VALID [2022-04-15 12:47:48,993 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:48,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198835712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:48,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:48,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 27] total 53 [2022-04-15 12:47:48,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:48,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955019000] [2022-04-15 12:47:48,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955019000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:48,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:48,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 12:47:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304596541] [2022-04-15 12:47:48,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:48,996 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:47:48,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:48,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:49,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:49,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 12:47:49,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:49,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 12:47:49,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 12:47:49,089 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:53,381 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2022-04-15 12:47:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:47:53,381 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-15 12:47:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:47:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:47:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 71 transitions. [2022-04-15 12:47:53,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 71 transitions. [2022-04-15 12:47:53,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:53,560 INFO L225 Difference]: With dead ends: 70 [2022-04-15 12:47:53,560 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:47:53,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 93 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1495, Invalid=4357, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:47:53,561 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:47:53,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 12:47:53,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:47:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 12:47:53,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:47:53,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,713 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,713 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:53,714 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:47:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:47:53,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:53,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:53,714 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 12:47:53,714 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 12:47:53,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:47:53,715 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-04-15 12:47:53,715 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:47:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:47:53,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:47:53,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:47:53,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:47:53,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-15 12:47:53,717 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 59 [2022-04-15 12:47:53,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:47:53,717 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-15 12:47:53,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.037037037037037) internal successors, (55), 26 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:53,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-15 12:47:53,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:53,899 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 12:47:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 12:47:53,899 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:47:53,899 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:47:53,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 12:47:54,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,SelfDestructingSolverStorable48,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:54,100 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:47:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:47:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 47 times [2022-04-15 12:47:54,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:54,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [364019382] [2022-04-15 12:47:54,326 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:47:54,328 INFO L85 PathProgramCache]: Analyzing trace with hash 115352753, now seen corresponding path program 1 times [2022-04-15 12:47:54,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:54,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892152520] [2022-04-15 12:47:54,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:54,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:54,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:47:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:47:54,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:47:54,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1977916213, now seen corresponding path program 48 times [2022-04-15 12:47:54,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:47:54,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085917695] [2022-04-15 12:47:54,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:47:54,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:47:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:54,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:47:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:54,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {12831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 12:47:54,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 12:47:54,904 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12801#true} {12801#true} #40#return; {12801#true} is VALID [2022-04-15 12:47:54,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {12801#true} call ULTIMATE.init(); {12831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:47:54,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {12831#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 12:47:54,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 12:47:54,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12801#true} {12801#true} #40#return; {12801#true} is VALID [2022-04-15 12:47:54,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {12801#true} call #t~ret5 := main(); {12801#true} is VALID [2022-04-15 12:47:54,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {12801#true} ~x~0 := 0; {12806#(= main_~x~0 0)} is VALID [2022-04-15 12:47:54,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {12806#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {12806#(= main_~x~0 0)} is VALID [2022-04-15 12:47:54,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {12806#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12807#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:54,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {12807#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {12807#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:47:54,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {12807#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12808#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:54,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {12808#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {12808#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:47:54,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {12808#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12809#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:54,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {12809#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12809#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:47:54,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {12809#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12810#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:54,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {12810#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12810#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:47:54,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {12810#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12811#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:54,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {12811#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {12811#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:47:54,925 INFO L290 TraceCheckUtils]: 17: Hoare triple {12811#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12812#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:54,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {12812#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {12812#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:47:54,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {12812#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12813#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:54,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {12813#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12813#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:47:54,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {12813#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:54,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {12814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:47:54,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {12814#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12815#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:54,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {12815#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12815#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:47:54,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {12815#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12816#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:54,937 INFO L290 TraceCheckUtils]: 26: Hoare triple {12816#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12816#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:47:54,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {12816#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12817#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:54,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {12817#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12817#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:47:54,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {12817#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12818#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:54,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {12818#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12818#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:47:54,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {12818#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12819#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:54,946 INFO L290 TraceCheckUtils]: 32: Hoare triple {12819#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12819#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:47:54,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {12819#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12820#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:54,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {12820#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {12820#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:47:54,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {12820#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12821#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:54,952 INFO L290 TraceCheckUtils]: 36: Hoare triple {12821#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {12821#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:47:54,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {12821#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:54,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {12822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:47:54,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {12822#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12823#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:54,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {12823#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {12823#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:47:54,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {12823#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12824#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:54,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {12824#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12824#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:47:54,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {12824#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12825#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:54,964 INFO L290 TraceCheckUtils]: 44: Hoare triple {12825#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {12825#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:47:54,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {12825#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12826#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:54,967 INFO L290 TraceCheckUtils]: 46: Hoare triple {12826#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {12826#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:47:54,970 INFO L290 TraceCheckUtils]: 47: Hoare triple {12826#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12827#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:54,971 INFO L290 TraceCheckUtils]: 48: Hoare triple {12827#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {12827#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:47:54,975 INFO L290 TraceCheckUtils]: 49: Hoare triple {12827#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12828#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:54,975 INFO L290 TraceCheckUtils]: 50: Hoare triple {12828#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {12828#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:47:54,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {12828#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12829#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:54,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {12829#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {12829#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:47:54,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {12829#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12830#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:54,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {12830#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {12830#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:47:54,981 INFO L290 TraceCheckUtils]: 55: Hoare triple {12830#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {12802#false} is VALID [2022-04-15 12:47:54,982 INFO L290 TraceCheckUtils]: 56: Hoare triple {12802#false} assume !(~x~0 % 4294967296 < 100000000); {12802#false} is VALID [2022-04-15 12:47:54,982 INFO L272 TraceCheckUtils]: 57: Hoare triple {12802#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {12802#false} is VALID [2022-04-15 12:47:54,982 INFO L290 TraceCheckUtils]: 58: Hoare triple {12802#false} ~cond := #in~cond; {12802#false} is VALID [2022-04-15 12:47:54,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {12802#false} assume 0 == ~cond; {12802#false} is VALID [2022-04-15 12:47:54,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {12802#false} assume !false; {12802#false} is VALID [2022-04-15 12:47:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:47:54,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:47:54,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085917695] [2022-04-15 12:47:54,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085917695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:47:54,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295144215] [2022-04-15 12:47:54,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:47:54,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:47:54,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:47:54,984 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:47:54,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:47:55,032 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:47:55,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:47:55,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:47:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:47:55,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:47:55,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {12801#true} call ULTIMATE.init(); {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12801#true} {12801#true} #40#return; {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {12801#true} call #t~ret5 := main(); {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {12801#true} ~x~0 := 0; {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 28: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:55,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:55,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12994#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:55,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {12994#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {12994#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:47:55,300 INFO L290 TraceCheckUtils]: 55: Hoare triple {12994#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13001#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:47:55,302 INFO L290 TraceCheckUtils]: 56: Hoare triple {13001#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {12802#false} is VALID [2022-04-15 12:47:55,303 INFO L272 TraceCheckUtils]: 57: Hoare triple {12802#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {12802#false} is VALID [2022-04-15 12:47:55,303 INFO L290 TraceCheckUtils]: 58: Hoare triple {12802#false} ~cond := #in~cond; {12802#false} is VALID [2022-04-15 12:47:55,303 INFO L290 TraceCheckUtils]: 59: Hoare triple {12802#false} assume 0 == ~cond; {12802#false} is VALID [2022-04-15 12:47:55,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {12802#false} assume !false; {12802#false} is VALID [2022-04-15 12:47:55,303 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-04-15 12:47:55,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:47:56,387 INFO L290 TraceCheckUtils]: 60: Hoare triple {12802#false} assume !false; {12802#false} is VALID [2022-04-15 12:47:56,387 INFO L290 TraceCheckUtils]: 59: Hoare triple {13020#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12802#false} is VALID [2022-04-15 12:47:56,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {13024#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13020#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:47:56,388 INFO L272 TraceCheckUtils]: 57: Hoare triple {13028#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {13024#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:47:56,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {13032#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {13028#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:47:56,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {13036#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13032#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:47:56,391 INFO L290 TraceCheckUtils]: 54: Hoare triple {13040#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {13036#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13040#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 50: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 49: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 48: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 47: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 46: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 45: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 44: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 43: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,394 INFO L290 TraceCheckUtils]: 42: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 40: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 11: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 10: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {12801#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {12801#true} assume !!(~x~0 % 4294967296 < 100000000); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {12801#true} ~x~0 := 0; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {12801#true} call #t~ret5 := main(); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12801#true} {12801#true} #40#return; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 12:47:56,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {12801#true} call ULTIMATE.init(); {12801#true} is VALID [2022-04-15 12:47:56,398 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 72 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-04-15 12:47:56,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295144215] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:47:56,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:47:56,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 4, 8] total 36 [2022-04-15 12:47:56,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:47:56,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [364019382] [2022-04-15 12:47:56,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [364019382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:47:56,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:47:56,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:47:56,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058107421] [2022-04-15 12:47:56,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:47:56,399 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:47:56,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:47:56,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:47:56,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:47:56,507 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:47:56,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:47:56,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:47:56,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 12:47:56,508 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:08,386 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2022-04-15 12:48:08,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 12:48:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-15 12:48:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:48:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 73 transitions. [2022-04-15 12:48:08,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 73 transitions. [2022-04-15 12:48:08,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:08,755 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:48:08,755 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 12:48:08,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=446, Invalid=3214, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:48:08,756 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:08,756 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 54 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 12:48:08,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 12:48:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 12:48:08,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:08,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,891 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,892 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:08,892 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:48:08,892 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:48:08,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:08,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:08,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:48:08,893 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 12:48:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:08,893 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2022-04-15 12:48:08,893 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:48:08,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:08,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:08,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:08,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.05) internal successors, (63), 60 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-15 12:48:08,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 61 [2022-04-15 12:48:08,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:08,895 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-15 12:48:08,897 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:08,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-15 12:48:09,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:09,165 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 12:48:09,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 12:48:09,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:09,165 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:09,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:09,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 12:48:09,382 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:09,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:09,382 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 49 times [2022-04-15 12:48:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:09,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173295531] [2022-04-15 12:48:09,547 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:09,549 INFO L85 PathProgramCache]: Analyzing trace with hash 174458097, now seen corresponding path program 1 times [2022-04-15 12:48:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:09,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470629078] [2022-04-15 12:48:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:09,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:09,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:09,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:09,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash 48905618, now seen corresponding path program 50 times [2022-04-15 12:48:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:09,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180608585] [2022-04-15 12:48:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:10,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:10,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {13690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13659#true} is VALID [2022-04-15 12:48:10,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {13659#true} assume true; {13659#true} is VALID [2022-04-15 12:48:10,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13659#true} {13659#true} #40#return; {13659#true} is VALID [2022-04-15 12:48:10,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {13659#true} call ULTIMATE.init(); {13690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:10,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {13690#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13659#true} is VALID [2022-04-15 12:48:10,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {13659#true} assume true; {13659#true} is VALID [2022-04-15 12:48:10,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13659#true} {13659#true} #40#return; {13659#true} is VALID [2022-04-15 12:48:10,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {13659#true} call #t~ret5 := main(); {13659#true} is VALID [2022-04-15 12:48:10,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {13659#true} ~x~0 := 0; {13664#(= main_~x~0 0)} is VALID [2022-04-15 12:48:10,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {13664#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {13664#(= main_~x~0 0)} is VALID [2022-04-15 12:48:10,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {13664#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:10,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:10,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:10,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:10,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:10,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:10,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:10,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:10,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:10,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:10,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:10,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:10,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:10,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:10,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:10,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:10,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:10,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:10,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:10,168 INFO L290 TraceCheckUtils]: 26: Hoare triple {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:10,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:10,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:10,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:10,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:10,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:10,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:10,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:10,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:10,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:10,203 INFO L290 TraceCheckUtils]: 36: Hoare triple {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:10,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:10,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:10,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:10,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:10,228 INFO L290 TraceCheckUtils]: 41: Hoare triple {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:10,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:10,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:10,235 INFO L290 TraceCheckUtils]: 44: Hoare triple {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:10,241 INFO L290 TraceCheckUtils]: 45: Hoare triple {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:10,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:10,251 INFO L290 TraceCheckUtils]: 47: Hoare triple {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:10,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:10,259 INFO L290 TraceCheckUtils]: 49: Hoare triple {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:10,259 INFO L290 TraceCheckUtils]: 50: Hoare triple {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:10,268 INFO L290 TraceCheckUtils]: 51: Hoare triple {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:10,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:10,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:10,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:10,279 INFO L290 TraceCheckUtils]: 55: Hoare triple {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13689#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:48:10,280 INFO L290 TraceCheckUtils]: 56: Hoare triple {13689#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !!(~x~0 % 4294967296 < 100000000); {13689#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} is VALID [2022-04-15 12:48:10,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {13689#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 25))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13660#false} is VALID [2022-04-15 12:48:10,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {13660#false} assume !(~x~0 % 4294967296 < 100000000); {13660#false} is VALID [2022-04-15 12:48:10,281 INFO L272 TraceCheckUtils]: 59: Hoare triple {13660#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {13660#false} is VALID [2022-04-15 12:48:10,281 INFO L290 TraceCheckUtils]: 60: Hoare triple {13660#false} ~cond := #in~cond; {13660#false} is VALID [2022-04-15 12:48:10,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {13660#false} assume 0 == ~cond; {13660#false} is VALID [2022-04-15 12:48:10,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {13660#false} assume !false; {13660#false} is VALID [2022-04-15 12:48:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:10,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180608585] [2022-04-15 12:48:10,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180608585] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924936674] [2022-04-15 12:48:10,282 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:48:10,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:10,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:10,283 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:10,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:48:10,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:48:10,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:10,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-15 12:48:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:10,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:10,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {13659#true} call ULTIMATE.init(); {13659#true} is VALID [2022-04-15 12:48:10,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {13659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13659#true} is VALID [2022-04-15 12:48:10,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {13659#true} assume true; {13659#true} is VALID [2022-04-15 12:48:10,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13659#true} {13659#true} #40#return; {13659#true} is VALID [2022-04-15 12:48:10,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {13659#true} call #t~ret5 := main(); {13659#true} is VALID [2022-04-15 12:48:10,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {13659#true} ~x~0 := 0; {13664#(= main_~x~0 0)} is VALID [2022-04-15 12:48:10,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {13664#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {13664#(= main_~x~0 0)} is VALID [2022-04-15 12:48:10,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {13664#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:10,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:10,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {13665#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:10,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:10,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {13666#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:10,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:10,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {13667#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:10,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:10,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {13668#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:10,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:10,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {13669#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:10,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:10,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {13670#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:10,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:10,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {13671#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:10,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:10,912 INFO L290 TraceCheckUtils]: 23: Hoare triple {13672#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:10,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:10,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {13673#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:10,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:10,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {13674#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:10,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:10,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {13675#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:10,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:10,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {13676#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:10,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:10,960 INFO L290 TraceCheckUtils]: 33: Hoare triple {13677#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:10,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:10,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {13678#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:10,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:10,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {13679#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:10,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:10,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {13680#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:10,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:10,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {13681#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:10,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:10,998 INFO L290 TraceCheckUtils]: 43: Hoare triple {13682#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:10,998 INFO L290 TraceCheckUtils]: 44: Hoare triple {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:11,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {13683#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:11,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:11,010 INFO L290 TraceCheckUtils]: 47: Hoare triple {13684#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:11,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:11,018 INFO L290 TraceCheckUtils]: 49: Hoare triple {13685#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:11,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:11,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {13686#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:11,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:11,031 INFO L290 TraceCheckUtils]: 53: Hoare triple {13687#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:11,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:11,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {13688#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13859#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:11,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {13859#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {13859#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:11,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {13859#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13866#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:11,047 INFO L290 TraceCheckUtils]: 58: Hoare triple {13866#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 100000000); {13660#false} is VALID [2022-04-15 12:48:11,047 INFO L272 TraceCheckUtils]: 59: Hoare triple {13660#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {13660#false} is VALID [2022-04-15 12:48:11,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {13660#false} ~cond := #in~cond; {13660#false} is VALID [2022-04-15 12:48:11,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {13660#false} assume 0 == ~cond; {13660#false} is VALID [2022-04-15 12:48:11,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {13660#false} assume !false; {13660#false} is VALID [2022-04-15 12:48:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:11,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:14,515 INFO L290 TraceCheckUtils]: 62: Hoare triple {13660#false} assume !false; {13660#false} is VALID [2022-04-15 12:48:14,516 INFO L290 TraceCheckUtils]: 61: Hoare triple {13660#false} assume 0 == ~cond; {13660#false} is VALID [2022-04-15 12:48:14,516 INFO L290 TraceCheckUtils]: 60: Hoare triple {13660#false} ~cond := #in~cond; {13660#false} is VALID [2022-04-15 12:48:14,516 INFO L272 TraceCheckUtils]: 59: Hoare triple {13660#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {13660#false} is VALID [2022-04-15 12:48:14,516 INFO L290 TraceCheckUtils]: 58: Hoare triple {13894#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {13660#false} is VALID [2022-04-15 12:48:14,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {13898#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {13894#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {13898#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13898#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,521 INFO L290 TraceCheckUtils]: 55: Hoare triple {13905#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13898#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {13905#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13905#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {13912#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13905#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,523 INFO L290 TraceCheckUtils]: 52: Hoare triple {13912#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13912#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,525 INFO L290 TraceCheckUtils]: 51: Hoare triple {13919#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13912#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {13919#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13919#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,527 INFO L290 TraceCheckUtils]: 49: Hoare triple {13926#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13919#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,527 INFO L290 TraceCheckUtils]: 48: Hoare triple {13926#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13926#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {13933#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13926#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {13933#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13933#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,530 INFO L290 TraceCheckUtils]: 45: Hoare triple {13940#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13933#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {13940#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13940#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {13947#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13940#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {13947#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13947#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,533 INFO L290 TraceCheckUtils]: 41: Hoare triple {13954#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13947#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,534 INFO L290 TraceCheckUtils]: 40: Hoare triple {13954#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13954#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {13961#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13954#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {13961#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13961#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {13968#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13961#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,537 INFO L290 TraceCheckUtils]: 36: Hoare triple {13968#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13968#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,538 INFO L290 TraceCheckUtils]: 35: Hoare triple {13975#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13968#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {13975#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13975#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {13982#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13975#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,540 INFO L290 TraceCheckUtils]: 32: Hoare triple {13982#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13982#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {13989#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13982#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,542 INFO L290 TraceCheckUtils]: 30: Hoare triple {13989#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13989#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {13996#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13989#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {13996#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {13996#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {14003#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {13996#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {14003#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14003#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,547 INFO L290 TraceCheckUtils]: 25: Hoare triple {14010#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14003#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,547 INFO L290 TraceCheckUtils]: 24: Hoare triple {14010#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14010#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {14017#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14010#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {14017#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14017#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {14024#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14017#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {14024#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14024#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {14031#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14024#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {14031#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14031#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {14038#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14031#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {14038#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14038#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {14045#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14038#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {14045#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14045#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {14052#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14045#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {14052#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14052#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {14059#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14052#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {14059#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14059#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {14066#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14059#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {14066#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14066#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {14073#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14066#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {14073#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14073#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {13659#true} ~x~0 := 0; {14073#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:48:14,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {13659#true} call #t~ret5 := main(); {13659#true} is VALID [2022-04-15 12:48:14,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13659#true} {13659#true} #40#return; {13659#true} is VALID [2022-04-15 12:48:14,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {13659#true} assume true; {13659#true} is VALID [2022-04-15 12:48:14,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {13659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {13659#true} is VALID [2022-04-15 12:48:14,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {13659#true} call ULTIMATE.init(); {13659#true} is VALID [2022-04-15 12:48:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:14,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924936674] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:14,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:14,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2022-04-15 12:48:14,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:14,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173295531] [2022-04-15 12:48:14,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173295531] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:14,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:14,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 12:48:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752329274] [2022-04-15 12:48:14,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:14,563 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:48:14,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:14,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:14,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:14,712 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 12:48:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:14,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 12:48:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=895, Invalid=2411, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 12:48:14,713 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:21,980 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2022-04-15 12:48:21,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:48:21,980 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-15 12:48:21,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:48:21,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2022-04-15 12:48:21,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 75 transitions. [2022-04-15 12:48:22,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:22,505 INFO L225 Difference]: With dead ends: 74 [2022-04-15 12:48:22,505 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:48:22,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1751, Invalid=5221, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 12:48:22,506 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:22,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 134 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 12:48:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:48:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 12:48:22,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:22,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:22,629 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:22,629 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:22,655 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:48:22,656 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:48:22,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:22,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:22,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 12:48:22,656 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 12:48:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:22,657 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2022-04-15 12:48:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:48:22,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:22,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:22,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:22,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:22,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-15 12:48:22,658 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 63 [2022-04-15 12:48:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:22,658 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-15 12:48:22,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:22,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-15 12:48:23,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:23,033 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 12:48:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 12:48:23,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:23,034 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:23,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:23,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51,SelfDestructingSolverStorable52 [2022-04-15 12:48:23,234 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 51 times [2022-04-15 12:48:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:23,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [261982328] [2022-04-15 12:48:23,346 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:23,347 INFO L85 PathProgramCache]: Analyzing trace with hash 233563441, now seen corresponding path program 1 times [2022-04-15 12:48:23,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:23,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046885644] [2022-04-15 12:48:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:23,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:23,366 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:23,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1695595695, now seen corresponding path program 52 times [2022-04-15 12:48:23,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:23,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802389671] [2022-04-15 12:48:23,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:23,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:23,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {14597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14565#true} is VALID [2022-04-15 12:48:23,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {14565#true} assume true; {14565#true} is VALID [2022-04-15 12:48:23,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14565#true} {14565#true} #40#return; {14565#true} is VALID [2022-04-15 12:48:23,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {14565#true} call ULTIMATE.init(); {14597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:23,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {14597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14565#true} is VALID [2022-04-15 12:48:23,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {14565#true} assume true; {14565#true} is VALID [2022-04-15 12:48:23,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14565#true} {14565#true} #40#return; {14565#true} is VALID [2022-04-15 12:48:23,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {14565#true} call #t~ret5 := main(); {14565#true} is VALID [2022-04-15 12:48:23,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {14565#true} ~x~0 := 0; {14570#(= main_~x~0 0)} is VALID [2022-04-15 12:48:23,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {14570#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {14570#(= main_~x~0 0)} is VALID [2022-04-15 12:48:23,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {14570#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:23,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:23,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:23,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:23,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:23,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:23,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:23,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:23,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:23,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:23,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:23,992 INFO L290 TraceCheckUtils]: 18: Hoare triple {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:24,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:24,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:24,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:24,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:24,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:24,037 INFO L290 TraceCheckUtils]: 24: Hoare triple {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:24,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:24,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:24,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:24,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:24,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:24,097 INFO L290 TraceCheckUtils]: 30: Hoare triple {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:24,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:24,107 INFO L290 TraceCheckUtils]: 32: Hoare triple {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:24,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:24,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:24,122 INFO L290 TraceCheckUtils]: 35: Hoare triple {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:24,123 INFO L290 TraceCheckUtils]: 36: Hoare triple {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:24,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:24,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:24,141 INFO L290 TraceCheckUtils]: 39: Hoare triple {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:24,141 INFO L290 TraceCheckUtils]: 40: Hoare triple {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:24,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:24,151 INFO L290 TraceCheckUtils]: 42: Hoare triple {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:24,157 INFO L290 TraceCheckUtils]: 43: Hoare triple {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:24,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:24,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:24,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:24,176 INFO L290 TraceCheckUtils]: 47: Hoare triple {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:24,176 INFO L290 TraceCheckUtils]: 48: Hoare triple {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:24,186 INFO L290 TraceCheckUtils]: 49: Hoare triple {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:24,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:24,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:24,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:24,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:24,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:24,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:24,216 INFO L290 TraceCheckUtils]: 56: Hoare triple {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:24,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14596#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:48:24,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {14596#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !!(~x~0 % 4294967296 < 100000000); {14596#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-15 12:48:24,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {14596#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {14566#false} is VALID [2022-04-15 12:48:24,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {14566#false} assume !(~x~0 % 4294967296 < 100000000); {14566#false} is VALID [2022-04-15 12:48:24,218 INFO L272 TraceCheckUtils]: 61: Hoare triple {14566#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {14566#false} is VALID [2022-04-15 12:48:24,218 INFO L290 TraceCheckUtils]: 62: Hoare triple {14566#false} ~cond := #in~cond; {14566#false} is VALID [2022-04-15 12:48:24,218 INFO L290 TraceCheckUtils]: 63: Hoare triple {14566#false} assume 0 == ~cond; {14566#false} is VALID [2022-04-15 12:48:24,218 INFO L290 TraceCheckUtils]: 64: Hoare triple {14566#false} assume !false; {14566#false} is VALID [2022-04-15 12:48:24,219 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 27 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:24,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:24,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802389671] [2022-04-15 12:48:24,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802389671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:24,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292027694] [2022-04-15 12:48:24,219 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:48:24,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:24,220 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:24,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 12:48:24,322 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:48:24,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:24,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 12:48:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:24,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:24,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {14565#true} call ULTIMATE.init(); {14565#true} is VALID [2022-04-15 12:48:24,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {14565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14565#true} is VALID [2022-04-15 12:48:24,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {14565#true} assume true; {14565#true} is VALID [2022-04-15 12:48:24,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14565#true} {14565#true} #40#return; {14565#true} is VALID [2022-04-15 12:48:24,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {14565#true} call #t~ret5 := main(); {14565#true} is VALID [2022-04-15 12:48:24,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {14565#true} ~x~0 := 0; {14570#(= main_~x~0 0)} is VALID [2022-04-15 12:48:24,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {14570#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {14570#(= main_~x~0 0)} is VALID [2022-04-15 12:48:24,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {14570#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:24,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:24,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {14571#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:24,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:24,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {14572#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:24,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:24,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {14573#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:24,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:24,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {14574#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:24,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:24,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {14575#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:24,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:24,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {14576#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:24,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:24,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {14577#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:24,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:25,007 INFO L290 TraceCheckUtils]: 23: Hoare triple {14578#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:25,008 INFO L290 TraceCheckUtils]: 24: Hoare triple {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:25,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {14579#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:25,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:25,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {14580#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:25,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:25,037 INFO L290 TraceCheckUtils]: 29: Hoare triple {14581#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:25,037 INFO L290 TraceCheckUtils]: 30: Hoare triple {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:25,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {14582#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:25,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:25,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {14583#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:25,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:25,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {14584#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:25,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:25,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {14585#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:25,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:25,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {14586#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:25,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:25,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {14587#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:25,099 INFO L290 TraceCheckUtils]: 42: Hoare triple {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:25,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {14588#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:25,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:25,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {14589#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:25,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:25,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {14590#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:25,130 INFO L290 TraceCheckUtils]: 48: Hoare triple {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:25,143 INFO L290 TraceCheckUtils]: 49: Hoare triple {14591#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:25,144 INFO L290 TraceCheckUtils]: 50: Hoare triple {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:25,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {14592#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:25,156 INFO L290 TraceCheckUtils]: 52: Hoare triple {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:25,167 INFO L290 TraceCheckUtils]: 53: Hoare triple {14593#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:25,168 INFO L290 TraceCheckUtils]: 54: Hoare triple {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:25,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {14594#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:25,178 INFO L290 TraceCheckUtils]: 56: Hoare triple {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:25,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {14595#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14772#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:25,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {14772#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {14772#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:25,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {14772#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {14779#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:48:25,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {14779#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 100000000); {14566#false} is VALID [2022-04-15 12:48:25,202 INFO L272 TraceCheckUtils]: 61: Hoare triple {14566#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {14566#false} is VALID [2022-04-15 12:48:25,202 INFO L290 TraceCheckUtils]: 62: Hoare triple {14566#false} ~cond := #in~cond; {14566#false} is VALID [2022-04-15 12:48:25,202 INFO L290 TraceCheckUtils]: 63: Hoare triple {14566#false} assume 0 == ~cond; {14566#false} is VALID [2022-04-15 12:48:25,202 INFO L290 TraceCheckUtils]: 64: Hoare triple {14566#false} assume !false; {14566#false} is VALID [2022-04-15 12:48:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:25,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:29,222 INFO L290 TraceCheckUtils]: 64: Hoare triple {14566#false} assume !false; {14566#false} is VALID [2022-04-15 12:48:29,222 INFO L290 TraceCheckUtils]: 63: Hoare triple {14566#false} assume 0 == ~cond; {14566#false} is VALID [2022-04-15 12:48:29,222 INFO L290 TraceCheckUtils]: 62: Hoare triple {14566#false} ~cond := #in~cond; {14566#false} is VALID [2022-04-15 12:48:29,222 INFO L272 TraceCheckUtils]: 61: Hoare triple {14566#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {14566#false} is VALID [2022-04-15 12:48:29,223 INFO L290 TraceCheckUtils]: 60: Hoare triple {14807#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {14566#false} is VALID [2022-04-15 12:48:29,225 INFO L290 TraceCheckUtils]: 59: Hoare triple {14811#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {14807#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,226 INFO L290 TraceCheckUtils]: 58: Hoare triple {14811#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14811#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {14818#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14811#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {14818#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14818#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {14825#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14818#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,232 INFO L290 TraceCheckUtils]: 54: Hoare triple {14825#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14825#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,235 INFO L290 TraceCheckUtils]: 53: Hoare triple {14832#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14825#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,235 INFO L290 TraceCheckUtils]: 52: Hoare triple {14832#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14832#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {14839#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14832#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {14839#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14839#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,239 INFO L290 TraceCheckUtils]: 49: Hoare triple {14846#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14839#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,240 INFO L290 TraceCheckUtils]: 48: Hoare triple {14846#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14846#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,242 INFO L290 TraceCheckUtils]: 47: Hoare triple {14853#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14846#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,242 INFO L290 TraceCheckUtils]: 46: Hoare triple {14853#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14853#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,243 INFO L290 TraceCheckUtils]: 45: Hoare triple {14860#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14853#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {14860#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14860#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {14867#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14860#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {14867#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14867#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {14874#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14867#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,250 INFO L290 TraceCheckUtils]: 40: Hoare triple {14874#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14874#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,251 INFO L290 TraceCheckUtils]: 39: Hoare triple {14881#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14874#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {14881#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14881#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {14888#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14881#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {14888#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14888#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {14895#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14888#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {14895#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14895#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {14902#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14895#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {14902#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14902#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {14909#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14902#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {14909#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14909#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {14916#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14909#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {14916#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14916#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {14923#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14916#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {14923#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14923#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {14930#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14923#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {14930#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14930#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,270 INFO L290 TraceCheckUtils]: 23: Hoare triple {14937#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14930#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,270 INFO L290 TraceCheckUtils]: 22: Hoare triple {14937#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14937#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {14944#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14937#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {14944#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14944#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {14951#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14944#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {14951#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14951#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {14958#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14951#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {14958#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14958#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {14965#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14958#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {14965#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14965#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {14972#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14965#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {14972#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14972#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {14979#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14972#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {14979#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14979#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {14986#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14979#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {14986#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14986#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {14993#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {14986#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {14993#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {14993#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {14565#true} ~x~0 := 0; {14993#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:48:29,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {14565#true} call #t~ret5 := main(); {14565#true} is VALID [2022-04-15 12:48:29,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14565#true} {14565#true} #40#return; {14565#true} is VALID [2022-04-15 12:48:29,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {14565#true} assume true; {14565#true} is VALID [2022-04-15 12:48:29,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {14565#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {14565#true} is VALID [2022-04-15 12:48:29,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {14565#true} call ULTIMATE.init(); {14565#true} is VALID [2022-04-15 12:48:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292027694] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:29,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2022-04-15 12:48:29,288 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:29,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [261982328] [2022-04-15 12:48:29,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [261982328] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:29,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:29,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:48:29,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003331954] [2022-04-15 12:48:29,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:29,289 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:48:29,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:29,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:29,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:29,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:48:29,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:29,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:48:29,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=956, Invalid=2584, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 12:48:29,470 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,178 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2022-04-15 12:48:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 12:48:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-15 12:48:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:48:39,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 77 transitions. [2022-04-15 12:48:39,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 77 transitions. [2022-04-15 12:48:39,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:39,566 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:48:39,566 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 12:48:39,567 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1872, Invalid=5610, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:48:39,567 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:39,567 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 49 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 12:48:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 12:48:39,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-15 12:48:39,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:39,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,744 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,744 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,745 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:48:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:48:39,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:39,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:39,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 12:48:39,746 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 12:48:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:39,747 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2022-04-15 12:48:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:48:39,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:39,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:39,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:39,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:39,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.046875) internal successors, (67), 64 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-15 12:48:39,753 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 65 [2022-04-15 12:48:39,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:39,754 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-15 12:48:39,754 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:39,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-15 12:48:40,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 12:48:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 12:48:40,215 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:40,215 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:40,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 12:48:40,416 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53,SelfDestructingSolverStorable54 [2022-04-15 12:48:40,416 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 53 times [2022-04-15 12:48:40,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:40,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1198592398] [2022-04-15 12:48:40,587 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:40,588 INFO L85 PathProgramCache]: Analyzing trace with hash 292668785, now seen corresponding path program 1 times [2022-04-15 12:48:40,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:40,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314506490] [2022-04-15 12:48:40,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:40,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:40,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:40,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:40,599 INFO L85 PathProgramCache]: Analyzing trace with hash -678172532, now seen corresponding path program 54 times [2022-04-15 12:48:40,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:40,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829776026] [2022-04-15 12:48:40,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:40,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:41,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:41,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:41,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {15532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15499#true} is VALID [2022-04-15 12:48:41,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {15499#true} assume true; {15499#true} is VALID [2022-04-15 12:48:41,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15499#true} {15499#true} #40#return; {15499#true} is VALID [2022-04-15 12:48:41,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {15499#true} call ULTIMATE.init(); {15532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:41,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {15532#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15499#true} is VALID [2022-04-15 12:48:41,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {15499#true} assume true; {15499#true} is VALID [2022-04-15 12:48:41,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15499#true} {15499#true} #40#return; {15499#true} is VALID [2022-04-15 12:48:41,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {15499#true} call #t~ret5 := main(); {15499#true} is VALID [2022-04-15 12:48:41,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {15499#true} ~x~0 := 0; {15504#(= main_~x~0 0)} is VALID [2022-04-15 12:48:41,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {15504#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {15504#(= main_~x~0 0)} is VALID [2022-04-15 12:48:41,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {15504#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:41,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {15505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {15505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:41,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {15505#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:41,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {15506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {15506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:41,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {15506#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:41,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {15507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:41,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {15507#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:41,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {15508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:41,328 INFO L290 TraceCheckUtils]: 15: Hoare triple {15508#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:41,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {15509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {15509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:41,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {15509#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:41,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {15510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {15510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:41,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {15510#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:41,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {15511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:41,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {15511#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:41,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {15512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:41,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {15512#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:41,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {15513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:41,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {15513#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:41,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {15514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:41,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {15514#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:41,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {15515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:41,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {15515#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15516#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:41,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {15516#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15516#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:41,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {15516#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15517#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:41,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {15517#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15517#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:41,413 INFO L290 TraceCheckUtils]: 33: Hoare triple {15517#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15518#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:41,413 INFO L290 TraceCheckUtils]: 34: Hoare triple {15518#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {15518#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:41,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {15518#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15519#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:41,420 INFO L290 TraceCheckUtils]: 36: Hoare triple {15519#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {15519#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:41,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {15519#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:41,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {15520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:41,439 INFO L290 TraceCheckUtils]: 39: Hoare triple {15520#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15521#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:41,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {15521#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {15521#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:41,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {15521#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15522#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:41,454 INFO L290 TraceCheckUtils]: 42: Hoare triple {15522#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15522#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:41,460 INFO L290 TraceCheckUtils]: 43: Hoare triple {15522#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15523#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:41,461 INFO L290 TraceCheckUtils]: 44: Hoare triple {15523#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {15523#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:41,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {15523#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15524#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:41,470 INFO L290 TraceCheckUtils]: 46: Hoare triple {15524#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15524#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:41,479 INFO L290 TraceCheckUtils]: 47: Hoare triple {15524#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15525#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:41,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {15525#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {15525#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:41,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {15525#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15526#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:41,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {15526#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {15526#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:41,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {15526#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15527#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:41,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {15527#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {15527#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:41,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {15527#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15528#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:41,511 INFO L290 TraceCheckUtils]: 54: Hoare triple {15528#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15528#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:41,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {15528#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15529#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:41,521 INFO L290 TraceCheckUtils]: 56: Hoare triple {15529#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15529#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:41,529 INFO L290 TraceCheckUtils]: 57: Hoare triple {15529#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15530#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:41,530 INFO L290 TraceCheckUtils]: 58: Hoare triple {15530#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {15530#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:41,533 INFO L290 TraceCheckUtils]: 59: Hoare triple {15530#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:41,533 INFO L290 TraceCheckUtils]: 60: Hoare triple {15531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {15531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:41,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {15531#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 27))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {15500#false} is VALID [2022-04-15 12:48:41,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {15500#false} assume !(~x~0 % 4294967296 < 100000000); {15500#false} is VALID [2022-04-15 12:48:41,534 INFO L272 TraceCheckUtils]: 63: Hoare triple {15500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {15500#false} is VALID [2022-04-15 12:48:41,534 INFO L290 TraceCheckUtils]: 64: Hoare triple {15500#false} ~cond := #in~cond; {15500#false} is VALID [2022-04-15 12:48:41,535 INFO L290 TraceCheckUtils]: 65: Hoare triple {15500#false} assume 0 == ~cond; {15500#false} is VALID [2022-04-15 12:48:41,535 INFO L290 TraceCheckUtils]: 66: Hoare triple {15500#false} assume !false; {15500#false} is VALID [2022-04-15 12:48:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:41,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:41,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829776026] [2022-04-15 12:48:41,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829776026] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:41,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308167729] [2022-04-15 12:48:41,536 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:48:41,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:41,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:41,538 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:41,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 12:48:41,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:48:41,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:41,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:48:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:41,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:42,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {15499#true} call ULTIMATE.init(); {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {15499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {15499#true} assume true; {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15499#true} {15499#true} #40#return; {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {15499#true} call #t~ret5 := main(); {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {15499#true} ~x~0 := 0; {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 33: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 34: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 35: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 36: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 46: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 51: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 55: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 56: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:42,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:42,073 INFO L290 TraceCheckUtils]: 59: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15713#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:48:42,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {15713#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {15713#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:48:42,076 INFO L290 TraceCheckUtils]: 61: Hoare triple {15713#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {15720#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:48:42,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {15720#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {15500#false} is VALID [2022-04-15 12:48:42,079 INFO L272 TraceCheckUtils]: 63: Hoare triple {15500#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {15500#false} is VALID [2022-04-15 12:48:42,079 INFO L290 TraceCheckUtils]: 64: Hoare triple {15500#false} ~cond := #in~cond; {15500#false} is VALID [2022-04-15 12:48:42,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {15500#false} assume 0 == ~cond; {15500#false} is VALID [2022-04-15 12:48:42,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {15500#false} assume !false; {15500#false} is VALID [2022-04-15 12:48:42,079 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2022-04-15 12:48:42,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:48:43,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {15500#false} assume !false; {15500#false} is VALID [2022-04-15 12:48:43,429 INFO L290 TraceCheckUtils]: 65: Hoare triple {15739#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {15500#false} is VALID [2022-04-15 12:48:43,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {15743#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {15739#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:48:43,431 INFO L272 TraceCheckUtils]: 63: Hoare triple {15747#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {15743#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:48:43,431 INFO L290 TraceCheckUtils]: 62: Hoare triple {15751#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {15747#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:48:43,440 INFO L290 TraceCheckUtils]: 61: Hoare triple {15755#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {15751#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:48:43,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {15759#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {15755#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:48:43,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15759#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:48:43,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,444 INFO L290 TraceCheckUtils]: 57: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 54: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 51: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 50: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 49: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 48: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 47: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 46: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 45: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,445 INFO L290 TraceCheckUtils]: 44: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 43: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 42: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 41: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 40: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,446 INFO L290 TraceCheckUtils]: 33: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 32: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 20: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 19: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {15499#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {15499#true} assume !!(~x~0 % 4294967296 < 100000000); {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {15499#true} ~x~0 := 0; {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {15499#true} call #t~ret5 := main(); {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15499#true} {15499#true} #40#return; {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {15499#true} assume true; {15499#true} is VALID [2022-04-15 12:48:43,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {15499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {15499#true} is VALID [2022-04-15 12:48:43,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {15499#true} call ULTIMATE.init(); {15499#true} is VALID [2022-04-15 12:48:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 81 proven. 1 refuted. 0 times theorem prover too weak. 702 trivial. 0 not checked. [2022-04-15 12:48:43,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308167729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:48:43,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:48:43,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 4, 8] total 39 [2022-04-15 12:48:43,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:48:43,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1198592398] [2022-04-15 12:48:43,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1198592398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:48:43,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:48:43,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 12:48:43,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181546969] [2022-04-15 12:48:43,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:48:43,453 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 12:48:43,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:48:43,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:43,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:43,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 12:48:43,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:43,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 12:48:43,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1261, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:48:43,781 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:55,216 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-04-15 12:48:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:48:55,216 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-15 12:48:55,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:48:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:48:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 79 transitions. [2022-04-15 12:48:55,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 79 transitions. [2022-04-15 12:48:55,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:55,504 INFO L225 Difference]: With dead ends: 78 [2022-04-15 12:48:55,504 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:48:55,505 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=497, Invalid=3925, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:48:55,505 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1536 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:48:55,506 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 54 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1536 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 12:48:55,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:48:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 12:48:55,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:48:55,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,652 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,652 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:55,653 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:48:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:48:55,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:55,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:55,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:48:55,653 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:48:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:48:55,654 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2022-04-15 12:48:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:48:55,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:48:55,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:48:55,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:48:55,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:48:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 66 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-15 12:48:55,655 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2022-04-15 12:48:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:48:55,655 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-15 12:48:55,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:48:55,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-15 12:48:56,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:48:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 12:48:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 12:48:56,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:48:56,003 INFO L499 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:48:56,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 12:48:56,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-15 12:48:56,204 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:48:56,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:48:56,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 55 times [2022-04-15 12:48:56,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:48:56,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1547710789] [2022-04-15 12:48:56,357 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:48:56,359 INFO L85 PathProgramCache]: Analyzing trace with hash 351774129, now seen corresponding path program 1 times [2022-04-15 12:48:56,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:56,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087118836] [2022-04-15 12:48:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:56,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:56,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:48:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:48:56,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:48:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1241804503, now seen corresponding path program 56 times [2022-04-15 12:48:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:48:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45849842] [2022-04-15 12:48:56,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:48:56,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:48:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:48:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:56,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {16472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16438#true} is VALID [2022-04-15 12:48:56,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {16438#true} assume true; {16438#true} is VALID [2022-04-15 12:48:56,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16438#true} {16438#true} #40#return; {16438#true} is VALID [2022-04-15 12:48:56,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {16438#true} call ULTIMATE.init(); {16472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:48:56,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {16472#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16438#true} is VALID [2022-04-15 12:48:56,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {16438#true} assume true; {16438#true} is VALID [2022-04-15 12:48:56,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16438#true} {16438#true} #40#return; {16438#true} is VALID [2022-04-15 12:48:56,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {16438#true} call #t~ret5 := main(); {16438#true} is VALID [2022-04-15 12:48:56,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {16438#true} ~x~0 := 0; {16443#(= main_~x~0 0)} is VALID [2022-04-15 12:48:56,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {16443#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {16443#(= main_~x~0 0)} is VALID [2022-04-15 12:48:56,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {16443#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:56,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:56,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:56,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:56,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:56,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:56,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:56,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:57,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:57,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:57,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:57,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:57,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:57,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:57,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:57,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:57,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:57,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:57,034 INFO L290 TraceCheckUtils]: 25: Hoare triple {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:57,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:57,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:57,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:57,046 INFO L290 TraceCheckUtils]: 29: Hoare triple {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:57,046 INFO L290 TraceCheckUtils]: 30: Hoare triple {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:57,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:57,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:57,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:57,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:57,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:57,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:57,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:57,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:57,080 INFO L290 TraceCheckUtils]: 39: Hoare triple {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:57,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:57,093 INFO L290 TraceCheckUtils]: 41: Hoare triple {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:57,093 INFO L290 TraceCheckUtils]: 42: Hoare triple {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:57,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:57,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:57,116 INFO L290 TraceCheckUtils]: 45: Hoare triple {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:57,117 INFO L290 TraceCheckUtils]: 46: Hoare triple {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:57,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:57,129 INFO L290 TraceCheckUtils]: 48: Hoare triple {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:57,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:57,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:57,153 INFO L290 TraceCheckUtils]: 51: Hoare triple {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:57,154 INFO L290 TraceCheckUtils]: 52: Hoare triple {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:57,166 INFO L290 TraceCheckUtils]: 53: Hoare triple {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:57,166 INFO L290 TraceCheckUtils]: 54: Hoare triple {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:57,178 INFO L290 TraceCheckUtils]: 55: Hoare triple {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:57,179 INFO L290 TraceCheckUtils]: 56: Hoare triple {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:57,188 INFO L290 TraceCheckUtils]: 57: Hoare triple {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:57,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:57,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:57,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:57,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16471#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:48:57,200 INFO L290 TraceCheckUtils]: 62: Hoare triple {16471#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {16471#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-15 12:48:57,201 INFO L290 TraceCheckUtils]: 63: Hoare triple {16471#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {16439#false} is VALID [2022-04-15 12:48:57,201 INFO L290 TraceCheckUtils]: 64: Hoare triple {16439#false} assume !(~x~0 % 4294967296 < 100000000); {16439#false} is VALID [2022-04-15 12:48:57,201 INFO L272 TraceCheckUtils]: 65: Hoare triple {16439#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {16439#false} is VALID [2022-04-15 12:48:57,201 INFO L290 TraceCheckUtils]: 66: Hoare triple {16439#false} ~cond := #in~cond; {16439#false} is VALID [2022-04-15 12:48:57,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {16439#false} assume 0 == ~cond; {16439#false} is VALID [2022-04-15 12:48:57,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {16439#false} assume !false; {16439#false} is VALID [2022-04-15 12:48:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:57,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:48:57,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45849842] [2022-04-15 12:48:57,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45849842] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:48:57,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564179996] [2022-04-15 12:48:57,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:48:57,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:48:57,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:48:57,204 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:48:57,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 12:48:57,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:48:57,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:48:57,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-15 12:48:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:48:57,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:48:57,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {16438#true} call ULTIMATE.init(); {16438#true} is VALID [2022-04-15 12:48:57,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {16438#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16438#true} is VALID [2022-04-15 12:48:57,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {16438#true} assume true; {16438#true} is VALID [2022-04-15 12:48:57,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16438#true} {16438#true} #40#return; {16438#true} is VALID [2022-04-15 12:48:57,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {16438#true} call #t~ret5 := main(); {16438#true} is VALID [2022-04-15 12:48:57,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {16438#true} ~x~0 := 0; {16443#(= main_~x~0 0)} is VALID [2022-04-15 12:48:57,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {16443#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {16443#(= main_~x~0 0)} is VALID [2022-04-15 12:48:57,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {16443#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:57,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:48:57,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {16444#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:57,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:48:57,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {16445#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:57,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:48:57,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {16446#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:57,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:48:57,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {16447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:57,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:48:57,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {16448#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:57,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:48:57,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {16449#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:57,775 INFO L290 TraceCheckUtils]: 20: Hoare triple {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:48:57,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {16450#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:57,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:48:57,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {16451#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:57,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:48:57,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {16452#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:57,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:48:57,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {16453#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:57,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:48:57,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {16454#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:57,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:48:57,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {16455#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:57,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:48:57,863 INFO L290 TraceCheckUtils]: 33: Hoare triple {16456#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:57,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:48:57,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {16457#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:57,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:48:57,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {16458#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:57,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:48:57,903 INFO L290 TraceCheckUtils]: 39: Hoare triple {16459#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:57,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:48:57,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {16460#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:57,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:48:57,925 INFO L290 TraceCheckUtils]: 43: Hoare triple {16461#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:57,925 INFO L290 TraceCheckUtils]: 44: Hoare triple {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:48:57,937 INFO L290 TraceCheckUtils]: 45: Hoare triple {16462#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:57,938 INFO L290 TraceCheckUtils]: 46: Hoare triple {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:48:57,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {16463#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:57,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:48:57,964 INFO L290 TraceCheckUtils]: 49: Hoare triple {16464#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:57,964 INFO L290 TraceCheckUtils]: 50: Hoare triple {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:48:57,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {16465#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:57,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:48:57,989 INFO L290 TraceCheckUtils]: 53: Hoare triple {16466#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:57,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:48:58,005 INFO L290 TraceCheckUtils]: 55: Hoare triple {16467#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:58,005 INFO L290 TraceCheckUtils]: 56: Hoare triple {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:48:58,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {16468#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:58,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:48:58,034 INFO L290 TraceCheckUtils]: 59: Hoare triple {16469#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:58,034 INFO L290 TraceCheckUtils]: 60: Hoare triple {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:48:58,046 INFO L290 TraceCheckUtils]: 61: Hoare triple {16470#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16659#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:48:58,047 INFO L290 TraceCheckUtils]: 62: Hoare triple {16659#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {16659#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:48:58,060 INFO L290 TraceCheckUtils]: 63: Hoare triple {16659#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {16666#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:48:58,063 INFO L290 TraceCheckUtils]: 64: Hoare triple {16666#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 100000000); {16439#false} is VALID [2022-04-15 12:48:58,063 INFO L272 TraceCheckUtils]: 65: Hoare triple {16439#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {16439#false} is VALID [2022-04-15 12:48:58,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {16439#false} ~cond := #in~cond; {16439#false} is VALID [2022-04-15 12:48:58,063 INFO L290 TraceCheckUtils]: 67: Hoare triple {16439#false} assume 0 == ~cond; {16439#false} is VALID [2022-04-15 12:48:58,063 INFO L290 TraceCheckUtils]: 68: Hoare triple {16439#false} assume !false; {16439#false} is VALID [2022-04-15 12:48:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:48:58,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:04,803 INFO L290 TraceCheckUtils]: 68: Hoare triple {16439#false} assume !false; {16439#false} is VALID [2022-04-15 12:49:04,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {16439#false} assume 0 == ~cond; {16439#false} is VALID [2022-04-15 12:49:04,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {16439#false} ~cond := #in~cond; {16439#false} is VALID [2022-04-15 12:49:04,804 INFO L272 TraceCheckUtils]: 65: Hoare triple {16439#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {16439#false} is VALID [2022-04-15 12:49:04,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {16694#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {16439#false} is VALID [2022-04-15 12:49:04,812 INFO L290 TraceCheckUtils]: 63: Hoare triple {16698#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {16694#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,813 INFO L290 TraceCheckUtils]: 62: Hoare triple {16698#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16698#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,818 INFO L290 TraceCheckUtils]: 61: Hoare triple {16705#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16698#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,819 INFO L290 TraceCheckUtils]: 60: Hoare triple {16705#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16705#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,823 INFO L290 TraceCheckUtils]: 59: Hoare triple {16712#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16705#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {16712#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16712#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,829 INFO L290 TraceCheckUtils]: 57: Hoare triple {16719#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16712#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {16719#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16719#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {16726#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16719#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {16726#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16726#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,840 INFO L290 TraceCheckUtils]: 53: Hoare triple {16733#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16726#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {16733#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16733#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {16740#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16733#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,846 INFO L290 TraceCheckUtils]: 50: Hoare triple {16740#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16740#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {16747#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16740#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {16747#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16747#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {16754#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16747#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,856 INFO L290 TraceCheckUtils]: 46: Hoare triple {16754#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16754#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {16761#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16754#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {16761#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16761#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {16768#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16761#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,866 INFO L290 TraceCheckUtils]: 42: Hoare triple {16768#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16768#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,868 INFO L290 TraceCheckUtils]: 41: Hoare triple {16775#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16768#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,869 INFO L290 TraceCheckUtils]: 40: Hoare triple {16775#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16775#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {16782#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16775#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {16782#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16782#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {16789#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16782#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {16789#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16789#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,883 INFO L290 TraceCheckUtils]: 35: Hoare triple {16796#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16789#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {16796#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16796#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {16803#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16796#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {16803#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16803#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {16810#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16803#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {16810#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16810#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {16817#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16810#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {16817#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16817#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {16824#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16817#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {16824#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16824#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {16831#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16824#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {16831#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16831#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {16838#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16831#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {16838#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16838#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,911 INFO L290 TraceCheckUtils]: 21: Hoare triple {16845#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16838#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {16845#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16845#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {16852#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16845#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {16852#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16852#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {16859#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16852#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {16859#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16859#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {16866#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16859#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {16866#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16866#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {16873#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16866#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {16873#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16873#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {16880#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16873#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {16880#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16880#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {16887#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16880#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {16887#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16887#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {16894#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {16887#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {16894#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {16894#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {16438#true} ~x~0 := 0; {16894#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:04,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {16438#true} call #t~ret5 := main(); {16438#true} is VALID [2022-04-15 12:49:04,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16438#true} {16438#true} #40#return; {16438#true} is VALID [2022-04-15 12:49:04,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {16438#true} assume true; {16438#true} is VALID [2022-04-15 12:49:04,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {16438#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {16438#true} is VALID [2022-04-15 12:49:04,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {16438#true} call ULTIMATE.init(); {16438#true} is VALID [2022-04-15 12:49:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:04,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564179996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:04,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:04,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2022-04-15 12:49:04,936 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:04,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1547710789] [2022-04-15 12:49:04,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1547710789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:04,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:04,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:49:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011922725] [2022-04-15 12:49:04,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:04,936 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 12:49:04,936 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:04,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:05,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:05,485 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:49:05,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:05,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:49:05,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=2948, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 12:49:05,486 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:27,289 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-04-15 12:49:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 12:49:27,290 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 12:49:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:49:27,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:49:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 81 transitions. [2022-04-15 12:49:27,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 81 transitions. [2022-04-15 12:49:27,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:27,964 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:49:27,964 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 12:49:27,965 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 472 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2126, Invalid=6430, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 12:49:27,965 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:49:27,965 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 144 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2022-04-15 12:49:27,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 12:49:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-15 12:49:28,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:49:28,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:28,124 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:28,124 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:28,125 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:49:28,125 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:49:28,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:28,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:28,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 12:49:28,126 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 12:49:28,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:49:28,126 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-04-15 12:49:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:49:28,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:49:28,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:49:28,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:49:28,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:49:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 68 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-04-15 12:49:28,127 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2022-04-15 12:49:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:49:28,128 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-04-15 12:49:28,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:28,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 75 transitions. [2022-04-15 12:49:28,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-04-15 12:49:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 12:49:28,726 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:49:28,726 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:49:28,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 12:49:28,926 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,SelfDestructingSolverStorable58,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:28,926 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:49:28,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:49:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 57 times [2022-04-15 12:49:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:28,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527274722] [2022-04-15 12:49:29,127 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:49:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 410879473, now seen corresponding path program 1 times [2022-04-15 12:49:29,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:29,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965968441] [2022-04-15 12:49:29,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:29,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:49:29,134 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:49:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:49:29,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:49:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1726249338, now seen corresponding path program 58 times [2022-04-15 12:49:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:49:29,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583261482] [2022-04-15 12:49:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:49:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:49:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:29,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:49:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:29,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {17463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17428#true} is VALID [2022-04-15 12:49:29,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {17428#true} assume true; {17428#true} is VALID [2022-04-15 12:49:29,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17428#true} {17428#true} #40#return; {17428#true} is VALID [2022-04-15 12:49:29,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {17428#true} call ULTIMATE.init(); {17463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:49:29,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {17463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17428#true} is VALID [2022-04-15 12:49:29,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {17428#true} assume true; {17428#true} is VALID [2022-04-15 12:49:29,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17428#true} {17428#true} #40#return; {17428#true} is VALID [2022-04-15 12:49:29,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {17428#true} call #t~ret5 := main(); {17428#true} is VALID [2022-04-15 12:49:29,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {17428#true} ~x~0 := 0; {17433#(= main_~x~0 0)} is VALID [2022-04-15 12:49:29,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {17433#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {17433#(= main_~x~0 0)} is VALID [2022-04-15 12:49:29,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {17433#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:29,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:29,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:29,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:29,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:29,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:29,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:29,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:29,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:29,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:29,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:29,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:29,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:29,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:29,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:29,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:29,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:29,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:29,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:29,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:29,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:30,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:30,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:30,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:30,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:30,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:30,038 INFO L290 TraceCheckUtils]: 33: Hoare triple {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:30,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:30,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:30,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:30,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:30,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:30,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:30,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:30,099 INFO L290 TraceCheckUtils]: 41: Hoare triple {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:30,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:30,112 INFO L290 TraceCheckUtils]: 43: Hoare triple {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:30,112 INFO L290 TraceCheckUtils]: 44: Hoare triple {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:30,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:30,128 INFO L290 TraceCheckUtils]: 46: Hoare triple {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:30,142 INFO L290 TraceCheckUtils]: 47: Hoare triple {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:30,143 INFO L290 TraceCheckUtils]: 48: Hoare triple {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:30,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:30,160 INFO L290 TraceCheckUtils]: 50: Hoare triple {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:30,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:30,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:30,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:30,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:30,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:30,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:30,234 INFO L290 TraceCheckUtils]: 57: Hoare triple {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:30,234 INFO L290 TraceCheckUtils]: 58: Hoare triple {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:30,247 INFO L290 TraceCheckUtils]: 59: Hoare triple {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:30,248 INFO L290 TraceCheckUtils]: 60: Hoare triple {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:30,262 INFO L290 TraceCheckUtils]: 61: Hoare triple {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:30,263 INFO L290 TraceCheckUtils]: 62: Hoare triple {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:30,269 INFO L290 TraceCheckUtils]: 63: Hoare triple {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17462#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:49:30,270 INFO L290 TraceCheckUtils]: 64: Hoare triple {17462#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {17462#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:49:30,271 INFO L290 TraceCheckUtils]: 65: Hoare triple {17462#(and (<= main_~x~0 29) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {17429#false} is VALID [2022-04-15 12:49:30,271 INFO L290 TraceCheckUtils]: 66: Hoare triple {17429#false} assume !(~x~0 % 4294967296 < 100000000); {17429#false} is VALID [2022-04-15 12:49:30,271 INFO L272 TraceCheckUtils]: 67: Hoare triple {17429#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {17429#false} is VALID [2022-04-15 12:49:30,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {17429#false} ~cond := #in~cond; {17429#false} is VALID [2022-04-15 12:49:30,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {17429#false} assume 0 == ~cond; {17429#false} is VALID [2022-04-15 12:49:30,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {17429#false} assume !false; {17429#false} is VALID [2022-04-15 12:49:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:30,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:49:30,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583261482] [2022-04-15 12:49:30,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583261482] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:49:30,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450328947] [2022-04-15 12:49:30,273 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:49:30,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:49:30,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:49:30,274 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:49:30,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 12:49:30,367 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:49:30,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:49:30,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 12:49:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:49:30,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:49:30,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {17428#true} call ULTIMATE.init(); {17428#true} is VALID [2022-04-15 12:49:30,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {17428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17428#true} is VALID [2022-04-15 12:49:30,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {17428#true} assume true; {17428#true} is VALID [2022-04-15 12:49:30,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17428#true} {17428#true} #40#return; {17428#true} is VALID [2022-04-15 12:49:30,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {17428#true} call #t~ret5 := main(); {17428#true} is VALID [2022-04-15 12:49:30,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {17428#true} ~x~0 := 0; {17433#(= main_~x~0 0)} is VALID [2022-04-15 12:49:30,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {17433#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {17433#(= main_~x~0 0)} is VALID [2022-04-15 12:49:30,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {17433#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:30,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:49:30,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {17434#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:30,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:49:30,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {17435#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:30,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:49:30,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {17436#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:30,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:49:30,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {17437#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:30,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:49:30,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {17438#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:30,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:49:30,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {17439#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:30,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:49:30,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {17440#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:30,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:49:30,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {17441#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:30,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:49:30,940 INFO L290 TraceCheckUtils]: 25: Hoare triple {17442#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:30,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:49:30,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {17443#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:30,944 INFO L290 TraceCheckUtils]: 28: Hoare triple {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:49:30,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {17444#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:30,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:49:30,950 INFO L290 TraceCheckUtils]: 31: Hoare triple {17445#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:30,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:49:30,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {17446#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:30,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:49:30,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {17447#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:30,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:49:30,962 INFO L290 TraceCheckUtils]: 37: Hoare triple {17448#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:30,962 INFO L290 TraceCheckUtils]: 38: Hoare triple {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:49:30,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {17449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:30,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:49:30,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {17450#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:30,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:49:30,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {17451#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:30,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:49:30,977 INFO L290 TraceCheckUtils]: 45: Hoare triple {17452#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:30,977 INFO L290 TraceCheckUtils]: 46: Hoare triple {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:49:30,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {17453#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:30,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:49:30,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {17454#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:30,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:49:30,988 INFO L290 TraceCheckUtils]: 51: Hoare triple {17455#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:30,988 INFO L290 TraceCheckUtils]: 52: Hoare triple {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:49:30,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {17456#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:30,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:49:30,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {17457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:30,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:49:30,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {17458#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:30,999 INFO L290 TraceCheckUtils]: 58: Hoare triple {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:49:31,002 INFO L290 TraceCheckUtils]: 59: Hoare triple {17459#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:31,002 INFO L290 TraceCheckUtils]: 60: Hoare triple {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:49:31,006 INFO L290 TraceCheckUtils]: 61: Hoare triple {17460#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:31,006 INFO L290 TraceCheckUtils]: 62: Hoare triple {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:49:31,010 INFO L290 TraceCheckUtils]: 63: Hoare triple {17461#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17656#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:49:31,010 INFO L290 TraceCheckUtils]: 64: Hoare triple {17656#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {17656#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:49:31,013 INFO L290 TraceCheckUtils]: 65: Hoare triple {17656#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {17663#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:49:31,015 INFO L290 TraceCheckUtils]: 66: Hoare triple {17663#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 100000000); {17429#false} is VALID [2022-04-15 12:49:31,015 INFO L272 TraceCheckUtils]: 67: Hoare triple {17429#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {17429#false} is VALID [2022-04-15 12:49:31,016 INFO L290 TraceCheckUtils]: 68: Hoare triple {17429#false} ~cond := #in~cond; {17429#false} is VALID [2022-04-15 12:49:31,016 INFO L290 TraceCheckUtils]: 69: Hoare triple {17429#false} assume 0 == ~cond; {17429#false} is VALID [2022-04-15 12:49:31,016 INFO L290 TraceCheckUtils]: 70: Hoare triple {17429#false} assume !false; {17429#false} is VALID [2022-04-15 12:49:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:31,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:49:36,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {17429#false} assume !false; {17429#false} is VALID [2022-04-15 12:49:36,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {17429#false} assume 0 == ~cond; {17429#false} is VALID [2022-04-15 12:49:36,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {17429#false} ~cond := #in~cond; {17429#false} is VALID [2022-04-15 12:49:36,687 INFO L272 TraceCheckUtils]: 67: Hoare triple {17429#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {17429#false} is VALID [2022-04-15 12:49:36,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {17691#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {17429#false} is VALID [2022-04-15 12:49:36,693 INFO L290 TraceCheckUtils]: 65: Hoare triple {17695#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {17691#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,693 INFO L290 TraceCheckUtils]: 64: Hoare triple {17695#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17695#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,698 INFO L290 TraceCheckUtils]: 63: Hoare triple {17702#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17695#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {17702#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17702#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,704 INFO L290 TraceCheckUtils]: 61: Hoare triple {17709#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17702#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,704 INFO L290 TraceCheckUtils]: 60: Hoare triple {17709#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17709#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,709 INFO L290 TraceCheckUtils]: 59: Hoare triple {17716#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17709#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,709 INFO L290 TraceCheckUtils]: 58: Hoare triple {17716#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17716#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,712 INFO L290 TraceCheckUtils]: 57: Hoare triple {17723#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17716#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,712 INFO L290 TraceCheckUtils]: 56: Hoare triple {17723#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17723#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {17730#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17723#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {17730#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17730#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {17737#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17730#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,722 INFO L290 TraceCheckUtils]: 52: Hoare triple {17737#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17737#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,723 INFO L290 TraceCheckUtils]: 51: Hoare triple {17744#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17737#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {17744#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17744#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,728 INFO L290 TraceCheckUtils]: 49: Hoare triple {17751#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17744#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,729 INFO L290 TraceCheckUtils]: 48: Hoare triple {17751#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17751#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,733 INFO L290 TraceCheckUtils]: 47: Hoare triple {17758#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17751#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,733 INFO L290 TraceCheckUtils]: 46: Hoare triple {17758#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17758#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {17765#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17758#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {17765#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17765#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {17772#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17765#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {17772#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17772#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {17779#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17772#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {17779#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17779#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,746 INFO L290 TraceCheckUtils]: 39: Hoare triple {17786#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17779#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {17786#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17786#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,751 INFO L290 TraceCheckUtils]: 37: Hoare triple {17793#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17786#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,752 INFO L290 TraceCheckUtils]: 36: Hoare triple {17793#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17793#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {17800#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17793#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {17800#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17800#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {17807#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17800#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,757 INFO L290 TraceCheckUtils]: 32: Hoare triple {17807#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17807#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,759 INFO L290 TraceCheckUtils]: 31: Hoare triple {17814#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17807#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,759 INFO L290 TraceCheckUtils]: 30: Hoare triple {17814#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17814#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {17821#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17814#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {17821#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17821#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {17828#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17821#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {17828#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17828#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {17835#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17828#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {17835#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17835#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,776 INFO L290 TraceCheckUtils]: 23: Hoare triple {17842#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17835#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {17842#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17842#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {17849#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17842#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,782 INFO L290 TraceCheckUtils]: 20: Hoare triple {17849#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17849#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {17856#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17849#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {17856#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17856#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {17863#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17856#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {17863#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17863#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {17870#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17863#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {17870#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17870#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {17877#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17870#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {17877#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17877#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {17884#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17877#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {17884#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17884#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {17891#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17884#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {17891#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17891#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {17898#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {17891#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {17898#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {17898#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {17428#true} ~x~0 := 0; {17898#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} is VALID [2022-04-15 12:49:36,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {17428#true} call #t~ret5 := main(); {17428#true} is VALID [2022-04-15 12:49:36,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17428#true} {17428#true} #40#return; {17428#true} is VALID [2022-04-15 12:49:36,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {17428#true} assume true; {17428#true} is VALID [2022-04-15 12:49:36,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {17428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {17428#true} is VALID [2022-04-15 12:49:36,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {17428#true} call ULTIMATE.init(); {17428#true} is VALID [2022-04-15 12:49:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:49:36,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450328947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:49:36,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:49:36,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-04-15 12:49:36,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:49:36,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527274722] [2022-04-15 12:49:36,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527274722] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:49:36,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:49:36,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 12:49:36,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514026597] [2022-04-15 12:49:36,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:49:36,802 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 12:49:36,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:49:36,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:49:37,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:49:37,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 12:49:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:49:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 12:49:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=3139, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 12:49:37,443 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:13,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:13,318 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 12:50:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:50:13,318 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-15 12:50:13,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:13,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:13,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:50:13,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 83 transitions. [2022-04-15 12:50:13,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 83 transitions. [2022-04-15 12:50:14,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:14,106 INFO L225 Difference]: With dead ends: 82 [2022-04-15 12:50:14,106 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:50:14,107 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 110 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2259, Invalid=6861, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 12:50:14,108 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:14,108 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 49 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2022-04-15 12:50:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:50:14,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 12:50:14,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:14,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:14,267 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:14,267 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:14,268 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:50:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:50:14,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:14,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:14,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:50:14,269 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:50:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:14,269 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2022-04-15 12:50:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:50:14,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:14,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:14,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:14,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.042857142857143) internal successors, (73), 70 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-15 12:50:14,271 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 71 [2022-04-15 12:50:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:14,271 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-15 12:50:14,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:14,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-15 12:50:14,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 12:50:14,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 12:50:14,734 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:14,734 INFO L499 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:14,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 12:50:14,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-15 12:50:14,934 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 59 times [2022-04-15 12:50:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:14,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1566917250] [2022-04-15 12:50:15,106 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:50:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 469984817, now seen corresponding path program 1 times [2022-04-15 12:50:15,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:15,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750341813] [2022-04-15 12:50:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:15,114 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:50:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:15,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:50:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash 873699491, now seen corresponding path program 60 times [2022-04-15 12:50:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:15,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634615380] [2022-04-15 12:50:15,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:15,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:15,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:15,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {18482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18446#true} is VALID [2022-04-15 12:50:15,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {18446#true} assume true; {18446#true} is VALID [2022-04-15 12:50:15,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18446#true} {18446#true} #40#return; {18446#true} is VALID [2022-04-15 12:50:15,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {18446#true} call ULTIMATE.init(); {18482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:15,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {18482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18446#true} is VALID [2022-04-15 12:50:15,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {18446#true} assume true; {18446#true} is VALID [2022-04-15 12:50:15,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18446#true} {18446#true} #40#return; {18446#true} is VALID [2022-04-15 12:50:15,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {18446#true} call #t~ret5 := main(); {18446#true} is VALID [2022-04-15 12:50:15,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {18446#true} ~x~0 := 0; {18451#(= main_~x~0 0)} is VALID [2022-04-15 12:50:15,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {18451#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {18451#(= main_~x~0 0)} is VALID [2022-04-15 12:50:15,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {18451#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18452#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:15,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {18452#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {18452#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:15,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {18452#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:15,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {18453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {18453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:15,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {18453#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:15,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {18454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:15,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {18454#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18455#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:15,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {18455#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18455#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:15,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {18455#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:15,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {18456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {18456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:15,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {18456#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18457#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:15,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {18457#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {18457#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:15,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {18457#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:15,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {18458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:15,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {18458#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18459#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:15,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {18459#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18459#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:15,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {18459#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18460#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:15,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {18460#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18460#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:15,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {18460#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:15,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {18461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:15,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {18461#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18462#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:15,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {18462#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18462#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:15,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {18462#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:15,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {18463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:15,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {18463#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:15,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {18464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:15,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {18464#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18465#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:15,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {18465#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {18465#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:15,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {18465#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:15,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {18466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {18466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:15,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {18466#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:15,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {18467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:15,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {18467#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18468#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:15,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {18468#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {18468#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:15,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {18468#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:15,945 INFO L290 TraceCheckUtils]: 42: Hoare triple {18469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:15,953 INFO L290 TraceCheckUtils]: 43: Hoare triple {18469#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18470#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:15,953 INFO L290 TraceCheckUtils]: 44: Hoare triple {18470#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {18470#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:15,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {18470#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18471#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:15,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {18471#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18471#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:15,974 INFO L290 TraceCheckUtils]: 47: Hoare triple {18471#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:15,975 INFO L290 TraceCheckUtils]: 48: Hoare triple {18472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {18472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:15,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {18472#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18473#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:15,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {18473#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {18473#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:15,998 INFO L290 TraceCheckUtils]: 51: Hoare triple {18473#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18474#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:15,999 INFO L290 TraceCheckUtils]: 52: Hoare triple {18474#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {18474#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:16,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {18474#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:16,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {18475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:16,024 INFO L290 TraceCheckUtils]: 55: Hoare triple {18475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18476#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:16,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {18476#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18476#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:16,037 INFO L290 TraceCheckUtils]: 57: Hoare triple {18476#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18477#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:16,037 INFO L290 TraceCheckUtils]: 58: Hoare triple {18477#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18477#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:16,045 INFO L290 TraceCheckUtils]: 59: Hoare triple {18477#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18478#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:16,046 INFO L290 TraceCheckUtils]: 60: Hoare triple {18478#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {18478#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:16,056 INFO L290 TraceCheckUtils]: 61: Hoare triple {18478#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18479#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:16,057 INFO L290 TraceCheckUtils]: 62: Hoare triple {18479#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {18479#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:16,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {18479#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18480#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:16,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {18480#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {18480#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:16,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {18480#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18481#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:16,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {18481#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {18481#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:16,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {18481#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {18447#false} is VALID [2022-04-15 12:50:16,072 INFO L290 TraceCheckUtils]: 68: Hoare triple {18447#false} assume !(~x~0 % 4294967296 < 100000000); {18447#false} is VALID [2022-04-15 12:50:16,072 INFO L272 TraceCheckUtils]: 69: Hoare triple {18447#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {18447#false} is VALID [2022-04-15 12:50:16,072 INFO L290 TraceCheckUtils]: 70: Hoare triple {18447#false} ~cond := #in~cond; {18447#false} is VALID [2022-04-15 12:50:16,072 INFO L290 TraceCheckUtils]: 71: Hoare triple {18447#false} assume 0 == ~cond; {18447#false} is VALID [2022-04-15 12:50:16,072 INFO L290 TraceCheckUtils]: 72: Hoare triple {18447#false} assume !false; {18447#false} is VALID [2022-04-15 12:50:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:16,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:16,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634615380] [2022-04-15 12:50:16,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634615380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:16,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862969218] [2022-04-15 12:50:16,073 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:50:16,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:16,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:16,074 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:16,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 12:50:16,140 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:50:16,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:50:16,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:50:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:16,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:16,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {18446#true} call ULTIMATE.init(); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {18446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {18446#true} assume true; {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18446#true} {18446#true} #40#return; {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {18446#true} call #t~ret5 := main(); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {18446#true} ~x~0 := 0; {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 7: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 8: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,608 INFO L290 TraceCheckUtils]: 13: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 15: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 41: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 42: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,610 INFO L290 TraceCheckUtils]: 43: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 44: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 46: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 47: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 48: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 49: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 50: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 51: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 52: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 53: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 54: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 55: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 56: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 58: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 59: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 62: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 63: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:16,612 INFO L290 TraceCheckUtils]: 64: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:16,617 INFO L290 TraceCheckUtils]: 65: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18681#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:50:16,617 INFO L290 TraceCheckUtils]: 66: Hoare triple {18681#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {18681#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:50:16,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {18681#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {18688#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:50:16,624 INFO L290 TraceCheckUtils]: 68: Hoare triple {18688#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {18447#false} is VALID [2022-04-15 12:50:16,625 INFO L272 TraceCheckUtils]: 69: Hoare triple {18447#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {18447#false} is VALID [2022-04-15 12:50:16,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {18447#false} ~cond := #in~cond; {18447#false} is VALID [2022-04-15 12:50:16,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {18447#false} assume 0 == ~cond; {18447#false} is VALID [2022-04-15 12:50:16,625 INFO L290 TraceCheckUtils]: 72: Hoare triple {18447#false} assume !false; {18447#false} is VALID [2022-04-15 12:50:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2022-04-15 12:50:16,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:50:18,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {18447#false} assume !false; {18447#false} is VALID [2022-04-15 12:50:18,012 INFO L290 TraceCheckUtils]: 71: Hoare triple {18707#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18447#false} is VALID [2022-04-15 12:50:18,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {18711#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18707#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:50:18,013 INFO L272 TraceCheckUtils]: 69: Hoare triple {18715#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {18711#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:50:18,013 INFO L290 TraceCheckUtils]: 68: Hoare triple {18719#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {18715#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:50:18,017 INFO L290 TraceCheckUtils]: 67: Hoare triple {18723#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {18719#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:50:18,017 INFO L290 TraceCheckUtils]: 66: Hoare triple {18727#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {18723#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:50:18,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18727#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:50:18,020 INFO L290 TraceCheckUtils]: 64: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,020 INFO L290 TraceCheckUtils]: 63: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 60: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 59: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 58: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 57: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 56: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 55: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 54: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 52: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 51: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 50: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 49: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 48: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,021 INFO L290 TraceCheckUtils]: 47: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 46: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 45: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 44: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 40: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 39: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {18446#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {18446#true} assume !!(~x~0 % 4294967296 < 100000000); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {18446#true} ~x~0 := 0; {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {18446#true} call #t~ret5 := main(); {18446#true} is VALID [2022-04-15 12:50:18,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18446#true} {18446#true} #40#return; {18446#true} is VALID [2022-04-15 12:50:18,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {18446#true} assume true; {18446#true} is VALID [2022-04-15 12:50:18,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {18446#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {18446#true} is VALID [2022-04-15 12:50:18,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {18446#true} call ULTIMATE.init(); {18446#true} is VALID [2022-04-15 12:50:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2022-04-15 12:50:18,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862969218] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:50:18,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:50:18,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 4, 8] total 42 [2022-04-15 12:50:18,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:50:18,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1566917250] [2022-04-15 12:50:18,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1566917250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:50:18,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:50:18,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:50:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659185621] [2022-04-15 12:50:18,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:50:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 12:50:18,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:50:18,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:18,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:18,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:50:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:50:18,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1480, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 12:50:18,672 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:43,409 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 12:50:43,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 12:50:43,409 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-15 12:50:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:50:43,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 85 transitions. [2022-04-15 12:50:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 85 transitions. [2022-04-15 12:50:43,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 85 transitions. [2022-04-15 12:50:44,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:44,192 INFO L225 Difference]: With dead ends: 84 [2022-04-15 12:50:44,192 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 12:50:44,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=548, Invalid=4708, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 12:50:44,193 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:50:44,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 84 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-04-15 12:50:44,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 12:50:44,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-15 12:50:44,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:50:44,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:44,387 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:44,387 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:44,388 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-15 12:50:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:50:44,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:44,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:44,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 12:50:44,389 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-15 12:50:44,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:50:44,390 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2022-04-15 12:50:44,390 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:50:44,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:50:44,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:50:44,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:50:44,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:50:44,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 72 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-04-15 12:50:44,391 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 73 [2022-04-15 12:50:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:50:44,392 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-04-15 12:50:44,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:50:44,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 79 transitions. [2022-04-15 12:50:45,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:50:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 12:50:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 12:50:45,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:50:45,091 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:50:45,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 12:50:45,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61,SelfDestructingSolverStorable62 [2022-04-15 12:50:45,291 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:50:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:50:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -246442112, now seen corresponding path program 61 times [2022-04-15 12:50:45,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:50:45,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [721327366] [2022-04-15 12:50:45,507 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:50:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash 529090161, now seen corresponding path program 1 times [2022-04-15 12:50:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:45,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774314630] [2022-04-15 12:50:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:45,515 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:50:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:50:45,518 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:50:45,518 INFO L85 PathProgramCache]: Analyzing trace with hash -246442112, now seen corresponding path program 62 times [2022-04-15 12:50:45,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:50:45,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038386151] [2022-04-15 12:50:45,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:50:45,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:50:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:46,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:50:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:46,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {19503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19466#true} is VALID [2022-04-15 12:50:46,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {19466#true} assume true; {19466#true} is VALID [2022-04-15 12:50:46,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19466#true} {19466#true} #40#return; {19466#true} is VALID [2022-04-15 12:50:46,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {19466#true} call ULTIMATE.init(); {19503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:50:46,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {19503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19466#true} is VALID [2022-04-15 12:50:46,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {19466#true} assume true; {19466#true} is VALID [2022-04-15 12:50:46,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19466#true} {19466#true} #40#return; {19466#true} is VALID [2022-04-15 12:50:46,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {19466#true} call #t~ret5 := main(); {19466#true} is VALID [2022-04-15 12:50:46,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {19466#true} ~x~0 := 0; {19471#(= main_~x~0 0)} is VALID [2022-04-15 12:50:46,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {19471#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {19471#(= main_~x~0 0)} is VALID [2022-04-15 12:50:46,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {19471#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:46,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:46,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:46,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:46,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:46,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:46,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:46,262 INFO L290 TraceCheckUtils]: 14: Hoare triple {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:46,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:46,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:46,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:46,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:46,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:46,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:46,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:46,345 INFO L290 TraceCheckUtils]: 22: Hoare triple {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:46,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:46,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:46,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:46,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:46,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:46,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:46,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:46,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:46,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:46,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:46,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:46,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:46,481 INFO L290 TraceCheckUtils]: 35: Hoare triple {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:46,482 INFO L290 TraceCheckUtils]: 36: Hoare triple {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:46,502 INFO L290 TraceCheckUtils]: 37: Hoare triple {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:46,502 INFO L290 TraceCheckUtils]: 38: Hoare triple {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:46,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:46,522 INFO L290 TraceCheckUtils]: 40: Hoare triple {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:46,541 INFO L290 TraceCheckUtils]: 41: Hoare triple {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:46,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:46,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:46,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:46,579 INFO L290 TraceCheckUtils]: 45: Hoare triple {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:46,580 INFO L290 TraceCheckUtils]: 46: Hoare triple {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:46,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:46,598 INFO L290 TraceCheckUtils]: 48: Hoare triple {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:46,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:46,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:46,639 INFO L290 TraceCheckUtils]: 51: Hoare triple {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:46,640 INFO L290 TraceCheckUtils]: 52: Hoare triple {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:46,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:46,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:46,678 INFO L290 TraceCheckUtils]: 55: Hoare triple {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:46,679 INFO L290 TraceCheckUtils]: 56: Hoare triple {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:46,699 INFO L290 TraceCheckUtils]: 57: Hoare triple {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:46,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:46,715 INFO L290 TraceCheckUtils]: 59: Hoare triple {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:46,716 INFO L290 TraceCheckUtils]: 60: Hoare triple {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:46,734 INFO L290 TraceCheckUtils]: 61: Hoare triple {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:46,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:46,753 INFO L290 TraceCheckUtils]: 63: Hoare triple {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:46,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:46,774 INFO L290 TraceCheckUtils]: 65: Hoare triple {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:46,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:46,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19502#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:46,784 INFO L290 TraceCheckUtils]: 68: Hoare triple {19502#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {19502#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:50:46,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {19502#(and (<= main_~x~0 31) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {19467#false} is VALID [2022-04-15 12:50:46,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {19467#false} assume !(~x~0 % 4294967296 < 100000000); {19467#false} is VALID [2022-04-15 12:50:46,785 INFO L272 TraceCheckUtils]: 71: Hoare triple {19467#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {19467#false} is VALID [2022-04-15 12:50:46,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {19467#false} ~cond := #in~cond; {19467#false} is VALID [2022-04-15 12:50:46,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {19467#false} assume 0 == ~cond; {19467#false} is VALID [2022-04-15 12:50:46,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {19467#false} assume !false; {19467#false} is VALID [2022-04-15 12:50:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:46,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:50:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038386151] [2022-04-15 12:50:46,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038386151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:50:46,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676449710] [2022-04-15 12:50:46,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:50:46,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:50:46,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:50:46,788 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:50:46,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 12:50:46,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:50:46,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:50:46,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-15 12:50:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:50:46,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:50:47,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {19466#true} call ULTIMATE.init(); {19466#true} is VALID [2022-04-15 12:50:47,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {19466#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19466#true} is VALID [2022-04-15 12:50:47,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {19466#true} assume true; {19466#true} is VALID [2022-04-15 12:50:47,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19466#true} {19466#true} #40#return; {19466#true} is VALID [2022-04-15 12:50:47,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {19466#true} call #t~ret5 := main(); {19466#true} is VALID [2022-04-15 12:50:47,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {19466#true} ~x~0 := 0; {19471#(= main_~x~0 0)} is VALID [2022-04-15 12:50:47,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {19471#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {19471#(= main_~x~0 0)} is VALID [2022-04-15 12:50:47,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {19471#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:47,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:50:47,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {19472#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:47,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:50:47,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {19473#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:47,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:50:47,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {19474#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:47,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:50:47,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {19475#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:47,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:50:47,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {19476#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:47,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:50:47,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {19477#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:47,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:50:47,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {19478#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:47,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:50:47,712 INFO L290 TraceCheckUtils]: 23: Hoare triple {19479#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:47,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:50:47,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {19480#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:47,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:50:47,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {19481#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:47,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:50:47,768 INFO L290 TraceCheckUtils]: 29: Hoare triple {19482#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:47,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:50:47,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {19483#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:47,787 INFO L290 TraceCheckUtils]: 32: Hoare triple {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:50:47,802 INFO L290 TraceCheckUtils]: 33: Hoare triple {19484#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:47,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:50:47,822 INFO L290 TraceCheckUtils]: 35: Hoare triple {19485#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:47,823 INFO L290 TraceCheckUtils]: 36: Hoare triple {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:50:47,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {19486#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:47,842 INFO L290 TraceCheckUtils]: 38: Hoare triple {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:50:47,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {19487#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:47,861 INFO L290 TraceCheckUtils]: 40: Hoare triple {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:50:47,880 INFO L290 TraceCheckUtils]: 41: Hoare triple {19488#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:47,881 INFO L290 TraceCheckUtils]: 42: Hoare triple {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:50:47,896 INFO L290 TraceCheckUtils]: 43: Hoare triple {19489#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:47,897 INFO L290 TraceCheckUtils]: 44: Hoare triple {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:50:47,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {19490#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:47,915 INFO L290 TraceCheckUtils]: 46: Hoare triple {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:50:47,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {19491#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:47,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:50:47,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {19492#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:47,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:50:47,975 INFO L290 TraceCheckUtils]: 51: Hoare triple {19493#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:47,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:50:47,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {19494#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:47,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:50:48,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {19495#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:48,014 INFO L290 TraceCheckUtils]: 56: Hoare triple {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:50:48,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {19496#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:48,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:50:48,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {19497#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:48,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:50:48,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {19498#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:48,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:50:48,090 INFO L290 TraceCheckUtils]: 63: Hoare triple {19499#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:48,090 INFO L290 TraceCheckUtils]: 64: Hoare triple {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:50:48,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {19500#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:48,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:50:48,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {19501#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19708#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:50:48,132 INFO L290 TraceCheckUtils]: 68: Hoare triple {19708#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {19708#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:50:48,145 INFO L290 TraceCheckUtils]: 69: Hoare triple {19708#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {19715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:50:48,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {19715#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {19467#false} is VALID [2022-04-15 12:50:48,149 INFO L272 TraceCheckUtils]: 71: Hoare triple {19467#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {19467#false} is VALID [2022-04-15 12:50:48,150 INFO L290 TraceCheckUtils]: 72: Hoare triple {19467#false} ~cond := #in~cond; {19467#false} is VALID [2022-04-15 12:50:48,150 INFO L290 TraceCheckUtils]: 73: Hoare triple {19467#false} assume 0 == ~cond; {19467#false} is VALID [2022-04-15 12:50:48,150 INFO L290 TraceCheckUtils]: 74: Hoare triple {19467#false} assume !false; {19467#false} is VALID [2022-04-15 12:50:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:50:48,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:01,007 INFO L290 TraceCheckUtils]: 74: Hoare triple {19467#false} assume !false; {19467#false} is VALID [2022-04-15 12:51:01,007 INFO L290 TraceCheckUtils]: 73: Hoare triple {19467#false} assume 0 == ~cond; {19467#false} is VALID [2022-04-15 12:51:01,008 INFO L290 TraceCheckUtils]: 72: Hoare triple {19467#false} ~cond := #in~cond; {19467#false} is VALID [2022-04-15 12:51:01,008 INFO L272 TraceCheckUtils]: 71: Hoare triple {19467#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {19467#false} is VALID [2022-04-15 12:51:01,008 INFO L290 TraceCheckUtils]: 70: Hoare triple {19743#(< (mod main_~x~0 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 100000000); {19467#false} is VALID [2022-04-15 12:51:01,013 INFO L290 TraceCheckUtils]: 69: Hoare triple {19747#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {19743#(< (mod main_~x~0 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,014 INFO L290 TraceCheckUtils]: 68: Hoare triple {19747#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19747#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,020 INFO L290 TraceCheckUtils]: 67: Hoare triple {19754#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19747#(< (mod (+ main_~x~0 2) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {19754#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19754#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {19761#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19754#(< (mod (+ main_~x~0 3) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,026 INFO L290 TraceCheckUtils]: 64: Hoare triple {19761#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19761#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,031 INFO L290 TraceCheckUtils]: 63: Hoare triple {19768#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19761#(< (mod (+ main_~x~0 4) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {19768#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19768#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,033 INFO L290 TraceCheckUtils]: 61: Hoare triple {19775#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19768#(< (mod (+ 5 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,033 INFO L290 TraceCheckUtils]: 60: Hoare triple {19775#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19775#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,039 INFO L290 TraceCheckUtils]: 59: Hoare triple {19782#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19775#(< (mod (+ main_~x~0 6) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,039 INFO L290 TraceCheckUtils]: 58: Hoare triple {19782#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19782#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,043 INFO L290 TraceCheckUtils]: 57: Hoare triple {19789#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19782#(< (mod (+ 7 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {19789#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19789#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,046 INFO L290 TraceCheckUtils]: 55: Hoare triple {19796#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19789#(< (mod (+ main_~x~0 8) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {19796#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19796#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,051 INFO L290 TraceCheckUtils]: 53: Hoare triple {19803#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19796#(< (mod (+ main_~x~0 9) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,052 INFO L290 TraceCheckUtils]: 52: Hoare triple {19803#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19803#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,055 INFO L290 TraceCheckUtils]: 51: Hoare triple {19810#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19803#(< (mod (+ main_~x~0 10) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {19810#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19810#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,058 INFO L290 TraceCheckUtils]: 49: Hoare triple {19817#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19810#(< (mod (+ main_~x~0 11) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,058 INFO L290 TraceCheckUtils]: 48: Hoare triple {19817#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19817#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {19824#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19817#(< (mod (+ main_~x~0 12) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {19824#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19824#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,066 INFO L290 TraceCheckUtils]: 45: Hoare triple {19831#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19824#(< (mod (+ main_~x~0 13) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,066 INFO L290 TraceCheckUtils]: 44: Hoare triple {19831#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19831#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,069 INFO L290 TraceCheckUtils]: 43: Hoare triple {19838#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19831#(< (mod (+ main_~x~0 14) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,069 INFO L290 TraceCheckUtils]: 42: Hoare triple {19838#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19838#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,074 INFO L290 TraceCheckUtils]: 41: Hoare triple {19845#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19838#(< (mod (+ main_~x~0 15) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,074 INFO L290 TraceCheckUtils]: 40: Hoare triple {19845#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19845#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,076 INFO L290 TraceCheckUtils]: 39: Hoare triple {19852#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19845#(< (mod (+ main_~x~0 16) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {19852#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19852#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {19859#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19852#(< (mod (+ main_~x~0 17) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,079 INFO L290 TraceCheckUtils]: 36: Hoare triple {19859#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19859#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {19866#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19859#(< (mod (+ main_~x~0 18) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {19866#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19866#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {19873#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19866#(< (mod (+ 19 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {19873#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19873#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {19880#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19873#(< (mod (+ main_~x~0 20) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {19880#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19880#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {19887#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19880#(< (mod (+ main_~x~0 21) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {19887#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19887#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {19894#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19887#(< (mod (+ main_~x~0 22) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {19894#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19894#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {19901#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19894#(< (mod (+ 23 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {19901#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19901#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {19908#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19901#(< (mod (+ main_~x~0 24) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {19908#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19908#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {19915#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19908#(< (mod (+ main_~x~0 25) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {19915#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19915#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,107 INFO L290 TraceCheckUtils]: 19: Hoare triple {19922#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19915#(< (mod (+ main_~x~0 26) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {19922#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19922#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {19929#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19922#(< (mod (+ main_~x~0 27) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {19929#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19929#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {19936#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19929#(< (mod (+ main_~x~0 28) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {19936#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19936#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {19943#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19936#(< (mod (+ 29 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {19943#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19943#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {19950#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19943#(< (mod (+ 30 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {19950#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19950#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {19957#(< (mod (+ 32 main_~x~0) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19950#(< (mod (+ main_~x~0 31) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {19957#(< (mod (+ 32 main_~x~0) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19957#(< (mod (+ 32 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {19964#(< (mod (+ main_~x~0 33) 4294967296) 100000000)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {19957#(< (mod (+ 32 main_~x~0) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {19964#(< (mod (+ main_~x~0 33) 4294967296) 100000000)} assume !!(~x~0 % 4294967296 < 100000000); {19964#(< (mod (+ main_~x~0 33) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {19466#true} ~x~0 := 0; {19964#(< (mod (+ main_~x~0 33) 4294967296) 100000000)} is VALID [2022-04-15 12:51:01,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {19466#true} call #t~ret5 := main(); {19466#true} is VALID [2022-04-15 12:51:01,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19466#true} {19466#true} #40#return; {19466#true} is VALID [2022-04-15 12:51:01,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {19466#true} assume true; {19466#true} is VALID [2022-04-15 12:51:01,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {19466#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {19466#true} is VALID [2022-04-15 12:51:01,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {19466#true} call ULTIMATE.init(); {19466#true} is VALID [2022-04-15 12:51:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:01,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676449710] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:01,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:01,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2022-04-15 12:51:01,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [721327366] [2022-04-15 12:51:01,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [721327366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:01,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:01,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 12:51:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007129962] [2022-04-15 12:51:01,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:51:01,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:01,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:01,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:01,747 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 12:51:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:01,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 12:51:01,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1291, Invalid=3539, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 12:51:01,748 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:34,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:34,706 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 12:51:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:51:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-15 12:51:34,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:51:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-15 12:51:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 87 transitions. [2022-04-15 12:51:34,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 87 transitions. [2022-04-15 12:51:35,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:35,536 INFO L225 Difference]: With dead ends: 86 [2022-04-15 12:51:35,536 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:51:35,537 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=2537, Invalid=7765, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 12:51:35,537 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:51:35,537 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 39 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-04-15 12:51:35,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:51:35,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 12:51:35,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:51:35,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:35,717 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:35,718 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:35,718 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 12:51:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:51:35,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:35,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:35,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:51:35,719 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:51:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:51:35,719 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-04-15 12:51:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:51:35,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:51:35,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:51:35,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:51:35,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:51:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:35,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-04-15 12:51:35,721 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 75 [2022-04-15 12:51:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:51:35,721 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-04-15 12:51:35,721 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.0285714285714285) internal successors, (71), 34 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:35,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 81 transitions. [2022-04-15 12:51:36,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-04-15 12:51:36,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 12:51:36,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:51:36,765 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:51:36,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 12:51:36,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,SelfDestructingSolverStorable64,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:36,966 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:51:36,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:51:36,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1334268701, now seen corresponding path program 63 times [2022-04-15 12:51:36,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:36,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962106676] [2022-04-15 12:51:37,210 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:51:37,212 INFO L85 PathProgramCache]: Analyzing trace with hash 588195505, now seen corresponding path program 1 times [2022-04-15 12:51:37,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:37,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627457315] [2022-04-15 12:51:37,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:37,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:51:37,217 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:51:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:51:37,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:51:37,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1334268701, now seen corresponding path program 64 times [2022-04-15 12:51:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:51:37,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513136344] [2022-04-15 12:51:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:51:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:51:37,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:51:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:37,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {20578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20540#true} is VALID [2022-04-15 12:51:37,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {20540#true} assume true; {20540#true} is VALID [2022-04-15 12:51:37,903 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20540#true} {20540#true} #40#return; {20540#true} is VALID [2022-04-15 12:51:37,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {20540#true} call ULTIMATE.init(); {20578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:51:37,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {20578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20540#true} is VALID [2022-04-15 12:51:37,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {20540#true} assume true; {20540#true} is VALID [2022-04-15 12:51:37,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20540#true} {20540#true} #40#return; {20540#true} is VALID [2022-04-15 12:51:37,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {20540#true} call #t~ret5 := main(); {20540#true} is VALID [2022-04-15 12:51:37,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {20540#true} ~x~0 := 0; {20545#(= main_~x~0 0)} is VALID [2022-04-15 12:51:37,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {20545#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {20545#(= main_~x~0 0)} is VALID [2022-04-15 12:51:37,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {20545#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:51:37,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:51:37,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:51:37,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:51:37,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:51:37,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:51:37,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:51:37,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:51:37,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:51:37,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:51:38,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:51:38,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:51:38,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:51:38,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:51:38,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:51:38,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:51:38,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:51:38,074 INFO L290 TraceCheckUtils]: 24: Hoare triple {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:51:38,095 INFO L290 TraceCheckUtils]: 25: Hoare triple {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:51:38,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:51:38,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:51:38,118 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:51:38,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:51:38,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:51:38,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:51:38,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:51:38,167 INFO L290 TraceCheckUtils]: 33: Hoare triple {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:51:38,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:51:38,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:51:38,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:51:38,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:51:38,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:51:38,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:51:38,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:51:38,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:51:38,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:51:38,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:51:38,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:51:38,290 INFO L290 TraceCheckUtils]: 45: Hoare triple {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:51:38,291 INFO L290 TraceCheckUtils]: 46: Hoare triple {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:51:38,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:51:38,312 INFO L290 TraceCheckUtils]: 48: Hoare triple {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:51:38,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:51:38,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:51:38,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:51:38,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:51:38,365 INFO L290 TraceCheckUtils]: 53: Hoare triple {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:51:38,367 INFO L290 TraceCheckUtils]: 54: Hoare triple {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:51:38,382 INFO L290 TraceCheckUtils]: 55: Hoare triple {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:51:38,383 INFO L290 TraceCheckUtils]: 56: Hoare triple {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:51:38,391 INFO L290 TraceCheckUtils]: 57: Hoare triple {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:51:38,391 INFO L290 TraceCheckUtils]: 58: Hoare triple {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:51:38,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:51:38,396 INFO L290 TraceCheckUtils]: 60: Hoare triple {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:51:38,403 INFO L290 TraceCheckUtils]: 61: Hoare triple {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:51:38,403 INFO L290 TraceCheckUtils]: 62: Hoare triple {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:51:38,412 INFO L290 TraceCheckUtils]: 63: Hoare triple {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:51:38,412 INFO L290 TraceCheckUtils]: 64: Hoare triple {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:51:38,428 INFO L290 TraceCheckUtils]: 65: Hoare triple {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:51:38,429 INFO L290 TraceCheckUtils]: 66: Hoare triple {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:51:38,448 INFO L290 TraceCheckUtils]: 67: Hoare triple {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:51:38,448 INFO L290 TraceCheckUtils]: 68: Hoare triple {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:51:38,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20577#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:51:38,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {20577#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {20577#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:51:38,458 INFO L290 TraceCheckUtils]: 71: Hoare triple {20577#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {20541#false} is VALID [2022-04-15 12:51:38,458 INFO L290 TraceCheckUtils]: 72: Hoare triple {20541#false} assume !(~x~0 % 4294967296 < 100000000); {20541#false} is VALID [2022-04-15 12:51:38,458 INFO L272 TraceCheckUtils]: 73: Hoare triple {20541#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {20541#false} is VALID [2022-04-15 12:51:38,458 INFO L290 TraceCheckUtils]: 74: Hoare triple {20541#false} ~cond := #in~cond; {20541#false} is VALID [2022-04-15 12:51:38,458 INFO L290 TraceCheckUtils]: 75: Hoare triple {20541#false} assume 0 == ~cond; {20541#false} is VALID [2022-04-15 12:51:38,458 INFO L290 TraceCheckUtils]: 76: Hoare triple {20541#false} assume !false; {20541#false} is VALID [2022-04-15 12:51:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:38,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:51:38,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513136344] [2022-04-15 12:51:38,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513136344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:51:38,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591718956] [2022-04-15 12:51:38,459 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:51:38,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:51:38,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:51:38,461 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:51:38,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 12:51:38,538 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:51:38,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:51:38,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 12:51:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:51:38,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:51:39,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {20540#true} call ULTIMATE.init(); {20540#true} is VALID [2022-04-15 12:51:39,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {20540#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20540#true} is VALID [2022-04-15 12:51:39,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {20540#true} assume true; {20540#true} is VALID [2022-04-15 12:51:39,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20540#true} {20540#true} #40#return; {20540#true} is VALID [2022-04-15 12:51:39,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {20540#true} call #t~ret5 := main(); {20540#true} is VALID [2022-04-15 12:51:39,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {20540#true} ~x~0 := 0; {20545#(= main_~x~0 0)} is VALID [2022-04-15 12:51:39,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {20545#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {20545#(= main_~x~0 0)} is VALID [2022-04-15 12:51:39,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {20545#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:51:39,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:51:39,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {20546#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:51:39,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:51:39,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {20547#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:51:39,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:51:39,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {20548#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:51:39,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:51:39,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {20549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:51:39,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:51:39,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {20550#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:51:39,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:51:39,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {20551#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:51:39,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:51:39,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {20552#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:51:39,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:51:39,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {20553#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:51:39,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:51:39,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {20554#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:51:39,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:51:39,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {20555#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:51:39,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:51:39,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:51:39,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:51:39,465 INFO L290 TraceCheckUtils]: 31: Hoare triple {20557#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:51:39,465 INFO L290 TraceCheckUtils]: 32: Hoare triple {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:51:39,480 INFO L290 TraceCheckUtils]: 33: Hoare triple {20558#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:51:39,481 INFO L290 TraceCheckUtils]: 34: Hoare triple {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:51:39,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {20559#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:51:39,501 INFO L290 TraceCheckUtils]: 36: Hoare triple {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:51:39,521 INFO L290 TraceCheckUtils]: 37: Hoare triple {20560#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:51:39,521 INFO L290 TraceCheckUtils]: 38: Hoare triple {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:51:39,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {20561#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:51:39,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:51:39,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {20562#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:51:39,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:51:39,575 INFO L290 TraceCheckUtils]: 43: Hoare triple {20563#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:51:39,575 INFO L290 TraceCheckUtils]: 44: Hoare triple {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:51:39,595 INFO L290 TraceCheckUtils]: 45: Hoare triple {20564#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:51:39,596 INFO L290 TraceCheckUtils]: 46: Hoare triple {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:51:39,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {20565#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:51:39,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:51:39,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {20566#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:51:39,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:51:39,654 INFO L290 TraceCheckUtils]: 51: Hoare triple {20567#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:51:39,655 INFO L290 TraceCheckUtils]: 52: Hoare triple {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:51:39,674 INFO L290 TraceCheckUtils]: 53: Hoare triple {20568#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:51:39,675 INFO L290 TraceCheckUtils]: 54: Hoare triple {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:51:39,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {20569#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:51:39,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:51:39,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {20570#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:51:39,711 INFO L290 TraceCheckUtils]: 58: Hoare triple {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:51:39,720 INFO L290 TraceCheckUtils]: 59: Hoare triple {20571#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:51:39,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:51:39,737 INFO L290 TraceCheckUtils]: 61: Hoare triple {20572#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:51:39,738 INFO L290 TraceCheckUtils]: 62: Hoare triple {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:51:39,757 INFO L290 TraceCheckUtils]: 63: Hoare triple {20573#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:51:39,758 INFO L290 TraceCheckUtils]: 64: Hoare triple {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:51:39,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {20574#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:51:39,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:51:39,797 INFO L290 TraceCheckUtils]: 67: Hoare triple {20575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:51:39,798 INFO L290 TraceCheckUtils]: 68: Hoare triple {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:51:39,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {20576#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20789#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:51:39,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {20789#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {20789#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:51:39,831 INFO L290 TraceCheckUtils]: 71: Hoare triple {20789#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {20541#false} is VALID [2022-04-15 12:51:39,832 INFO L290 TraceCheckUtils]: 72: Hoare triple {20541#false} assume !(~x~0 % 4294967296 < 100000000); {20541#false} is VALID [2022-04-15 12:51:39,832 INFO L272 TraceCheckUtils]: 73: Hoare triple {20541#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {20541#false} is VALID [2022-04-15 12:51:39,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {20541#false} ~cond := #in~cond; {20541#false} is VALID [2022-04-15 12:51:39,832 INFO L290 TraceCheckUtils]: 75: Hoare triple {20541#false} assume 0 == ~cond; {20541#false} is VALID [2022-04-15 12:51:39,832 INFO L290 TraceCheckUtils]: 76: Hoare triple {20541#false} assume !false; {20541#false} is VALID [2022-04-15 12:51:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:39,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:51:50,646 INFO L290 TraceCheckUtils]: 76: Hoare triple {20541#false} assume !false; {20541#false} is VALID [2022-04-15 12:51:50,646 INFO L290 TraceCheckUtils]: 75: Hoare triple {20541#false} assume 0 == ~cond; {20541#false} is VALID [2022-04-15 12:51:50,646 INFO L290 TraceCheckUtils]: 74: Hoare triple {20541#false} ~cond := #in~cond; {20541#false} is VALID [2022-04-15 12:51:50,646 INFO L272 TraceCheckUtils]: 73: Hoare triple {20541#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {20541#false} is VALID [2022-04-15 12:51:50,646 INFO L290 TraceCheckUtils]: 72: Hoare triple {20541#false} assume !(~x~0 % 4294967296 < 100000000); {20541#false} is VALID [2022-04-15 12:51:50,646 INFO L290 TraceCheckUtils]: 71: Hoare triple {20826#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {20541#false} is VALID [2022-04-15 12:51:50,647 INFO L290 TraceCheckUtils]: 70: Hoare triple {20830#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20826#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:51:50,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {20834#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20830#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {20834#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20834#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {20841#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20834#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {20841#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20841#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {20848#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20841#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,666 INFO L290 TraceCheckUtils]: 64: Hoare triple {20848#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20848#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,671 INFO L290 TraceCheckUtils]: 63: Hoare triple {20855#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20848#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,671 INFO L290 TraceCheckUtils]: 62: Hoare triple {20855#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20855#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,674 INFO L290 TraceCheckUtils]: 61: Hoare triple {20862#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20855#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,674 INFO L290 TraceCheckUtils]: 60: Hoare triple {20862#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20862#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {20869#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20862#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,677 INFO L290 TraceCheckUtils]: 58: Hoare triple {20869#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20869#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,683 INFO L290 TraceCheckUtils]: 57: Hoare triple {20876#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20869#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,684 INFO L290 TraceCheckUtils]: 56: Hoare triple {20876#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20876#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,686 INFO L290 TraceCheckUtils]: 55: Hoare triple {20883#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20876#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,687 INFO L290 TraceCheckUtils]: 54: Hoare triple {20883#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20883#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {20890#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20883#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {20890#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20890#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,692 INFO L290 TraceCheckUtils]: 51: Hoare triple {20897#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20890#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,692 INFO L290 TraceCheckUtils]: 50: Hoare triple {20897#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20897#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,697 INFO L290 TraceCheckUtils]: 49: Hoare triple {20904#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20897#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,698 INFO L290 TraceCheckUtils]: 48: Hoare triple {20904#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20904#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,700 INFO L290 TraceCheckUtils]: 47: Hoare triple {20911#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20904#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,701 INFO L290 TraceCheckUtils]: 46: Hoare triple {20911#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {20911#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,703 INFO L290 TraceCheckUtils]: 45: Hoare triple {20918#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20911#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,703 INFO L290 TraceCheckUtils]: 44: Hoare triple {20918#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20918#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {20925#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20918#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,706 INFO L290 TraceCheckUtils]: 42: Hoare triple {20925#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20925#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {20932#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20925#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {20932#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20932#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,711 INFO L290 TraceCheckUtils]: 39: Hoare triple {20939#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20932#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {20939#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20939#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {20946#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20939#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {20946#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20946#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,717 INFO L290 TraceCheckUtils]: 35: Hoare triple {20953#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20946#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {20953#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20953#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {20960#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20953#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {20960#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20960#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {20967#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20960#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {20967#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20967#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,726 INFO L290 TraceCheckUtils]: 29: Hoare triple {20974#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20967#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {20974#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20974#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {20981#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20974#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {20981#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20981#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {20988#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20981#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {20988#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20988#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {20995#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20988#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {20995#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {20995#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {21002#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {20995#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {21002#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {21002#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,739 INFO L290 TraceCheckUtils]: 19: Hoare triple {21009#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21002#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {21009#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21009#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,742 INFO L290 TraceCheckUtils]: 17: Hoare triple {21016#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21009#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {21016#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21016#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {21023#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21016#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {21023#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {21023#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {21030#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21023#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:51:50,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {21030#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21030#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {21037#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21030#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {21037#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21037#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {21044#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21037#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {21044#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21044#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {21051#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21044#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {21051#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21051#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {20540#true} ~x~0 := 0; {21051#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:51:50,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {20540#true} call #t~ret5 := main(); {20540#true} is VALID [2022-04-15 12:51:50,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20540#true} {20540#true} #40#return; {20540#true} is VALID [2022-04-15 12:51:50,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {20540#true} assume true; {20540#true} is VALID [2022-04-15 12:51:50,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {20540#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {20540#true} is VALID [2022-04-15 12:51:50,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {20540#true} call ULTIMATE.init(); {20540#true} is VALID [2022-04-15 12:51:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:51:50,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591718956] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:51:50,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:51:50,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 36] total 71 [2022-04-15 12:51:50,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:51:50,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962106676] [2022-04-15 12:51:50,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962106676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:51:50,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:51:50,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:51:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575805224] [2022-04-15 12:51:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:51:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 12:51:50,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:51:50,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:51:51,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:51:51,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:51:51,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:51:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:51:51,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=3641, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 12:51:51,663 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:40,333 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 12:52:40,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 12:52:40,333 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-15 12:52:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:52:40,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-15 12:52:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 89 transitions. [2022-04-15 12:52:40,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 89 transitions. [2022-04-15 12:52:41,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:41,466 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:52:41,466 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 12:52:41,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2647, Invalid=8065, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 12:52:41,467 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2167 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:52:41,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 84 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2167 Invalid, 0 Unknown, 0 Unchecked, 16.9s Time] [2022-04-15 12:52:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 12:52:41,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-15 12:52:41,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:52:41,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:41,644 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:41,644 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:41,645 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-15 12:52:41,645 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:52:41,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:41,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:41,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 12:52:41,645 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-15 12:52:41,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:52:41,646 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2022-04-15 12:52:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:52:41,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:52:41,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:52:41,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:52:41,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:52:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2022-04-15 12:52:41,647 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2022-04-15 12:52:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:52:41,647 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2022-04-15 12:52:41,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 35 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:41,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 83 transitions. [2022-04-15 12:52:42,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2022-04-15 12:52:42,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 12:52:42,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:52:42,311 INFO L499 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:52:42,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 12:52:42,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,SelfDestructingSolverStorable66,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:42,511 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:52:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:52:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash -21062790, now seen corresponding path program 65 times [2022-04-15 12:52:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:42,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [73254784] [2022-04-15 12:52:42,705 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:52:42,707 INFO L85 PathProgramCache]: Analyzing trace with hash 647300849, now seen corresponding path program 1 times [2022-04-15 12:52:42,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:42,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104889384] [2022-04-15 12:52:42,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:52:42,713 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:52:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:52:42,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:52:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -21062790, now seen corresponding path program 66 times [2022-04-15 12:52:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:52:42,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004072776] [2022-04-15 12:52:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:52:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:52:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:43,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:52:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:43,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {21680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21641#true} is VALID [2022-04-15 12:52:43,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {21641#true} assume true; {21641#true} is VALID [2022-04-15 12:52:43,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21641#true} {21641#true} #40#return; {21641#true} is VALID [2022-04-15 12:52:43,455 INFO L272 TraceCheckUtils]: 0: Hoare triple {21641#true} call ULTIMATE.init(); {21680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:52:43,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {21680#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21641#true} is VALID [2022-04-15 12:52:43,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {21641#true} assume true; {21641#true} is VALID [2022-04-15 12:52:43,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21641#true} {21641#true} #40#return; {21641#true} is VALID [2022-04-15 12:52:43,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {21641#true} call #t~ret5 := main(); {21641#true} is VALID [2022-04-15 12:52:43,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {21641#true} ~x~0 := 0; {21646#(= main_~x~0 0)} is VALID [2022-04-15 12:52:43,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {21646#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {21646#(= main_~x~0 0)} is VALID [2022-04-15 12:52:43,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {21646#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21647#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:52:43,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {21647#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {21647#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:52:43,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {21647#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:52:43,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {21648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {21648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:52:43,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {21648#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21649#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:52:43,481 INFO L290 TraceCheckUtils]: 12: Hoare triple {21649#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21649#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:52:43,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {21649#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21650#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:52:43,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {21650#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21650#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:52:43,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {21650#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21651#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:52:43,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {21651#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {21651#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:52:43,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {21651#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21652#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:52:43,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {21652#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {21652#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:52:43,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {21652#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21653#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:52:43,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {21653#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21653#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:52:43,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {21653#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21654#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:52:43,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {21654#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21654#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:52:43,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {21654#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21655#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:52:43,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {21655#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21655#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:52:43,572 INFO L290 TraceCheckUtils]: 25: Hoare triple {21655#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21656#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:52:43,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {21656#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21656#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:52:43,584 INFO L290 TraceCheckUtils]: 27: Hoare triple {21656#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21657#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:52:43,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {21657#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21657#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:52:43,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {21657#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21658#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:52:43,592 INFO L290 TraceCheckUtils]: 30: Hoare triple {21658#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21658#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:52:43,602 INFO L290 TraceCheckUtils]: 31: Hoare triple {21658#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21659#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:52:43,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {21659#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21659#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:52:43,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {21659#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21660#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:52:43,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {21660#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {21660#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:52:43,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {21660#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21661#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:52:43,622 INFO L290 TraceCheckUtils]: 36: Hoare triple {21661#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {21661#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:52:43,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {21661#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:52:43,636 INFO L290 TraceCheckUtils]: 38: Hoare triple {21662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:52:43,649 INFO L290 TraceCheckUtils]: 39: Hoare triple {21662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21663#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:52:43,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {21663#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {21663#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:52:43,662 INFO L290 TraceCheckUtils]: 41: Hoare triple {21663#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21664#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:52:43,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {21664#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21664#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:52:43,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {21664#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21665#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:52:43,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {21665#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {21665#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:52:43,682 INFO L290 TraceCheckUtils]: 45: Hoare triple {21665#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21666#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:52:43,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {21666#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21666#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:52:43,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {21666#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21667#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:52:43,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {21667#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {21667#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:52:43,710 INFO L290 TraceCheckUtils]: 49: Hoare triple {21667#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21668#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:52:43,711 INFO L290 TraceCheckUtils]: 50: Hoare triple {21668#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {21668#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:52:43,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {21668#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21669#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:52:43,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {21669#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {21669#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:52:43,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {21669#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21670#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:52:43,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {21670#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21670#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:52:43,754 INFO L290 TraceCheckUtils]: 55: Hoare triple {21670#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21671#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:52:43,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {21671#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21671#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:52:43,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {21671#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21672#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:52:43,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {21672#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21672#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:52:43,778 INFO L290 TraceCheckUtils]: 59: Hoare triple {21672#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21673#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:52:43,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {21673#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {21673#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:52:43,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {21673#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21674#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:52:43,790 INFO L290 TraceCheckUtils]: 62: Hoare triple {21674#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {21674#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:52:43,803 INFO L290 TraceCheckUtils]: 63: Hoare triple {21674#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21675#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:52:43,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {21675#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21675#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:52:43,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {21675#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21676#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:52:43,817 INFO L290 TraceCheckUtils]: 66: Hoare triple {21676#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {21676#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:52:43,829 INFO L290 TraceCheckUtils]: 67: Hoare triple {21676#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21677#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:52:43,830 INFO L290 TraceCheckUtils]: 68: Hoare triple {21677#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {21677#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:52:43,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {21677#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21678#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:52:43,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {21678#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {21678#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:52:43,846 INFO L290 TraceCheckUtils]: 71: Hoare triple {21678#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21679#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:52:43,847 INFO L290 TraceCheckUtils]: 72: Hoare triple {21679#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {21679#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:52:43,848 INFO L290 TraceCheckUtils]: 73: Hoare triple {21679#(and (<= main_~x~0 33) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {21642#false} is VALID [2022-04-15 12:52:43,848 INFO L290 TraceCheckUtils]: 74: Hoare triple {21642#false} assume !(~x~0 % 4294967296 < 100000000); {21642#false} is VALID [2022-04-15 12:52:43,848 INFO L272 TraceCheckUtils]: 75: Hoare triple {21642#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {21642#false} is VALID [2022-04-15 12:52:43,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {21642#false} ~cond := #in~cond; {21642#false} is VALID [2022-04-15 12:52:43,849 INFO L290 TraceCheckUtils]: 77: Hoare triple {21642#false} assume 0 == ~cond; {21642#false} is VALID [2022-04-15 12:52:43,849 INFO L290 TraceCheckUtils]: 78: Hoare triple {21642#false} assume !false; {21642#false} is VALID [2022-04-15 12:52:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:52:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:52:43,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004072776] [2022-04-15 12:52:43,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004072776] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:52:43,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671796961] [2022-04-15 12:52:43,850 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:52:43,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:52:43,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:52:43,851 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:52:43,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 12:52:43,903 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:52:43,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:52:43,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:52:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:52:43,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:52:44,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {21641#true} call ULTIMATE.init(); {21641#true} is VALID [2022-04-15 12:52:44,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {21641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21641#true} is VALID [2022-04-15 12:52:44,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {21641#true} assume true; {21641#true} is VALID [2022-04-15 12:52:44,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21641#true} {21641#true} #40#return; {21641#true} is VALID [2022-04-15 12:52:44,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {21641#true} call #t~ret5 := main(); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {21641#true} ~x~0 := 0; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 41: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,392 INFO L290 TraceCheckUtils]: 48: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 50: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 53: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 54: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 55: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 57: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 58: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 59: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 65: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 66: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 67: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 68: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 69: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:44,394 INFO L290 TraceCheckUtils]: 70: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:44,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21897#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:52:44,398 INFO L290 TraceCheckUtils]: 72: Hoare triple {21897#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {21897#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:52:44,402 INFO L290 TraceCheckUtils]: 73: Hoare triple {21897#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {21904#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:52:44,405 INFO L290 TraceCheckUtils]: 74: Hoare triple {21904#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {21642#false} is VALID [2022-04-15 12:52:44,405 INFO L272 TraceCheckUtils]: 75: Hoare triple {21642#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {21642#false} is VALID [2022-04-15 12:52:44,405 INFO L290 TraceCheckUtils]: 76: Hoare triple {21642#false} ~cond := #in~cond; {21642#false} is VALID [2022-04-15 12:52:44,405 INFO L290 TraceCheckUtils]: 77: Hoare triple {21642#false} assume 0 == ~cond; {21642#false} is VALID [2022-04-15 12:52:44,405 INFO L290 TraceCheckUtils]: 78: Hoare triple {21642#false} assume !false; {21642#false} is VALID [2022-04-15 12:52:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-04-15 12:52:44,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:52:45,887 INFO L290 TraceCheckUtils]: 78: Hoare triple {21642#false} assume !false; {21642#false} is VALID [2022-04-15 12:52:45,887 INFO L290 TraceCheckUtils]: 77: Hoare triple {21923#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {21642#false} is VALID [2022-04-15 12:52:45,888 INFO L290 TraceCheckUtils]: 76: Hoare triple {21927#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {21923#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:52:45,888 INFO L272 TraceCheckUtils]: 75: Hoare triple {21931#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {21927#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:52:45,888 INFO L290 TraceCheckUtils]: 74: Hoare triple {21935#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {21931#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:52:45,892 INFO L290 TraceCheckUtils]: 73: Hoare triple {21939#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {21935#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:52:45,892 INFO L290 TraceCheckUtils]: 72: Hoare triple {21943#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {21939#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 71: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21943#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 70: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 69: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 68: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 67: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 66: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,906 INFO L290 TraceCheckUtils]: 65: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 64: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 63: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 62: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 61: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 58: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 56: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 55: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 50: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 43: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 42: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 41: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 40: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 39: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 38: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 37: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 31: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 30: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 18: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {21641#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {21641#true} assume !!(~x~0 % 4294967296 < 100000000); {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {21641#true} ~x~0 := 0; {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {21641#true} call #t~ret5 := main(); {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21641#true} {21641#true} #40#return; {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {21641#true} assume true; {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {21641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {21641#true} call ULTIMATE.init(); {21641#true} is VALID [2022-04-15 12:52:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2022-04-15 12:52:45,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671796961] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:52:45,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:52:45,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 4, 8] total 45 [2022-04-15 12:52:45,912 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:52:45,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [73254784] [2022-04-15 12:52:45,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [73254784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:52:45,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:52:45,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 12:52:45,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568922992] [2022-04-15 12:52:45,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:52:45,912 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 12:52:45,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:52:45,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:52:46,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:52:46,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 12:52:46,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:52:46,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 12:52:46,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1717, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:52:46,807 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:36,187 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-15 12:53:36,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:53:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-15 12:53:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:53:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 12:53:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 91 transitions. [2022-04-15 12:53:36,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 91 transitions. [2022-04-15 12:53:37,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:37,193 INFO L225 Difference]: With dead ends: 90 [2022-04-15 12:53:37,193 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:53:37,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=599, Invalid=5563, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:53:37,194 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:53:37,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 144 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 16.3s Time] [2022-04-15 12:53:37,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:53:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 12:53:37,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:53:37,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,378 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,378 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,379 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-15 12:53:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:53:37,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:37,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:37,380 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:53:37,380 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:53:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:53:37,380 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-04-15 12:53:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:53:37,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:53:37,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:53:37,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:53:37,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:53:37,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2022-04-15 12:53:37,381 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 79 [2022-04-15 12:53:37,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:53:37,382 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2022-04-15 12:53:37,382 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 36 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:53:37,382 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 85 transitions. [2022-04-15 12:53:38,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:53:38,453 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2022-04-15 12:53:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 12:53:38,453 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:53:38,453 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:53:38,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 12:53:38,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67,SelfDestructingSolverStorable68 [2022-04-15 12:53:38,654 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:53:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:53:38,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1119534953, now seen corresponding path program 67 times [2022-04-15 12:53:38,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:53:38,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633782803] [2022-04-15 12:53:38,889 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:53:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash 706406193, now seen corresponding path program 1 times [2022-04-15 12:53:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:38,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832148933] [2022-04-15 12:53:38,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:53:38,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:53:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:53:38,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:53:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1119534953, now seen corresponding path program 68 times [2022-04-15 12:53:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:53:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838457250] [2022-04-15 12:53:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:53:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:53:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:39,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:53:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:39,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {22782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22742#true} is VALID [2022-04-15 12:53:39,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {22742#true} assume true; {22742#true} is VALID [2022-04-15 12:53:39,674 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22742#true} {22742#true} #40#return; {22742#true} is VALID [2022-04-15 12:53:39,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {22742#true} call ULTIMATE.init(); {22782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:53:39,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {22782#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22742#true} is VALID [2022-04-15 12:53:39,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {22742#true} assume true; {22742#true} is VALID [2022-04-15 12:53:39,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22742#true} {22742#true} #40#return; {22742#true} is VALID [2022-04-15 12:53:39,675 INFO L272 TraceCheckUtils]: 4: Hoare triple {22742#true} call #t~ret5 := main(); {22742#true} is VALID [2022-04-15 12:53:39,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {22742#true} ~x~0 := 0; {22747#(= main_~x~0 0)} is VALID [2022-04-15 12:53:39,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {22747#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {22747#(= main_~x~0 0)} is VALID [2022-04-15 12:53:39,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {22747#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:53:39,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:53:39,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:53:39,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:53:39,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:53:39,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:53:39,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:53:39,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:53:39,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:53:39,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:53:39,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:53:39,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:53:39,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:53:39,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:53:39,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:53:39,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:53:39,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:53:39,928 INFO L290 TraceCheckUtils]: 24: Hoare triple {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:53:39,961 INFO L290 TraceCheckUtils]: 25: Hoare triple {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:53:39,962 INFO L290 TraceCheckUtils]: 26: Hoare triple {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:53:39,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:53:39,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:53:40,020 INFO L290 TraceCheckUtils]: 29: Hoare triple {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:53:40,021 INFO L290 TraceCheckUtils]: 30: Hoare triple {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:53:40,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:53:40,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:53:40,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:53:40,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:53:40,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:53:40,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:53:40,146 INFO L290 TraceCheckUtils]: 37: Hoare triple {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:53:40,147 INFO L290 TraceCheckUtils]: 38: Hoare triple {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:53:40,178 INFO L290 TraceCheckUtils]: 39: Hoare triple {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:53:40,179 INFO L290 TraceCheckUtils]: 40: Hoare triple {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:53:40,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:53:40,214 INFO L290 TraceCheckUtils]: 42: Hoare triple {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:53:40,238 INFO L290 TraceCheckUtils]: 43: Hoare triple {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:53:40,239 INFO L290 TraceCheckUtils]: 44: Hoare triple {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:53:40,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:53:40,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:53:40,306 INFO L290 TraceCheckUtils]: 47: Hoare triple {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:53:40,306 INFO L290 TraceCheckUtils]: 48: Hoare triple {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:53:40,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:53:40,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:53:40,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:53:40,374 INFO L290 TraceCheckUtils]: 52: Hoare triple {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:53:40,409 INFO L290 TraceCheckUtils]: 53: Hoare triple {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:53:40,409 INFO L290 TraceCheckUtils]: 54: Hoare triple {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:53:40,442 INFO L290 TraceCheckUtils]: 55: Hoare triple {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:53:40,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:53:40,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:53:40,478 INFO L290 TraceCheckUtils]: 58: Hoare triple {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:53:40,502 INFO L290 TraceCheckUtils]: 59: Hoare triple {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:53:40,502 INFO L290 TraceCheckUtils]: 60: Hoare triple {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:53:40,537 INFO L290 TraceCheckUtils]: 61: Hoare triple {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:53:40,537 INFO L290 TraceCheckUtils]: 62: Hoare triple {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:53:40,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:53:40,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:53:40,603 INFO L290 TraceCheckUtils]: 65: Hoare triple {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:53:40,604 INFO L290 TraceCheckUtils]: 66: Hoare triple {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:53:40,637 INFO L290 TraceCheckUtils]: 67: Hoare triple {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:53:40,638 INFO L290 TraceCheckUtils]: 68: Hoare triple {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:53:40,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:53:40,672 INFO L290 TraceCheckUtils]: 70: Hoare triple {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:53:40,706 INFO L290 TraceCheckUtils]: 71: Hoare triple {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:53:40,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:53:40,720 INFO L290 TraceCheckUtils]: 73: Hoare triple {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22781#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:53:40,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {22781#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {22781#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:53:40,722 INFO L290 TraceCheckUtils]: 75: Hoare triple {22781#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {22743#false} is VALID [2022-04-15 12:53:40,722 INFO L290 TraceCheckUtils]: 76: Hoare triple {22743#false} assume !(~x~0 % 4294967296 < 100000000); {22743#false} is VALID [2022-04-15 12:53:40,722 INFO L272 TraceCheckUtils]: 77: Hoare triple {22743#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {22743#false} is VALID [2022-04-15 12:53:40,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {22743#false} ~cond := #in~cond; {22743#false} is VALID [2022-04-15 12:53:40,722 INFO L290 TraceCheckUtils]: 79: Hoare triple {22743#false} assume 0 == ~cond; {22743#false} is VALID [2022-04-15 12:53:40,722 INFO L290 TraceCheckUtils]: 80: Hoare triple {22743#false} assume !false; {22743#false} is VALID [2022-04-15 12:53:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:53:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838457250] [2022-04-15 12:53:40,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838457250] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:53:40,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322748235] [2022-04-15 12:53:40,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:53:40,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:53:40,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:53:40,724 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:53:40,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 12:53:40,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:53:40,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:53:40,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-15 12:53:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:53:40,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:53:41,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {22742#true} call ULTIMATE.init(); {22742#true} is VALID [2022-04-15 12:53:41,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {22742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22742#true} is VALID [2022-04-15 12:53:41,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {22742#true} assume true; {22742#true} is VALID [2022-04-15 12:53:41,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22742#true} {22742#true} #40#return; {22742#true} is VALID [2022-04-15 12:53:41,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {22742#true} call #t~ret5 := main(); {22742#true} is VALID [2022-04-15 12:53:41,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {22742#true} ~x~0 := 0; {22747#(= main_~x~0 0)} is VALID [2022-04-15 12:53:41,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {22747#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {22747#(= main_~x~0 0)} is VALID [2022-04-15 12:53:41,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {22747#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:53:41,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:53:41,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {22748#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:53:41,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:53:41,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {22749#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:53:41,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:53:41,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {22750#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:53:41,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:53:41,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {22751#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:53:41,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:53:41,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {22752#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:53:41,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:53:41,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {22753#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:53:41,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:53:41,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {22754#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:53:41,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:53:41,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {22755#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:53:41,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:53:41,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {22756#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:53:41,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:53:41,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {22757#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:53:41,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:53:41,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {22758#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:53:41,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:53:41,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {22759#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:53:41,921 INFO L290 TraceCheckUtils]: 32: Hoare triple {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:53:41,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {22760#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:53:41,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:53:41,978 INFO L290 TraceCheckUtils]: 35: Hoare triple {22761#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:53:41,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:53:42,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {22762#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:53:42,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:53:42,046 INFO L290 TraceCheckUtils]: 39: Hoare triple {22763#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:53:42,047 INFO L290 TraceCheckUtils]: 40: Hoare triple {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:53:42,079 INFO L290 TraceCheckUtils]: 41: Hoare triple {22764#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:53:42,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:53:42,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {22765#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:53:42,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:53:42,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {22766#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:53:42,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:53:42,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {22767#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:53:42,169 INFO L290 TraceCheckUtils]: 48: Hoare triple {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:53:42,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {22768#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:53:42,202 INFO L290 TraceCheckUtils]: 50: Hoare triple {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:53:42,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {22769#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:53:42,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:53:42,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {22770#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:53:42,267 INFO L290 TraceCheckUtils]: 54: Hoare triple {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:53:42,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {22771#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:53:42,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:53:42,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {22772#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:53:42,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:53:42,355 INFO L290 TraceCheckUtils]: 59: Hoare triple {22773#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:53:42,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:53:42,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {22774#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:53:42,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:53:42,422 INFO L290 TraceCheckUtils]: 63: Hoare triple {22775#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:53:42,423 INFO L290 TraceCheckUtils]: 64: Hoare triple {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:53:42,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {22776#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:53:42,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:53:42,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {22777#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:53:42,490 INFO L290 TraceCheckUtils]: 68: Hoare triple {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:53:42,520 INFO L290 TraceCheckUtils]: 69: Hoare triple {22778#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:53:42,521 INFO L290 TraceCheckUtils]: 70: Hoare triple {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:53:42,552 INFO L290 TraceCheckUtils]: 71: Hoare triple {22779#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:53:42,553 INFO L290 TraceCheckUtils]: 72: Hoare triple {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:53:42,584 INFO L290 TraceCheckUtils]: 73: Hoare triple {22780#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23005#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:53:42,584 INFO L290 TraceCheckUtils]: 74: Hoare triple {23005#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23005#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:53:42,616 INFO L290 TraceCheckUtils]: 75: Hoare triple {23005#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23012#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:53:42,622 INFO L290 TraceCheckUtils]: 76: Hoare triple {23012#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 100000000); {22743#false} is VALID [2022-04-15 12:53:42,622 INFO L272 TraceCheckUtils]: 77: Hoare triple {22743#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {22743#false} is VALID [2022-04-15 12:53:42,622 INFO L290 TraceCheckUtils]: 78: Hoare triple {22743#false} ~cond := #in~cond; {22743#false} is VALID [2022-04-15 12:53:42,622 INFO L290 TraceCheckUtils]: 79: Hoare triple {22743#false} assume 0 == ~cond; {22743#false} is VALID [2022-04-15 12:53:42,622 INFO L290 TraceCheckUtils]: 80: Hoare triple {22743#false} assume !false; {22743#false} is VALID [2022-04-15 12:53:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:42,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:53:59,655 INFO L290 TraceCheckUtils]: 80: Hoare triple {22743#false} assume !false; {22743#false} is VALID [2022-04-15 12:53:59,655 INFO L290 TraceCheckUtils]: 79: Hoare triple {23031#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22743#false} is VALID [2022-04-15 12:53:59,656 INFO L290 TraceCheckUtils]: 78: Hoare triple {23035#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {23031#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:53:59,656 INFO L272 TraceCheckUtils]: 77: Hoare triple {23039#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {23035#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:53:59,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {23043#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {23039#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:53:59,661 INFO L290 TraceCheckUtils]: 75: Hoare triple {23047#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23043#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {23047#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23047#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {23054#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23047#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,673 INFO L290 TraceCheckUtils]: 72: Hoare triple {23054#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23054#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,679 INFO L290 TraceCheckUtils]: 71: Hoare triple {23061#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23054#(or (= (mod (+ main_~x~0 3) 4294967296) 100000001) (< (mod (+ main_~x~0 3) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,679 INFO L290 TraceCheckUtils]: 70: Hoare triple {23061#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23061#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,680 INFO L290 TraceCheckUtils]: 69: Hoare triple {23068#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23061#(or (< (mod (+ main_~x~0 4) 4294967296) 100000000) (= (mod (+ main_~x~0 4) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,681 INFO L290 TraceCheckUtils]: 68: Hoare triple {23068#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23068#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,690 INFO L290 TraceCheckUtils]: 67: Hoare triple {23075#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23068#(or (= 100000001 (mod (+ 5 main_~x~0) 4294967296)) (< (mod (+ 5 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,690 INFO L290 TraceCheckUtils]: 66: Hoare triple {23075#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23075#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:53:59,697 INFO L290 TraceCheckUtils]: 65: Hoare triple {23082#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23075#(or (< (mod (+ main_~x~0 6) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 6) 4294967296)))} is VALID [2022-04-15 12:53:59,697 INFO L290 TraceCheckUtils]: 64: Hoare triple {23082#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23082#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:53:59,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {23089#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23082#(or (< (mod (+ 7 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 7 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:53:59,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {23089#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23089#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:53:59,707 INFO L290 TraceCheckUtils]: 61: Hoare triple {23096#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23089#(or (< (mod (+ main_~x~0 8) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 8) 4294967296)))} is VALID [2022-04-15 12:53:59,707 INFO L290 TraceCheckUtils]: 60: Hoare triple {23096#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23096#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,714 INFO L290 TraceCheckUtils]: 59: Hoare triple {23103#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23096#(or (< (mod (+ main_~x~0 9) 4294967296) 100000000) (= (mod (+ main_~x~0 9) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,715 INFO L290 TraceCheckUtils]: 58: Hoare triple {23103#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23103#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,720 INFO L290 TraceCheckUtils]: 57: Hoare triple {23110#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23103#(or (< (mod (+ main_~x~0 10) 4294967296) 100000000) (= (mod (+ main_~x~0 10) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,720 INFO L290 TraceCheckUtils]: 56: Hoare triple {23110#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23110#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {23117#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23110#(or (< (mod (+ main_~x~0 11) 4294967296) 100000000) (= (mod (+ main_~x~0 11) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,722 INFO L290 TraceCheckUtils]: 54: Hoare triple {23117#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23117#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,728 INFO L290 TraceCheckUtils]: 53: Hoare triple {23124#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23117#(or (= 100000001 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,729 INFO L290 TraceCheckUtils]: 52: Hoare triple {23124#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23124#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-15 12:53:59,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {23131#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23124#(or (< (mod (+ main_~x~0 13) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 13) 4294967296)))} is VALID [2022-04-15 12:53:59,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {23131#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23131#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {23138#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23131#(or (= (mod (+ main_~x~0 14) 4294967296) 100000001) (< (mod (+ main_~x~0 14) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,738 INFO L290 TraceCheckUtils]: 48: Hoare triple {23138#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23138#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-15 12:53:59,749 INFO L290 TraceCheckUtils]: 47: Hoare triple {23145#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23138#(or (< (mod (+ main_~x~0 15) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 15) 4294967296)))} is VALID [2022-04-15 12:53:59,750 INFO L290 TraceCheckUtils]: 46: Hoare triple {23145#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23145#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {23152#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23145#(or (= (mod (+ main_~x~0 16) 4294967296) 100000001) (< (mod (+ main_~x~0 16) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,759 INFO L290 TraceCheckUtils]: 44: Hoare triple {23152#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23152#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-15 12:53:59,765 INFO L290 TraceCheckUtils]: 43: Hoare triple {23159#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23152#(or (< (mod (+ main_~x~0 17) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 17) 4294967296)))} is VALID [2022-04-15 12:53:59,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {23159#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23159#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,773 INFO L290 TraceCheckUtils]: 41: Hoare triple {23166#(or (< (mod (+ 19 main_~x~0) 4294967296) 100000000) (= (mod (+ 19 main_~x~0) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23159#(or (= (mod (+ main_~x~0 18) 4294967296) 100000001) (< (mod (+ main_~x~0 18) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {23166#(or (< (mod (+ 19 main_~x~0) 4294967296) 100000000) (= (mod (+ 19 main_~x~0) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23166#(or (< (mod (+ 19 main_~x~0) 4294967296) 100000000) (= (mod (+ 19 main_~x~0) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {23173#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= (mod (+ main_~x~0 20) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23166#(or (< (mod (+ 19 main_~x~0) 4294967296) 100000000) (= (mod (+ 19 main_~x~0) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {23173#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= (mod (+ main_~x~0 20) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23173#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= (mod (+ main_~x~0 20) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {23180#(or (= 100000001 (mod (+ main_~x~0 21) 4294967296)) (< (mod (+ main_~x~0 21) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23173#(or (< (mod (+ main_~x~0 20) 4294967296) 100000000) (= (mod (+ main_~x~0 20) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,782 INFO L290 TraceCheckUtils]: 36: Hoare triple {23180#(or (= 100000001 (mod (+ main_~x~0 21) 4294967296)) (< (mod (+ main_~x~0 21) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23180#(or (= 100000001 (mod (+ main_~x~0 21) 4294967296)) (< (mod (+ main_~x~0 21) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {23187#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (= (mod (+ main_~x~0 22) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23180#(or (= 100000001 (mod (+ main_~x~0 21) 4294967296)) (< (mod (+ main_~x~0 21) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {23187#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (= (mod (+ main_~x~0 22) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23187#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (= (mod (+ main_~x~0 22) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {23194#(or (= (mod (+ 23 main_~x~0) 4294967296) 100000001) (< (mod (+ 23 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23187#(or (< (mod (+ main_~x~0 22) 4294967296) 100000000) (= (mod (+ main_~x~0 22) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {23194#(or (= (mod (+ 23 main_~x~0) 4294967296) 100000001) (< (mod (+ 23 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23194#(or (= (mod (+ 23 main_~x~0) 4294967296) 100000001) (< (mod (+ 23 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {23201#(or (= 100000001 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23194#(or (= (mod (+ 23 main_~x~0) 4294967296) 100000001) (< (mod (+ 23 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {23201#(or (= 100000001 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23201#(or (= 100000001 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {23208#(or (= 100000001 (mod (+ main_~x~0 25) 4294967296)) (< (mod (+ main_~x~0 25) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23201#(or (= 100000001 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {23208#(or (= 100000001 (mod (+ main_~x~0 25) 4294967296)) (< (mod (+ main_~x~0 25) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23208#(or (= 100000001 (mod (+ main_~x~0 25) 4294967296)) (< (mod (+ main_~x~0 25) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,818 INFO L290 TraceCheckUtils]: 27: Hoare triple {23215#(or (= (mod (+ main_~x~0 26) 4294967296) 100000001) (< (mod (+ main_~x~0 26) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23208#(or (= 100000001 (mod (+ main_~x~0 25) 4294967296)) (< (mod (+ main_~x~0 25) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,819 INFO L290 TraceCheckUtils]: 26: Hoare triple {23215#(or (= (mod (+ main_~x~0 26) 4294967296) 100000001) (< (mod (+ main_~x~0 26) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23215#(or (= (mod (+ main_~x~0 26) 4294967296) 100000001) (< (mod (+ main_~x~0 26) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {23222#(or (= (mod (+ main_~x~0 27) 4294967296) 100000001) (< (mod (+ main_~x~0 27) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23215#(or (= (mod (+ main_~x~0 26) 4294967296) 100000001) (< (mod (+ main_~x~0 26) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {23222#(or (= (mod (+ main_~x~0 27) 4294967296) 100000001) (< (mod (+ main_~x~0 27) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23222#(or (= (mod (+ main_~x~0 27) 4294967296) 100000001) (< (mod (+ main_~x~0 27) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {23229#(or (= (mod (+ main_~x~0 28) 4294967296) 100000001) (< (mod (+ main_~x~0 28) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23222#(or (= (mod (+ main_~x~0 27) 4294967296) 100000001) (< (mod (+ main_~x~0 27) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {23229#(or (= (mod (+ main_~x~0 28) 4294967296) 100000001) (< (mod (+ main_~x~0 28) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23229#(or (= (mod (+ main_~x~0 28) 4294967296) 100000001) (< (mod (+ main_~x~0 28) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {23236#(or (= 100000001 (mod (+ 29 main_~x~0) 4294967296)) (< (mod (+ 29 main_~x~0) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23229#(or (= (mod (+ main_~x~0 28) 4294967296) 100000001) (< (mod (+ main_~x~0 28) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {23236#(or (= 100000001 (mod (+ 29 main_~x~0) 4294967296)) (< (mod (+ 29 main_~x~0) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23236#(or (= 100000001 (mod (+ 29 main_~x~0) 4294967296)) (< (mod (+ 29 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {23243#(or (< (mod (+ 30 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 30 main_~x~0) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23236#(or (= 100000001 (mod (+ 29 main_~x~0) 4294967296)) (< (mod (+ 29 main_~x~0) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {23243#(or (< (mod (+ 30 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 30 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23243#(or (< (mod (+ 30 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:53:59,854 INFO L290 TraceCheckUtils]: 17: Hoare triple {23250#(or (< (mod (+ main_~x~0 31) 4294967296) 100000000) (= (mod (+ main_~x~0 31) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23243#(or (< (mod (+ 30 main_~x~0) 4294967296) 100000000) (= 100000001 (mod (+ 30 main_~x~0) 4294967296)))} is VALID [2022-04-15 12:53:59,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {23250#(or (< (mod (+ main_~x~0 31) 4294967296) 100000000) (= (mod (+ main_~x~0 31) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23250#(or (< (mod (+ main_~x~0 31) 4294967296) 100000000) (= (mod (+ main_~x~0 31) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {23257#(or (< (mod (+ 32 main_~x~0) 4294967296) 100000000) (= (mod (+ 32 main_~x~0) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23250#(or (< (mod (+ main_~x~0 31) 4294967296) 100000000) (= (mod (+ main_~x~0 31) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {23257#(or (< (mod (+ 32 main_~x~0) 4294967296) 100000000) (= (mod (+ 32 main_~x~0) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23257#(or (< (mod (+ 32 main_~x~0) 4294967296) 100000000) (= (mod (+ 32 main_~x~0) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {23264#(or (= 100000001 (mod (+ main_~x~0 33) 4294967296)) (< (mod (+ main_~x~0 33) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23257#(or (< (mod (+ 32 main_~x~0) 4294967296) 100000000) (= (mod (+ 32 main_~x~0) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {23264#(or (= 100000001 (mod (+ main_~x~0 33) 4294967296)) (< (mod (+ main_~x~0 33) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23264#(or (= 100000001 (mod (+ main_~x~0 33) 4294967296)) (< (mod (+ main_~x~0 33) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {23271#(or (< (mod (+ main_~x~0 34) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 34) 4294967296)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23264#(or (= 100000001 (mod (+ main_~x~0 33) 4294967296)) (< (mod (+ main_~x~0 33) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {23271#(or (< (mod (+ main_~x~0 34) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 100000000); {23271#(or (< (mod (+ main_~x~0 34) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-15 12:53:59,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {23278#(or (< (mod (+ 35 main_~x~0) 4294967296) 100000000) (= (mod (+ 35 main_~x~0) 4294967296) 100000001))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23271#(or (< (mod (+ main_~x~0 34) 4294967296) 100000000) (= 100000001 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-15 12:53:59,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {23278#(or (< (mod (+ 35 main_~x~0) 4294967296) 100000000) (= (mod (+ 35 main_~x~0) 4294967296) 100000001))} assume !!(~x~0 % 4294967296 < 100000000); {23278#(or (< (mod (+ 35 main_~x~0) 4294967296) 100000000) (= (mod (+ 35 main_~x~0) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {23285#(or (= (mod (+ main_~x~0 36) 4294967296) 100000001) (< (mod (+ main_~x~0 36) 4294967296) 100000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23278#(or (< (mod (+ 35 main_~x~0) 4294967296) 100000000) (= (mod (+ 35 main_~x~0) 4294967296) 100000001))} is VALID [2022-04-15 12:53:59,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {23285#(or (= (mod (+ main_~x~0 36) 4294967296) 100000001) (< (mod (+ main_~x~0 36) 4294967296) 100000000))} assume !!(~x~0 % 4294967296 < 100000000); {23285#(or (= (mod (+ main_~x~0 36) 4294967296) 100000001) (< (mod (+ main_~x~0 36) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {22742#true} ~x~0 := 0; {23285#(or (= (mod (+ main_~x~0 36) 4294967296) 100000001) (< (mod (+ main_~x~0 36) 4294967296) 100000000))} is VALID [2022-04-15 12:53:59,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {22742#true} call #t~ret5 := main(); {22742#true} is VALID [2022-04-15 12:53:59,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22742#true} {22742#true} #40#return; {22742#true} is VALID [2022-04-15 12:53:59,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {22742#true} assume true; {22742#true} is VALID [2022-04-15 12:53:59,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {22742#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {22742#true} is VALID [2022-04-15 12:53:59,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {22742#true} call ULTIMATE.init(); {22742#true} is VALID [2022-04-15 12:53:59,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:53:59,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322748235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:53:59,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:53:59,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 41] total 79 [2022-04-15 12:53:59,900 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:53:59,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633782803] [2022-04-15 12:53:59,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633782803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:53:59,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:53:59,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:53:59,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105421995] [2022-04-15 12:53:59,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:53:59,900 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 12:53:59,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:53:59,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:54:01,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:54:01,443 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:54:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:54:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:54:01,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1523, Invalid=4639, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:54:01,444 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:16,866 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 12:55:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 12:55:16,866 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-15 12:55:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:55:16,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 12:55:16,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 93 transitions. [2022-04-15 12:55:16,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 93 transitions. [2022-04-15 12:55:18,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:18,622 INFO L225 Difference]: With dead ends: 92 [2022-04-15 12:55:18,623 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 12:55:18,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=2991, Invalid=9891, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 12:55:18,624 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:55:18,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 24 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 26.2s Time] [2022-04-15 12:55:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 12:55:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 12:55:18,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:55:18,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:18,843 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:18,844 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:18,844 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-15 12:55:18,844 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:55:18,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:18,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:18,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 12:55:18,845 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 85 states. [2022-04-15 12:55:18,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:55:18,846 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2022-04-15 12:55:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:55:18,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:55:18,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:55:18,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:55:18,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:55:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2022-04-15 12:55:18,847 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 81 [2022-04-15 12:55:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:55:18,847 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2022-04-15 12:55:18,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 37 states have internal predecessors, (77), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:55:18,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 87 transitions. [2022-04-15 12:55:19,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:55:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2022-04-15 12:55:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 12:55:19,949 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:55:19,949 INFO L499 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:55:19,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 12:55:20,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2022-04-15 12:55:20,150 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:55:20,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:55:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -189328780, now seen corresponding path program 69 times [2022-04-15 12:55:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:55:20,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2028315249] [2022-04-15 12:55:20,364 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:55:20,365 INFO L85 PathProgramCache]: Analyzing trace with hash 765511537, now seen corresponding path program 1 times [2022-04-15 12:55:20,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:20,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545953715] [2022-04-15 12:55:20,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:20,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:55:20,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:55:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:55:20,377 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:55:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash -189328780, now seen corresponding path program 70 times [2022-04-15 12:55:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:55:20,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633595459] [2022-04-15 12:55:20,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:55:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:55:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:55:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:21,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {23944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23903#true} is VALID [2022-04-15 12:55:21,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {23903#true} assume true; {23903#true} is VALID [2022-04-15 12:55:21,175 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23903#true} {23903#true} #40#return; {23903#true} is VALID [2022-04-15 12:55:21,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {23903#true} call ULTIMATE.init(); {23944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:55:21,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {23944#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23903#true} is VALID [2022-04-15 12:55:21,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {23903#true} assume true; {23903#true} is VALID [2022-04-15 12:55:21,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23903#true} {23903#true} #40#return; {23903#true} is VALID [2022-04-15 12:55:21,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {23903#true} call #t~ret5 := main(); {23903#true} is VALID [2022-04-15 12:55:21,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {23903#true} ~x~0 := 0; {23908#(= main_~x~0 0)} is VALID [2022-04-15 12:55:21,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {23908#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {23908#(= main_~x~0 0)} is VALID [2022-04-15 12:55:21,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {23908#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:55:21,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:55:21,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:55:21,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:55:21,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:55:21,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:55:21,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:55:21,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:55:21,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:55:21,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:55:21,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:55:21,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:55:21,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:55:21,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:55:21,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:55:21,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:55:21,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:55:21,347 INFO L290 TraceCheckUtils]: 24: Hoare triple {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:55:21,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:55:21,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:55:21,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:55:21,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:55:21,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:55:21,398 INFO L290 TraceCheckUtils]: 30: Hoare triple {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:55:21,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:55:21,414 INFO L290 TraceCheckUtils]: 32: Hoare triple {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:55:21,426 INFO L290 TraceCheckUtils]: 33: Hoare triple {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:55:21,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:55:21,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:55:21,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:55:21,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:55:21,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:55:21,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:55:21,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:55:21,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:55:21,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:55:21,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:55:21,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:55:21,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:55:21,545 INFO L290 TraceCheckUtils]: 46: Hoare triple {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:55:21,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:55:21,568 INFO L290 TraceCheckUtils]: 48: Hoare triple {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:55:21,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:55:21,591 INFO L290 TraceCheckUtils]: 50: Hoare triple {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:55:21,612 INFO L290 TraceCheckUtils]: 51: Hoare triple {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:55:21,613 INFO L290 TraceCheckUtils]: 52: Hoare triple {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:55:21,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:55:21,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:55:21,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:55:21,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:55:21,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:55:21,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:55:21,695 INFO L290 TraceCheckUtils]: 59: Hoare triple {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:55:21,695 INFO L290 TraceCheckUtils]: 60: Hoare triple {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:55:21,715 INFO L290 TraceCheckUtils]: 61: Hoare triple {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:55:21,715 INFO L290 TraceCheckUtils]: 62: Hoare triple {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:55:21,736 INFO L290 TraceCheckUtils]: 63: Hoare triple {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:55:21,736 INFO L290 TraceCheckUtils]: 64: Hoare triple {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:55:21,759 INFO L290 TraceCheckUtils]: 65: Hoare triple {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:55:21,759 INFO L290 TraceCheckUtils]: 66: Hoare triple {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:55:21,780 INFO L290 TraceCheckUtils]: 67: Hoare triple {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:55:21,781 INFO L290 TraceCheckUtils]: 68: Hoare triple {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:55:21,800 INFO L290 TraceCheckUtils]: 69: Hoare triple {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:55:21,803 INFO L290 TraceCheckUtils]: 70: Hoare triple {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:55:21,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:55:21,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:55:21,847 INFO L290 TraceCheckUtils]: 73: Hoare triple {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:55:21,847 INFO L290 TraceCheckUtils]: 74: Hoare triple {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:55:21,853 INFO L290 TraceCheckUtils]: 75: Hoare triple {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23943#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:55:21,854 INFO L290 TraceCheckUtils]: 76: Hoare triple {23943#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {23943#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:55:21,855 INFO L290 TraceCheckUtils]: 77: Hoare triple {23943#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23904#false} is VALID [2022-04-15 12:55:21,855 INFO L290 TraceCheckUtils]: 78: Hoare triple {23904#false} assume !(~x~0 % 4294967296 < 100000000); {23904#false} is VALID [2022-04-15 12:55:21,863 INFO L272 TraceCheckUtils]: 79: Hoare triple {23904#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {23904#false} is VALID [2022-04-15 12:55:21,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {23904#false} ~cond := #in~cond; {23904#false} is VALID [2022-04-15 12:55:21,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {23904#false} assume 0 == ~cond; {23904#false} is VALID [2022-04-15 12:55:21,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {23904#false} assume !false; {23904#false} is VALID [2022-04-15 12:55:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:55:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633595459] [2022-04-15 12:55:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633595459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:55:21,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373119050] [2022-04-15 12:55:21,865 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:55:21,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:55:21,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:55:21,866 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:55:21,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 12:55:21,959 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:55:21,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:55:21,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-15 12:55:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:55:21,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:55:22,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {23903#true} call ULTIMATE.init(); {23903#true} is VALID [2022-04-15 12:55:22,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {23903#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23903#true} is VALID [2022-04-15 12:55:22,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {23903#true} assume true; {23903#true} is VALID [2022-04-15 12:55:22,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23903#true} {23903#true} #40#return; {23903#true} is VALID [2022-04-15 12:55:22,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {23903#true} call #t~ret5 := main(); {23903#true} is VALID [2022-04-15 12:55:22,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {23903#true} ~x~0 := 0; {23908#(= main_~x~0 0)} is VALID [2022-04-15 12:55:22,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {23908#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {23908#(= main_~x~0 0)} is VALID [2022-04-15 12:55:22,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {23908#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:55:22,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:55:22,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {23909#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:55:22,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:55:22,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {23910#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:55:22,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:55:22,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {23911#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:55:22,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:55:22,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {23912#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:55:22,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:55:22,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {23913#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:55:22,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:55:22,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {23914#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:55:22,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:55:22,742 INFO L290 TraceCheckUtils]: 21: Hoare triple {23915#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:55:22,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:55:22,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {23916#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:55:22,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:55:22,779 INFO L290 TraceCheckUtils]: 25: Hoare triple {23917#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:55:22,780 INFO L290 TraceCheckUtils]: 26: Hoare triple {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:55:22,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {23918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:55:22,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:55:22,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {23919#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:55:22,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:55:22,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {23920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:55:22,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:55:22,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {23921#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:55:22,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:55:22,854 INFO L290 TraceCheckUtils]: 35: Hoare triple {23922#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:55:22,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:55:22,877 INFO L290 TraceCheckUtils]: 37: Hoare triple {23923#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:55:22,877 INFO L290 TraceCheckUtils]: 38: Hoare triple {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:55:22,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {23924#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:55:22,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:55:22,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {23925#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:55:22,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:55:22,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {23926#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:55:22,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:55:22,962 INFO L290 TraceCheckUtils]: 45: Hoare triple {23927#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:55:22,963 INFO L290 TraceCheckUtils]: 46: Hoare triple {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:55:22,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {23928#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:55:22,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:55:23,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {23929#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:55:23,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:55:23,020 INFO L290 TraceCheckUtils]: 51: Hoare triple {23930#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:55:23,020 INFO L290 TraceCheckUtils]: 52: Hoare triple {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:55:23,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {23931#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:55:23,039 INFO L290 TraceCheckUtils]: 54: Hoare triple {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:55:23,056 INFO L290 TraceCheckUtils]: 55: Hoare triple {23932#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:55:23,057 INFO L290 TraceCheckUtils]: 56: Hoare triple {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:55:23,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {23933#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:55:23,074 INFO L290 TraceCheckUtils]: 58: Hoare triple {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:55:23,085 INFO L290 TraceCheckUtils]: 59: Hoare triple {23934#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:55:23,085 INFO L290 TraceCheckUtils]: 60: Hoare triple {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:55:23,099 INFO L290 TraceCheckUtils]: 61: Hoare triple {23935#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:55:23,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:55:23,115 INFO L290 TraceCheckUtils]: 63: Hoare triple {23936#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:55:23,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:55:23,134 INFO L290 TraceCheckUtils]: 65: Hoare triple {23937#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:55:23,135 INFO L290 TraceCheckUtils]: 66: Hoare triple {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:55:23,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {23938#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:55:23,156 INFO L290 TraceCheckUtils]: 68: Hoare triple {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:55:23,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {23939#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:55:23,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:55:23,203 INFO L290 TraceCheckUtils]: 71: Hoare triple {23940#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:55:23,204 INFO L290 TraceCheckUtils]: 72: Hoare triple {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:55:23,227 INFO L290 TraceCheckUtils]: 73: Hoare triple {23941#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:55:23,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:55:23,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {23942#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24173#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:55:23,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {24173#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {24173#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:55:23,268 INFO L290 TraceCheckUtils]: 77: Hoare triple {24173#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23904#false} is VALID [2022-04-15 12:55:23,268 INFO L290 TraceCheckUtils]: 78: Hoare triple {23904#false} assume !(~x~0 % 4294967296 < 100000000); {23904#false} is VALID [2022-04-15 12:55:23,268 INFO L272 TraceCheckUtils]: 79: Hoare triple {23904#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {23904#false} is VALID [2022-04-15 12:55:23,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {23904#false} ~cond := #in~cond; {23904#false} is VALID [2022-04-15 12:55:23,269 INFO L290 TraceCheckUtils]: 81: Hoare triple {23904#false} assume 0 == ~cond; {23904#false} is VALID [2022-04-15 12:55:23,269 INFO L290 TraceCheckUtils]: 82: Hoare triple {23904#false} assume !false; {23904#false} is VALID [2022-04-15 12:55:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:55:23,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:56:16,967 INFO L290 TraceCheckUtils]: 82: Hoare triple {23904#false} assume !false; {23904#false} is VALID [2022-04-15 12:56:16,967 INFO L290 TraceCheckUtils]: 81: Hoare triple {23904#false} assume 0 == ~cond; {23904#false} is VALID [2022-04-15 12:56:16,967 INFO L290 TraceCheckUtils]: 80: Hoare triple {23904#false} ~cond := #in~cond; {23904#false} is VALID [2022-04-15 12:56:16,967 INFO L272 TraceCheckUtils]: 79: Hoare triple {23904#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {23904#false} is VALID [2022-04-15 12:56:16,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {23904#false} assume !(~x~0 % 4294967296 < 100000000); {23904#false} is VALID [2022-04-15 12:56:16,967 INFO L290 TraceCheckUtils]: 77: Hoare triple {24210#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {23904#false} is VALID [2022-04-15 12:56:16,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {24214#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24210#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 12:56:16,980 INFO L290 TraceCheckUtils]: 75: Hoare triple {24218#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24214#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:56:16,981 INFO L290 TraceCheckUtils]: 74: Hoare triple {24218#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24218#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:16,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {24225#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24218#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:16,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {24225#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24225#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {24232#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24225#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,012 INFO L290 TraceCheckUtils]: 70: Hoare triple {24232#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24232#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,027 INFO L290 TraceCheckUtils]: 69: Hoare triple {24239#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24232#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,027 INFO L290 TraceCheckUtils]: 68: Hoare triple {24239#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24239#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,043 INFO L290 TraceCheckUtils]: 67: Hoare triple {24246#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24239#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {24246#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24246#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {24253#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24246#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,059 INFO L290 TraceCheckUtils]: 64: Hoare triple {24253#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24253#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {24260#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24253#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {24260#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24260#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {24267#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24260#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {24267#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24267#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {24274#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24267#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {24274#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24274#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {24281#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24274#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,095 INFO L290 TraceCheckUtils]: 56: Hoare triple {24281#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24281#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,110 INFO L290 TraceCheckUtils]: 55: Hoare triple {24288#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24281#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,111 INFO L290 TraceCheckUtils]: 54: Hoare triple {24288#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24288#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,126 INFO L290 TraceCheckUtils]: 53: Hoare triple {24295#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24288#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {24295#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24295#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {24302#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24295#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {24302#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24302#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,157 INFO L290 TraceCheckUtils]: 49: Hoare triple {24309#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24302#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,158 INFO L290 TraceCheckUtils]: 48: Hoare triple {24309#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24309#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,173 INFO L290 TraceCheckUtils]: 47: Hoare triple {24316#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24309#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {24316#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24316#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {24323#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24316#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {24323#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24323#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {24330#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24323#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {24330#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24330#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {24337#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24330#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,209 INFO L290 TraceCheckUtils]: 40: Hoare triple {24337#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24337#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {24344#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24337#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,225 INFO L290 TraceCheckUtils]: 38: Hoare triple {24344#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24344#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {24351#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24344#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {24351#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24351#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {24358#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24351#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {24358#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24358#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {24365#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24358#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,262 INFO L290 TraceCheckUtils]: 32: Hoare triple {24365#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24365#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {24372#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24365#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {24372#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24372#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {24379#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24372#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {24379#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24379#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {24386#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24379#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {24386#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24386#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,310 INFO L290 TraceCheckUtils]: 25: Hoare triple {24393#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24386#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {24393#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24393#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,324 INFO L290 TraceCheckUtils]: 23: Hoare triple {24400#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24393#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {24400#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24400#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {24407#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24400#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {24407#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24407#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {24414#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24407#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {24414#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24414#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {24421#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24414#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {24421#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24421#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {24428#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24421#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {24428#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24428#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {24435#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24428#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {24435#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24435#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {24442#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24435#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {24442#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {24442#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {24449#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24442#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 12:56:17,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {24449#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24449#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {24456#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {24449#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {24456#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {24456#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {23903#true} ~x~0 := 0; {24456#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 12:56:17,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {23903#true} call #t~ret5 := main(); {23903#true} is VALID [2022-04-15 12:56:17,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23903#true} {23903#true} #40#return; {23903#true} is VALID [2022-04-15 12:56:17,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {23903#true} assume true; {23903#true} is VALID [2022-04-15 12:56:17,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {23903#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {23903#true} is VALID [2022-04-15 12:56:17,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {23903#true} call ULTIMATE.init(); {23903#true} is VALID [2022-04-15 12:56:17,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:56:17,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373119050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:56:17,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:56:17,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 39] total 77 [2022-04-15 12:56:17,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:56:17,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2028315249] [2022-04-15 12:56:17,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2028315249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:56:17,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:56:17,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 12:56:17,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735857415] [2022-04-15 12:56:17,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:56:17,437 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 12:56:17,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:56:17,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:56:19,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:56:19,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 12:56:19,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:56:19,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 12:56:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 12:56:19,198 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:46,552 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 12:57:46,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:57:46,552 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-15 12:57:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:57:46,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 95 transitions. [2022-04-15 12:57:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:46,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 95 transitions. [2022-04-15 12:57:46,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 95 transitions. [2022-04-15 12:57:48,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:48,005 INFO L225 Difference]: With dead ends: 94 [2022-04-15 12:57:48,005 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 12:57:48,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 52.8s TimeCoverageRelationStatistics Valid=3103, Invalid=9553, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 12:57:48,007 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:57:48,007 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 99 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 30.6s Time] [2022-04-15 12:57:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 12:57:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 12:57:48,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:57:48,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:48,206 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:48,206 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:48,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:48,206 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 12:57:48,207 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:57:48,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:48,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:48,207 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 12:57:48,207 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 12:57:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:57:48,208 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-04-15 12:57:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:57:48,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:57:48,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:57:48,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:57:48,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:57:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:48,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-04-15 12:57:48,209 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2022-04-15 12:57:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:57:48,209 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-04-15 12:57:48,209 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 38 states have internal predecessors, (79), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:48,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 89 transitions. [2022-04-15 12:57:49,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:49,118 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-04-15 12:57:49,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 12:57:49,118 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:57:49,118 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:57:49,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 12:57:49,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,SelfDestructingSolverStorable72,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:49,319 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:57:49,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:57:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 385605905, now seen corresponding path program 71 times [2022-04-15 12:57:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:49,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492310341] [2022-04-15 12:57:49,550 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:57:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash 824616881, now seen corresponding path program 1 times [2022-04-15 12:57:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305066147] [2022-04-15 12:57:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:57:49,557 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:57:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:57:49,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:57:49,560 INFO L85 PathProgramCache]: Analyzing trace with hash 385605905, now seen corresponding path program 72 times [2022-04-15 12:57:49,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:57:49,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138591352] [2022-04-15 12:57:49,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:57:49,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:57:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:50,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:57:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:50,436 INFO L290 TraceCheckUtils]: 0: Hoare triple {25130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25088#true} is VALID [2022-04-15 12:57:50,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {25088#true} assume true; {25088#true} is VALID [2022-04-15 12:57:50,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25088#true} {25088#true} #40#return; {25088#true} is VALID [2022-04-15 12:57:50,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {25088#true} call ULTIMATE.init(); {25130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:57:50,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {25130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25088#true} is VALID [2022-04-15 12:57:50,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {25088#true} assume true; {25088#true} is VALID [2022-04-15 12:57:50,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25088#true} {25088#true} #40#return; {25088#true} is VALID [2022-04-15 12:57:50,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {25088#true} call #t~ret5 := main(); {25088#true} is VALID [2022-04-15 12:57:50,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {25088#true} ~x~0 := 0; {25093#(= main_~x~0 0)} is VALID [2022-04-15 12:57:50,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {25093#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {25093#(= main_~x~0 0)} is VALID [2022-04-15 12:57:50,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {25093#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25094#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:57:50,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {25094#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {25094#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:57:50,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {25094#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25095#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:57:50,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {25095#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {25095#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:57:50,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {25095#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25096#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:57:50,478 INFO L290 TraceCheckUtils]: 12: Hoare triple {25096#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25096#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:57:50,499 INFO L290 TraceCheckUtils]: 13: Hoare triple {25096#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:57:50,499 INFO L290 TraceCheckUtils]: 14: Hoare triple {25097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:57:50,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {25097#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25098#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:57:50,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {25098#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {25098#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:57:50,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {25098#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25099#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:57:50,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {25099#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {25099#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:57:50,566 INFO L290 TraceCheckUtils]: 19: Hoare triple {25099#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25100#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:57:50,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {25100#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25100#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:57:50,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {25100#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25101#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:57:50,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {25101#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25101#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:57:50,609 INFO L290 TraceCheckUtils]: 23: Hoare triple {25101#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25102#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:57:50,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {25102#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25102#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:57:50,630 INFO L290 TraceCheckUtils]: 25: Hoare triple {25102#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25103#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:57:50,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {25103#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25103#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:57:50,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {25103#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25104#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:57:50,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {25104#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25104#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:57:50,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {25104#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25105#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:57:50,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {25105#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25105#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:57:50,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {25105#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25106#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:57:50,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {25106#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25106#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:57:50,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {25106#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25107#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:57:50,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {25107#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {25107#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:57:50,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {25107#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25108#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:57:50,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {25108#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {25108#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:57:50,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {25108#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25109#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:57:50,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {25109#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25109#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:57:50,767 INFO L290 TraceCheckUtils]: 39: Hoare triple {25109#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25110#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:57:50,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {25110#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {25110#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:57:50,787 INFO L290 TraceCheckUtils]: 41: Hoare triple {25110#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25111#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:57:50,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {25111#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25111#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:57:50,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {25111#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25112#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:57:50,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {25112#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {25112#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:57:50,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {25112#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25113#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:57:50,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {25113#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25113#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:57:50,842 INFO L290 TraceCheckUtils]: 47: Hoare triple {25113#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25114#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:57:50,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {25114#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {25114#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:57:50,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {25114#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25115#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:57:50,867 INFO L290 TraceCheckUtils]: 50: Hoare triple {25115#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {25115#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:57:50,887 INFO L290 TraceCheckUtils]: 51: Hoare triple {25115#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25116#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:57:50,887 INFO L290 TraceCheckUtils]: 52: Hoare triple {25116#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {25116#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:57:50,909 INFO L290 TraceCheckUtils]: 53: Hoare triple {25116#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25117#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:57:50,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {25117#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25117#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:57:50,929 INFO L290 TraceCheckUtils]: 55: Hoare triple {25117#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25118#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:57:50,929 INFO L290 TraceCheckUtils]: 56: Hoare triple {25118#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25118#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:57:50,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {25118#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25119#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:57:50,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {25119#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25119#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:57:50,966 INFO L290 TraceCheckUtils]: 59: Hoare triple {25119#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25120#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:57:50,967 INFO L290 TraceCheckUtils]: 60: Hoare triple {25120#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {25120#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:57:50,984 INFO L290 TraceCheckUtils]: 61: Hoare triple {25120#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25121#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:57:50,985 INFO L290 TraceCheckUtils]: 62: Hoare triple {25121#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {25121#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:57:51,006 INFO L290 TraceCheckUtils]: 63: Hoare triple {25121#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25122#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:57:51,006 INFO L290 TraceCheckUtils]: 64: Hoare triple {25122#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25122#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:57:51,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {25122#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25123#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:57:51,027 INFO L290 TraceCheckUtils]: 66: Hoare triple {25123#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {25123#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:57:51,047 INFO L290 TraceCheckUtils]: 67: Hoare triple {25123#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25124#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:57:51,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {25124#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {25124#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:57:51,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {25124#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25125#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:57:51,083 INFO L290 TraceCheckUtils]: 70: Hoare triple {25125#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25125#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:57:51,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {25125#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25126#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:57:51,107 INFO L290 TraceCheckUtils]: 72: Hoare triple {25126#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25126#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:57:51,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {25126#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25127#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:57:51,129 INFO L290 TraceCheckUtils]: 74: Hoare triple {25127#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {25127#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:57:51,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {25127#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25128#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:57:51,151 INFO L290 TraceCheckUtils]: 76: Hoare triple {25128#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {25128#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:57:51,158 INFO L290 TraceCheckUtils]: 77: Hoare triple {25128#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25129#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:57:51,158 INFO L290 TraceCheckUtils]: 78: Hoare triple {25129#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {25129#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:57:51,159 INFO L290 TraceCheckUtils]: 79: Hoare triple {25129#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {25089#false} is VALID [2022-04-15 12:57:51,160 INFO L290 TraceCheckUtils]: 80: Hoare triple {25089#false} assume !(~x~0 % 4294967296 < 100000000); {25089#false} is VALID [2022-04-15 12:57:51,160 INFO L272 TraceCheckUtils]: 81: Hoare triple {25089#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {25089#false} is VALID [2022-04-15 12:57:51,160 INFO L290 TraceCheckUtils]: 82: Hoare triple {25089#false} ~cond := #in~cond; {25089#false} is VALID [2022-04-15 12:57:51,160 INFO L290 TraceCheckUtils]: 83: Hoare triple {25089#false} assume 0 == ~cond; {25089#false} is VALID [2022-04-15 12:57:51,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {25089#false} assume !false; {25089#false} is VALID [2022-04-15 12:57:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:57:51,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:57:51,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138591352] [2022-04-15 12:57:51,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138591352] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:57:51,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443131490] [2022-04-15 12:57:51,161 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:57:51,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:57:51,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:57:51,162 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:57:51,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 12:57:51,216 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 12:57:51,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:57:51,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 12:57:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:57:51,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:57:51,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {25088#true} call ULTIMATE.init(); {25088#true} is VALID [2022-04-15 12:57:51,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {25088#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25088#true} is VALID [2022-04-15 12:57:51,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {25088#true} assume true; {25088#true} is VALID [2022-04-15 12:57:51,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25088#true} {25088#true} #40#return; {25088#true} is VALID [2022-04-15 12:57:51,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {25088#true} call #t~ret5 := main(); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {25088#true} ~x~0 := 0; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 26: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 27: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 38: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 42: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 43: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 57: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 58: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 59: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,769 INFO L290 TraceCheckUtils]: 63: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 65: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 66: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 67: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 68: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 69: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 70: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 71: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 74: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 75: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:51,770 INFO L290 TraceCheckUtils]: 76: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:51,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25365#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:57:51,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {25365#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !!(~x~0 % 4294967296 < 100000000); {25365#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} is VALID [2022-04-15 12:57:51,777 INFO L290 TraceCheckUtils]: 79: Hoare triple {25365#(< (mod (+ main_~x~0 4294967295) 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {25372#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} is VALID [2022-04-15 12:57:51,780 INFO L290 TraceCheckUtils]: 80: Hoare triple {25372#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 10000000)))} assume !(~x~0 % 4294967296 < 100000000); {25089#false} is VALID [2022-04-15 12:57:51,781 INFO L272 TraceCheckUtils]: 81: Hoare triple {25089#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {25089#false} is VALID [2022-04-15 12:57:51,781 INFO L290 TraceCheckUtils]: 82: Hoare triple {25089#false} ~cond := #in~cond; {25089#false} is VALID [2022-04-15 12:57:51,781 INFO L290 TraceCheckUtils]: 83: Hoare triple {25089#false} assume 0 == ~cond; {25089#false} is VALID [2022-04-15 12:57:51,781 INFO L290 TraceCheckUtils]: 84: Hoare triple {25089#false} assume !false; {25089#false} is VALID [2022-04-15 12:57:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2022-04-15 12:57:51,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:57:54,101 INFO L290 TraceCheckUtils]: 84: Hoare triple {25089#false} assume !false; {25089#false} is VALID [2022-04-15 12:57:54,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {25391#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25089#false} is VALID [2022-04-15 12:57:54,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {25395#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25391#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:57:54,103 INFO L272 TraceCheckUtils]: 81: Hoare triple {25399#(= 100000001 (mod main_~x~0 4294967296))} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {25395#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:57:54,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {25403#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 100000000); {25399#(= 100000001 (mod main_~x~0 4294967296))} is VALID [2022-04-15 12:57:54,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {25407#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {25403#(or (= 100000001 (mod main_~x~0 4294967296)) (< (mod main_~x~0 4294967296) 100000000))} is VALID [2022-04-15 12:57:54,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {25411#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {25407#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000))} is VALID [2022-04-15 12:57:54,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25411#(or (= (mod (+ main_~x~0 2) 4294967296) 100000001) (< (mod (+ main_~x~0 2) 4294967296) 100000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 12:57:54,118 INFO L290 TraceCheckUtils]: 76: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 73: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 66: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 64: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 63: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 62: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 61: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,119 INFO L290 TraceCheckUtils]: 60: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 59: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 57: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 55: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 51: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 50: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 49: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 48: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 47: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 42: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 39: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 37: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 36: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 35: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 34: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 33: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 32: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 31: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 28: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 24: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {25088#true} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {25088#true} assume !!(~x~0 % 4294967296 < 100000000); {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {25088#true} ~x~0 := 0; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {25088#true} call #t~ret5 := main(); {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25088#true} {25088#true} #40#return; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {25088#true} assume true; {25088#true} is VALID [2022-04-15 12:57:54,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {25088#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {25088#true} is VALID [2022-04-15 12:57:54,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {25088#true} call ULTIMATE.init(); {25088#true} is VALID [2022-04-15 12:57:54,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2022-04-15 12:57:54,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443131490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:57:54,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:57:54,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 4, 8] total 48 [2022-04-15 12:57:54,140 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:57:54,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1492310341] [2022-04-15 12:57:54,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1492310341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:57:54,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:57:54,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:57:54,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402332518] [2022-04-15 12:57:54,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:57:54,140 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 12:57:54,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:57:54,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:57:55,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:57:55,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:57:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:57:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:57:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1972, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 12:57:55,594 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:35,541 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 12:59:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 12:59:35,541 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-15 12:59:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:59:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-04-15 12:59:35,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 97 transitions. [2022-04-15 12:59:35,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 97 transitions. [2022-04-15 12:59:37,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:37,695 INFO L225 Difference]: With dead ends: 96 [2022-04-15 12:59:37,695 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 12:59:37,695 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=650, Invalid=6490, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 12:59:37,696 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:59:37,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 199 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2853 Invalid, 0 Unknown, 0 Unchecked, 34.7s Time] [2022-04-15 12:59:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 12:59:37,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-04-15 12:59:37,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:59:37,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:37,902 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:37,902 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:37,902 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-04-15 12:59:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-15 12:59:37,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:37,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:37,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 12:59:37,903 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-15 12:59:37,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:59:37,904 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2022-04-15 12:59:37,904 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-15 12:59:37,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:59:37,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:59:37,904 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:59:37,904 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:59:37,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.0357142857142858) internal successors, (87), 84 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:37,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-04-15 12:59:37,905 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 85 [2022-04-15 12:59:37,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:59:37,905 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-04-15 12:59:37,905 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.025) internal successors, (81), 39 states have internal predecessors, (81), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:59:37,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 91 transitions. [2022-04-15 12:59:39,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:59:39,466 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-04-15 12:59:39,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 12:59:39,466 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:59:39,466 INFO L499 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:59:39,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 12:59:39,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,SelfDestructingSolverStorable74,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:39,667 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:59:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:59:39,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1152942994, now seen corresponding path program 73 times [2022-04-15 12:59:39,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:59:39,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2069403884] [2022-04-15 12:59:39,936 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 12:59:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash 883722225, now seen corresponding path program 1 times [2022-04-15 12:59:39,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:39,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614014366] [2022-04-15 12:59:39,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:39,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:59:39,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:59:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:59:39,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:59:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1152942994, now seen corresponding path program 74 times [2022-04-15 12:59:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:59:39,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120403109] [2022-04-15 12:59:39,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:59:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:59:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:59:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:40,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {26313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26270#true} is VALID [2022-04-15 12:59:40,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {26270#true} assume true; {26270#true} is VALID [2022-04-15 12:59:40,838 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26270#true} {26270#true} #40#return; {26270#true} is VALID [2022-04-15 12:59:40,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {26270#true} call ULTIMATE.init(); {26313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:59:40,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {26313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26270#true} is VALID [2022-04-15 12:59:40,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {26270#true} assume true; {26270#true} is VALID [2022-04-15 12:59:40,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26270#true} {26270#true} #40#return; {26270#true} is VALID [2022-04-15 12:59:40,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {26270#true} call #t~ret5 := main(); {26270#true} is VALID [2022-04-15 12:59:40,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {26270#true} ~x~0 := 0; {26275#(= main_~x~0 0)} is VALID [2022-04-15 12:59:40,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {26275#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {26275#(= main_~x~0 0)} is VALID [2022-04-15 12:59:40,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {26275#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:59:40,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:59:40,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:59:40,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:59:40,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:59:40,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:59:40,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:59:40,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:59:40,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:59:40,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:59:41,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:59:41,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:59:41,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:59:41,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:59:41,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:59:41,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:59:41,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:59:41,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:59:41,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:59:41,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:59:41,243 INFO L290 TraceCheckUtils]: 27: Hoare triple {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:59:41,244 INFO L290 TraceCheckUtils]: 28: Hoare triple {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:59:41,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:59:41,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:59:41,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:59:41,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:59:41,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:59:41,347 INFO L290 TraceCheckUtils]: 34: Hoare triple {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:59:41,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:59:41,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:59:41,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:59:41,430 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:59:41,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:59:41,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:59:41,511 INFO L290 TraceCheckUtils]: 41: Hoare triple {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:59:41,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:59:41,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:59:41,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:59:41,583 INFO L290 TraceCheckUtils]: 45: Hoare triple {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:59:41,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:59:41,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:59:41,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:59:41,666 INFO L290 TraceCheckUtils]: 49: Hoare triple {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:59:41,666 INFO L290 TraceCheckUtils]: 50: Hoare triple {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:59:41,708 INFO L290 TraceCheckUtils]: 51: Hoare triple {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:59:41,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:59:41,749 INFO L290 TraceCheckUtils]: 53: Hoare triple {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:59:41,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:59:41,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:59:41,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:59:41,833 INFO L290 TraceCheckUtils]: 57: Hoare triple {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:59:41,833 INFO L290 TraceCheckUtils]: 58: Hoare triple {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:59:41,864 INFO L290 TraceCheckUtils]: 59: Hoare triple {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:59:41,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:59:41,906 INFO L290 TraceCheckUtils]: 61: Hoare triple {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:59:41,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:59:41,958 INFO L290 TraceCheckUtils]: 63: Hoare triple {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:59:41,959 INFO L290 TraceCheckUtils]: 64: Hoare triple {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:59:42,000 INFO L290 TraceCheckUtils]: 65: Hoare triple {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:59:42,001 INFO L290 TraceCheckUtils]: 66: Hoare triple {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:59:42,042 INFO L290 TraceCheckUtils]: 67: Hoare triple {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:59:42,043 INFO L290 TraceCheckUtils]: 68: Hoare triple {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:59:42,084 INFO L290 TraceCheckUtils]: 69: Hoare triple {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:59:42,084 INFO L290 TraceCheckUtils]: 70: Hoare triple {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:59:42,126 INFO L290 TraceCheckUtils]: 71: Hoare triple {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:59:42,126 INFO L290 TraceCheckUtils]: 72: Hoare triple {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:59:42,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:59:42,168 INFO L290 TraceCheckUtils]: 74: Hoare triple {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:59:42,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:59:42,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:59:42,252 INFO L290 TraceCheckUtils]: 77: Hoare triple {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:59:42,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:59:42,268 INFO L290 TraceCheckUtils]: 79: Hoare triple {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26312#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:59:42,268 INFO L290 TraceCheckUtils]: 80: Hoare triple {26312#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !!(~x~0 % 4294967296 < 100000000); {26312#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-15 12:59:42,270 INFO L290 TraceCheckUtils]: 81: Hoare triple {26312#(and (<= main_~x~0 37) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {26271#false} is VALID [2022-04-15 12:59:42,270 INFO L290 TraceCheckUtils]: 82: Hoare triple {26271#false} assume !(~x~0 % 4294967296 < 100000000); {26271#false} is VALID [2022-04-15 12:59:42,270 INFO L272 TraceCheckUtils]: 83: Hoare triple {26271#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {26271#false} is VALID [2022-04-15 12:59:42,270 INFO L290 TraceCheckUtils]: 84: Hoare triple {26271#false} ~cond := #in~cond; {26271#false} is VALID [2022-04-15 12:59:42,270 INFO L290 TraceCheckUtils]: 85: Hoare triple {26271#false} assume 0 == ~cond; {26271#false} is VALID [2022-04-15 12:59:42,270 INFO L290 TraceCheckUtils]: 86: Hoare triple {26271#false} assume !false; {26271#false} is VALID [2022-04-15 12:59:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:42,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:59:42,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120403109] [2022-04-15 12:59:42,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120403109] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:59:42,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548081442] [2022-04-15 12:59:42,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:59:42,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:59:42,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:59:42,272 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:59:42,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 12:59:42,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:59:42,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:59:42,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-15 12:59:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:59:42,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:59:42,919 INFO L272 TraceCheckUtils]: 0: Hoare triple {26270#true} call ULTIMATE.init(); {26270#true} is VALID [2022-04-15 12:59:42,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {26270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26270#true} is VALID [2022-04-15 12:59:42,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {26270#true} assume true; {26270#true} is VALID [2022-04-15 12:59:42,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26270#true} {26270#true} #40#return; {26270#true} is VALID [2022-04-15 12:59:42,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {26270#true} call #t~ret5 := main(); {26270#true} is VALID [2022-04-15 12:59:42,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {26270#true} ~x~0 := 0; {26275#(= main_~x~0 0)} is VALID [2022-04-15 12:59:42,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {26275#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 100000000); {26275#(= main_~x~0 0)} is VALID [2022-04-15 12:59:42,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {26275#(= main_~x~0 0)} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:59:42,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 100000000); {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-15 12:59:42,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {26276#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:59:42,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 100000000); {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-15 12:59:42,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {26277#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:59:42,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-15 12:59:43,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {26278#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:59:43,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-15 12:59:43,026 INFO L290 TraceCheckUtils]: 15: Hoare triple {26279#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:59:43,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !!(~x~0 % 4294967296 < 100000000); {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-15 12:59:43,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {26280#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:59:43,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 100000000); {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-15 12:59:43,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {26281#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:59:43,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-15 12:59:43,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {26282#(and (<= main_~x~0 7) (<= 7 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:59:43,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-15 12:59:43,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {26283#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:59:43,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-15 12:59:43,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {26284#(and (<= main_~x~0 9) (<= 9 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:59:43,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-15 12:59:43,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {26285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:59:43,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-15 12:59:43,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {26286#(and (<= main_~x~0 11) (<= 11 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:59:43,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-15 12:59:43,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {26287#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:59:43,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-15 12:59:43,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {26288#(and (<= main_~x~0 13) (<= 13 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:59:43,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 100000000); {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-15 12:59:43,284 INFO L290 TraceCheckUtils]: 35: Hoare triple {26289#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:59:43,284 INFO L290 TraceCheckUtils]: 36: Hoare triple {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume !!(~x~0 % 4294967296 < 100000000); {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-15 12:59:43,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {26290#(and (<= 15 main_~x~0) (<= main_~x~0 15))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:59:43,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-15 12:59:43,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {26291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:59:43,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume !!(~x~0 % 4294967296 < 100000000); {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-15 12:59:43,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {26292#(and (<= 17 main_~x~0) (<= main_~x~0 17))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:59:43,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-15 12:59:43,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {26293#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:59:43,386 INFO L290 TraceCheckUtils]: 44: Hoare triple {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume !!(~x~0 % 4294967296 < 100000000); {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-15 12:59:43,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {26294#(and (<= 19 main_~x~0) (<= main_~x~0 19))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:59:43,412 INFO L290 TraceCheckUtils]: 46: Hoare triple {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-15 12:59:43,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {26295#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:59:43,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume !!(~x~0 % 4294967296 < 100000000); {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-15 12:59:43,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {26296#(and (<= 21 main_~x~0) (<= main_~x~0 21))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:59:43,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 100000000); {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-15 12:59:43,493 INFO L290 TraceCheckUtils]: 51: Hoare triple {26297#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:59:43,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume !!(~x~0 % 4294967296 < 100000000); {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-15 12:59:43,520 INFO L290 TraceCheckUtils]: 53: Hoare triple {26298#(and (<= 23 main_~x~0) (<= main_~x~0 23))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:59:43,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-15 12:59:43,549 INFO L290 TraceCheckUtils]: 55: Hoare triple {26299#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:59:43,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-15 12:59:43,576 INFO L290 TraceCheckUtils]: 57: Hoare triple {26300#(and (<= main_~x~0 25) (<= 25 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:59:43,576 INFO L290 TraceCheckUtils]: 58: Hoare triple {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-15 12:59:43,598 INFO L290 TraceCheckUtils]: 59: Hoare triple {26301#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:59:43,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume !!(~x~0 % 4294967296 < 100000000); {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-15 12:59:43,627 INFO L290 TraceCheckUtils]: 61: Hoare triple {26302#(and (<= 27 main_~x~0) (<= main_~x~0 27))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:59:43,628 INFO L290 TraceCheckUtils]: 62: Hoare triple {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 100000000); {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-15 12:59:43,653 INFO L290 TraceCheckUtils]: 63: Hoare triple {26303#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:59:43,654 INFO L290 TraceCheckUtils]: 64: Hoare triple {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-15 12:59:43,681 INFO L290 TraceCheckUtils]: 65: Hoare triple {26304#(and (<= main_~x~0 29) (<= 29 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:59:43,681 INFO L290 TraceCheckUtils]: 66: Hoare triple {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 100000000); {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-15 12:59:43,707 INFO L290 TraceCheckUtils]: 67: Hoare triple {26305#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:59:43,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume !!(~x~0 % 4294967296 < 100000000); {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-15 12:59:43,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {26306#(and (<= 31 main_~x~0) (<= main_~x~0 31))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:59:43,737 INFO L290 TraceCheckUtils]: 70: Hoare triple {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-15 12:59:43,763 INFO L290 TraceCheckUtils]: 71: Hoare triple {26307#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:59:43,764 INFO L290 TraceCheckUtils]: 72: Hoare triple {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-15 12:59:43,791 INFO L290 TraceCheckUtils]: 73: Hoare triple {26308#(and (<= main_~x~0 33) (<= 33 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:59:43,792 INFO L290 TraceCheckUtils]: 74: Hoare triple {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-15 12:59:43,818 INFO L290 TraceCheckUtils]: 75: Hoare triple {26309#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:59:43,819 INFO L290 TraceCheckUtils]: 76: Hoare triple {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume !!(~x~0 % 4294967296 < 100000000); {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} is VALID [2022-04-15 12:59:43,845 INFO L290 TraceCheckUtils]: 77: Hoare triple {26310#(and (<= 35 main_~x~0) (<= main_~x~0 35))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:59:43,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-15 12:59:43,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {26311#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26554#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-15 12:59:43,873 INFO L290 TraceCheckUtils]: 80: Hoare triple {26554#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !!(~x~0 % 4294967296 < 100000000); {26554#(and (<= main_~x~0 37) (<= 37 main_~x~0))} is VALID [2022-04-15 12:59:43,891 INFO L290 TraceCheckUtils]: 81: Hoare triple {26554#(and (<= main_~x~0 37) (<= 37 main_~x~0))} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {26271#false} is VALID [2022-04-15 12:59:43,891 INFO L290 TraceCheckUtils]: 82: Hoare triple {26271#false} assume !(~x~0 % 4294967296 < 100000000); {26271#false} is VALID [2022-04-15 12:59:43,891 INFO L272 TraceCheckUtils]: 83: Hoare triple {26271#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {26271#false} is VALID [2022-04-15 12:59:43,891 INFO L290 TraceCheckUtils]: 84: Hoare triple {26271#false} ~cond := #in~cond; {26271#false} is VALID [2022-04-15 12:59:43,891 INFO L290 TraceCheckUtils]: 85: Hoare triple {26271#false} assume 0 == ~cond; {26271#false} is VALID [2022-04-15 12:59:43,891 INFO L290 TraceCheckUtils]: 86: Hoare triple {26271#false} assume !false; {26271#false} is VALID [2022-04-15 12:59:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:59:43,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:00:24,625 INFO L290 TraceCheckUtils]: 86: Hoare triple {26271#false} assume !false; {26271#false} is VALID [2022-04-15 13:00:24,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {26271#false} assume 0 == ~cond; {26271#false} is VALID [2022-04-15 13:00:24,626 INFO L290 TraceCheckUtils]: 84: Hoare triple {26271#false} ~cond := #in~cond; {26271#false} is VALID [2022-04-15 13:00:24,626 INFO L272 TraceCheckUtils]: 83: Hoare triple {26271#false} call __VERIFIER_assert((if 100000001 == ~x~0 % 4294967296 then 1 else 0)); {26271#false} is VALID [2022-04-15 13:00:24,626 INFO L290 TraceCheckUtils]: 82: Hoare triple {26271#false} assume !(~x~0 % 4294967296 < 100000000); {26271#false} is VALID [2022-04-15 13:00:24,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {26591#(< (mod main_~x~0 4294967296) 10000000)} assume !(~x~0 % 4294967296 < 10000000);~x~0 := 2 + ~x~0; {26271#false} is VALID [2022-04-15 13:00:24,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {26595#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26591#(< (mod main_~x~0 4294967296) 10000000)} is VALID [2022-04-15 13:00:24,638 INFO L290 TraceCheckUtils]: 79: Hoare triple {26599#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26595#(or (< (mod main_~x~0 4294967296) 10000000) (not (< (mod main_~x~0 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,639 INFO L290 TraceCheckUtils]: 78: Hoare triple {26599#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26599#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {26606#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26599#(or (< (mod (+ main_~x~0 1) 4294967296) 10000000) (not (< (mod (+ main_~x~0 1) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {26606#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26606#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,673 INFO L290 TraceCheckUtils]: 75: Hoare triple {26613#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26606#(or (< (mod (+ main_~x~0 2) 4294967296) 10000000) (not (< (mod (+ main_~x~0 2) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,674 INFO L290 TraceCheckUtils]: 74: Hoare triple {26613#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26613#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,691 INFO L290 TraceCheckUtils]: 73: Hoare triple {26620#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26613#(or (not (< (mod (+ main_~x~0 3) 4294967296) 100000000)) (< (mod (+ main_~x~0 3) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,691 INFO L290 TraceCheckUtils]: 72: Hoare triple {26620#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26620#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,708 INFO L290 TraceCheckUtils]: 71: Hoare triple {26627#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26620#(or (< (mod (+ main_~x~0 4) 4294967296) 10000000) (not (< (mod (+ main_~x~0 4) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {26627#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26627#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,734 INFO L290 TraceCheckUtils]: 69: Hoare triple {26634#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26627#(or (not (< (mod (+ 5 main_~x~0) 4294967296) 100000000)) (< (mod (+ 5 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,734 INFO L290 TraceCheckUtils]: 68: Hoare triple {26634#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26634#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {26641#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26634#(or (not (< (mod (+ main_~x~0 6) 4294967296) 100000000)) (< (mod (+ main_~x~0 6) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {26641#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26641#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,754 INFO L290 TraceCheckUtils]: 65: Hoare triple {26648#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26641#(or (not (< (mod (+ 7 main_~x~0) 4294967296) 100000000)) (< (mod (+ 7 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,754 INFO L290 TraceCheckUtils]: 64: Hoare triple {26648#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26648#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {26655#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26648#(or (not (< (mod (+ main_~x~0 8) 4294967296) 100000000)) (< (mod (+ main_~x~0 8) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {26655#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26655#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {26662#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26655#(or (< (mod (+ main_~x~0 9) 4294967296) 10000000) (not (< (mod (+ main_~x~0 9) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,773 INFO L290 TraceCheckUtils]: 60: Hoare triple {26662#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26662#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,790 INFO L290 TraceCheckUtils]: 59: Hoare triple {26669#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26662#(or (< (mod (+ main_~x~0 10) 4294967296) 10000000) (not (< (mod (+ main_~x~0 10) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,790 INFO L290 TraceCheckUtils]: 58: Hoare triple {26669#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26669#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {26676#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26669#(or (not (< (mod (+ main_~x~0 11) 4294967296) 100000000)) (< (mod (+ main_~x~0 11) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {26676#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26676#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,825 INFO L290 TraceCheckUtils]: 55: Hoare triple {26683#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26676#(or (not (< (mod (+ main_~x~0 12) 4294967296) 100000000)) (< (mod (+ main_~x~0 12) 4294967296) 10000000))} is VALID [2022-04-15 13:00:24,825 INFO L290 TraceCheckUtils]: 54: Hoare triple {26683#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26683#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {26690#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26683#(or (< (mod (+ main_~x~0 13) 4294967296) 10000000) (not (< (mod (+ main_~x~0 13) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,843 INFO L290 TraceCheckUtils]: 52: Hoare triple {26690#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26690#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {26697#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26690#(or (< (mod (+ main_~x~0 14) 4294967296) 10000000) (not (< (mod (+ main_~x~0 14) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {26697#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26697#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,877 INFO L290 TraceCheckUtils]: 49: Hoare triple {26704#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26697#(or (< (mod (+ main_~x~0 15) 4294967296) 10000000) (not (< (mod (+ main_~x~0 15) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {26704#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26704#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {26711#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26704#(or (< (mod (+ main_~x~0 16) 4294967296) 10000000) (not (< (mod (+ main_~x~0 16) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {26711#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26711#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,899 INFO L290 TraceCheckUtils]: 45: Hoare triple {26718#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26711#(or (< (mod (+ main_~x~0 17) 4294967296) 10000000) (not (< (mod (+ main_~x~0 17) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {26718#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26718#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {26725#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26718#(or (< (mod (+ main_~x~0 18) 4294967296) 10000000) (not (< (mod (+ main_~x~0 18) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {26725#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26725#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,934 INFO L290 TraceCheckUtils]: 41: Hoare triple {26732#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26725#(or (< (mod (+ 19 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 19 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,934 INFO L290 TraceCheckUtils]: 40: Hoare triple {26732#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26732#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {26739#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26732#(or (< (mod (+ main_~x~0 20) 4294967296) 10000000) (not (< (mod (+ main_~x~0 20) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {26739#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26739#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {26746#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26739#(or (< (mod (+ main_~x~0 21) 4294967296) 10000000) (not (< (mod (+ main_~x~0 21) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {26746#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26746#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,958 INFO L290 TraceCheckUtils]: 35: Hoare triple {26753#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26746#(or (< (mod (+ main_~x~0 22) 4294967296) 10000000) (not (< (mod (+ main_~x~0 22) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,958 INFO L290 TraceCheckUtils]: 34: Hoare triple {26753#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26753#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {26760#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26753#(or (< (mod (+ 23 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 23 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {26760#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26760#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {26767#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26760#(or (< (mod (+ main_~x~0 24) 4294967296) 10000000) (not (< (mod (+ main_~x~0 24) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:24,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {26767#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26767#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {26774#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26767#(or (not (< (mod (+ main_~x~0 25) 4294967296) 100000000)) (< (mod (+ main_~x~0 25) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {26774#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26774#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {26781#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26774#(or (< (mod (+ main_~x~0 26) 4294967296) 10000000) (not (< (mod (+ main_~x~0 26) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {26781#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26781#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {26788#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26781#(or (< (mod (+ main_~x~0 27) 4294967296) 10000000) (not (< (mod (+ main_~x~0 27) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {26788#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26788#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {26795#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26788#(or (not (< (mod (+ main_~x~0 28) 4294967296) 100000000)) (< (mod (+ main_~x~0 28) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {26795#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26795#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {26802#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26795#(or (< (mod (+ 29 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 29 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {26802#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26802#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {26809#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26802#(or (< (mod (+ 30 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 30 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {26809#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26809#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {26816#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26809#(or (< (mod (+ main_~x~0 31) 4294967296) 10000000) (not (< (mod (+ main_~x~0 31) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {26816#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26816#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {26823#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26816#(or (< (mod (+ 32 main_~x~0) 4294967296) 10000000) (not (< (mod (+ 32 main_~x~0) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {26823#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26823#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {26830#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26823#(or (< (mod (+ main_~x~0 33) 4294967296) 10000000) (not (< (mod (+ main_~x~0 33) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {26830#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26830#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {26837#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26830#(or (not (< (mod (+ main_~x~0 34) 4294967296) 100000000)) (< (mod (+ main_~x~0 34) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {26837#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26837#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {26844#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26837#(or (not (< (mod (+ 35 main_~x~0) 4294967296) 100000000)) (< (mod (+ 35 main_~x~0) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {26844#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} assume !!(~x~0 % 4294967296 < 100000000); {26844#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {26851#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} assume ~x~0 % 4294967296 < 10000000;#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4; {26844#(or (not (< (mod (+ main_~x~0 36) 4294967296) 100000000)) (< (mod (+ main_~x~0 36) 4294967296) 10000000))} is VALID [2022-04-15 13:00:25,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {26851#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} assume !!(~x~0 % 4294967296 < 100000000); {26851#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {26270#true} ~x~0 := 0; {26851#(or (< (mod (+ main_~x~0 37) 4294967296) 10000000) (not (< (mod (+ main_~x~0 37) 4294967296) 100000000)))} is VALID [2022-04-15 13:00:25,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {26270#true} call #t~ret5 := main(); {26270#true} is VALID [2022-04-15 13:00:25,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26270#true} {26270#true} #40#return; {26270#true} is VALID [2022-04-15 13:00:25,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {26270#true} assume true; {26270#true} is VALID [2022-04-15 13:00:25,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {26270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(12, 2);call #Ultimate.allocInit(12, 3); {26270#true} is VALID [2022-04-15 13:00:25,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {26270#true} call ULTIMATE.init(); {26270#true} is VALID [2022-04-15 13:00:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:00:25,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548081442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:00:25,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:00:25,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 41] total 81 [2022-04-15 13:00:25,176 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:00:25,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2069403884] [2022-04-15 13:00:25,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2069403884] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:00:25,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:00:25,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 13:00:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613860337] [2022-04-15 13:00:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:00:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-15 13:00:25,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:00:25,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:00:27,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:00:27,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 13:00:27,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:00:27,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 13:00:27,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1719, Invalid=4761, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 13:00:27,242 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 40 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)